An exact algorithm for vehicle routing and scheduling problem of free pickup and delivery service in flight ticket sales companies based on set-partitioning model
- 16 September 2009
- journal article
- Published by Springer Nature in Journal of Intelligent Manufacturing
- Vol. 22 (5) , 789-799
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- Formulations and exact algorithms for the vehicle routing problem with time windowsComputers & Operations Research, 2008
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cutsMathematical Programming, 2007
- Local search with annealing-like restarts to solve the VRPTWEuropean Journal of Operational Research, 2003
- Vehicle routing problem with time windows and a limited number of vehiclesEuropean Journal of Operational Research, 2003
- A unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society, 2001
- Simulated annealing metaheuristics for the vehicle routing problem with time windowsAnnals of Operations Research, 1996
- A parallel implementation of the Tabu search heuristic for vehicle routing problems with time window constraintsComputers & Operations Research, 1994
- A parallel route building algorithm for the vehicle routing and scheduling problem with time windowsEuropean Journal of Operational Research, 1993
- On the worst‐case performance of some heuristics for the vehicle routing and scheduling problem with time window constraintsNetworks, 1986
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxationsMathematical Programming, 1981