The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach

DOI10.1016/j.cor.2022.105929OpenAlexW4285992064MaRDI QIDQ2676335

Pol Arias-Melia, Jiyin Liu, Rupal Mandania

Publication date: 27 September 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2022.105929

zbMATH Keywords

heuristicsinteger programmingschedulingroutingvehicle sharing

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (1)

Online generalized assignment problem with historical information

Cites Work

• Unnamed Item
• Unnamed Item
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Home health care routing and scheduling: a review
• Heuristic algorithms for the operator-based relocation problem in one-way electric carsharing systems
• Vehicle routing with transportable resources: using carpooling and walking for on-site services
• Workforce routing and scheduling for electricity network maintenance with downtime minimization
• The dial-a-ride problem: Models and algorithms
• Two exact algorithms for the distance-constrained vehicle routing problem
• An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation

This page was built for publication: The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach