Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach
Authors:
- Cihan ÇetinkayaCÇCihan Çetinkaya
- Ismail KaraoglanIKIsmail Karaoglan
- Hadi GökçenHGHadi Gökçen
- 1 November 2013
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 230 (3) , 539-550
Abstract
No abstract availableThis publication has 25 references indexed in Scilit:
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraintsEuropean Journal of Operational Research, 2012
- Some applications of the generalized vehicle routing problemJournal of the Operational Research Society, 2010
- The vehicle routing problem: A taxonomic reviewComputers & Industrial Engineering, 2009
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problemComputers & Operations Research, 2009
- Distribution network design: New problems and related modelsEuropean Journal of Operational Research, 2005
- An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing ProblemTransportation Science, 2003
- Separating capacity constraints in the CVRP using tabu searchEuropean Journal of Operational Research, 1998
- A branch-and-cut algorithm for vehicle routing problemsAnnals of Operations Research, 1994
- Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraintsOperations Research Letters, 1991
- The Truck Dispatching ProblemManagement Science, 1959