Tabu search techniques for the heterogeneous vehicle routing problem with time windows and carrier-dependent costs
- 386 Downloads
In this work we formalize a new complex variant of the classical vehicle routing problem arising from a real-world application. Our formulation includes a heterogeneous fleet, a multi-day planning horizon, a complex carrier-dependent cost for vehicles, and the possibility of leaving orders unscheduled.
For tackling this problem we propose a metaheuristic approach based on Tabu Search and on a combination of neighborhood relations. We perform an experimental analysis to tune and compare different combinations, highlighting the most important features of the algorithm.
The outcome is that a significant improvement is obtained by a complex combination of neighborhood relations.
In addition, we compare our solver with previous work on public benchmarks of a similar version of the problem, namely the Vehicle Routing Problem with Private fleet and Common carrier. The conclusion is that our results are competitive with the best ones in literature.
KeywordsVehicle routing Tabu search
Unable to display preview. Download preview PDF.
- Baldacci, R., Battara, M., & Vigo, D. (2007) Routing a heterogeneous fleet of vehicles (Technical Report 2007/1). DEIS, University of Bologna. Google Scholar
- Birattari, M., Stützle, T., Paquete, L., & Varrentrapp, K. (2002). A racing algorithm for configuring metaheuristics. In W. B. Langdon et al. (Eds.), GECCO 2002: Proceedings of the genetic and evolutionary computation conference (pp. 11–18). New York: Morgan Kaufmann. Google Scholar
- Dell’Amico, M., Monaci, M., Pagani, C., & Vigo, D. (2006) Heuristic approaches for the fllet size and mix vehicle routing problem with time windows (Tech. rep.). DISMI, University of Modena and Reggio Emilia, Italy. Google Scholar
- Di Gaspero, L., Roli, A., & Schaerf, A. (2007). EasyAnalyzer: an object-oriented framework for the experimental analysis of stochastic local search algorithms. In T. Stützle, M. Birattari, & H. Hoos (Eds.), Lecture notes in computer science: Vol. 4683. Engineering stochastic local search algorithms (SLS-2007) (pp. 76–90). Berlin: Springer. Google Scholar
- Diaby, M., & Ramesh, R. (1995). The distribution problem with carrier service: a dual based approach. ORSA Journal on Computing, 7(1), 24–35. Google Scholar
- Hoos, H. H., & Stützle, T. (2005). Stochastic local search—foundations and applications. San Francisco: Morgan Kaufmann. Google Scholar
- Hvattum, L. M. (2009). On the value of aspiration criteria in tabu search. In The VIII metaheuristics international conference (MIC 2009), Hamburg, Germany. Google Scholar
- Liu, F. H., & SY, Shen (1999). The fleet size and mix vehicle routing problem with time windows. Journal of the Operational Research Society, 50(7), 721–732. Google Scholar
- Ochi, L. S., Vianna, D. S., Drummond, L. M. A., & Victor, A. O. (1998). A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Parallel and Distributed Processing, 1388, 216–224. Google Scholar
- Toth, P., & Vigo, D. (2001). An overview of vehicle routing problems. In The vehicle routing problem (pp. 1–26). Philadelphia: Society for Industrial and Applied Mathematics. Google Scholar
- Toth, P., & Vigo, D. (Eds.) (2002). The vehicle routing problem. Monographs on discrete mathematics and applications. Philadelphia: SIAM. Google Scholar
- Venables, W. N., & Ripley, B. D. (2002). Statistics and computing. Modern applied statistics with S (4th ed.). Berlin: Springer. Google Scholar
- Volgenant, T., & Jonker, R. (1987). On some generalizations of the travelling-salesman problem. Journal of the Operational Research Society, 38(11), 1073–1079. Google Scholar