A Tabu Search Heuristic for the Heterogeneous Vehicle Routing Problem on a Multi-graph

David S. W. Lai, Ozgun C. Demirag

2014

Abstract

This paper addresses the Heterogeneous Vehicle Routing Problem (HVRP) where a mixed fleet of vehicles, having distinct vehicle capacities, fixed costs and travel costs, is used to serve a set of customers. With the presence of parallel arcs in the underlying graph, many simple operations in classical heuristics become difficult optimization subproblems. We present an insertion-based heuristic and a tabu search heuristic for obtaining near-optimal solutions in a short time. Insertion costs are estimated with customer sequencing and arc selection efficiently. Extensive computational tests have been performed for sensitivity analysis.

References

  1. Baldacci, R., Battarra, M., and Vigo, D. (2008). Routing a heterogeneous fleet of vehicles. In Golden, B., Raghavan, S., and Wasil, E., editors, The vehicle routing problem: latest advances and new challenges, volume 43 of Operations Research/Computer Science Interfaces, pages 3-27. Springer US.
  2. Baldacci, R. and Mingozzi, A. (2009). A unified exact method for solving different classes of vehicle routing problems. Math. Programming, 120:347-380.
  3. Bräysy, O. and Gendreau, M. (2005). Vehicle routing problem with time windows, part i: Route construction and local search algorithms. Transportation Sci., 39:104- 118.
  4. Cordeau, J., Laporte, G., Savelsbergh, M., and Vigo, D. (2007). Vehicle routing. In Barnhart, C. and Laporte, G., editors, Transportation, Handbooks in Operations Research and Management Science, volume 14, pages 367-428. Elsevier, Amsterdam.
  5. Dai, J. and Zhou, C. (2008). Beer Distribution in China. PhD thesis, The School of Industrial and Systems Engineering, Georgia Institute of Technology.
  6. Garaix, T., Artigues, C., Feillet, D., and Josselin, D. (2010). Vehicle routing problems with alternative paths: An application to on-demand transportation. Eur. J. Oper. Res., 204:62-75.
  7. Gendreau, M., Laporte, G., Musaraganyi, C., and Taillard, E. (1999). A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers & Operations Resesarch, 26:1153-1173.
  8. Golden, B., Assad, A., Levy, L., and Gheysens, F. (1984). The fleet size and mix vehicle routing problem. Computers & Operations Resesarch, 11:49-66.
  9. Ho, S. and Gendreau, M. (2006). Path relinking for the vehicle routing problem. J. Heuristics, 12:55-72.
  10. Renaud, J. and Boctor, F. (2002). A sweep-based algorithm for the fleet size and mix vehicle routing problem. Eur. J. Oper. Res., 140:618-628.
  11. Rochat, Y. and Taillard, E. (1995). Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics, 1:147-167.
  12. Taillard, E. (1999). A heuristic column generation method for the heterogeneous fleet vrp. RAIRO - Operations Research, 33:1-14.
  13. Yaman, H. (2006). Formulations and valid inequalities for the heterogeneous vehicle routing problem. Math. Programming, 106:365-390.
Download


Paper Citation


in Harvard Style

S. W. Lai D. and C. Demirag O. (2014). A Tabu Search Heuristic for the Heterogeneous Vehicle Routing Problem on a Multi-graph . In Doctoral Consortium - DCORES, (ICORES 2014) ISBN Not Available, pages 18-26


in Bibtex Style

@conference{dcores14,
author={David S. W. Lai and Ozgun C. Demirag},
title={A Tabu Search Heuristic for the Heterogeneous Vehicle Routing Problem on a Multi-graph},
booktitle={Doctoral Consortium - DCORES, (ICORES 2014)},
year={2014},
pages={18-26},
publisher={SciTePress},
organization={INSTICC},
doi={},
isbn={Not Available},
}


in EndNote Style

TY - CONF
JO - Doctoral Consortium - DCORES, (ICORES 2014)
TI - A Tabu Search Heuristic for the Heterogeneous Vehicle Routing Problem on a Multi-graph
SN - Not Available
AU - S. W. Lai D.
AU - C. Demirag O.
PY - 2014
SP - 18
EP - 26
DO -