This work is motivated by a problem proposed to the authors by a bakery company in Northern Spain. The objective is to design the daily routes over the week in order to minimize the total traveled distance. For reducing this total distance, some flexibility in the dates of delivery is introduced, which will cause a stock. Therefore, we study the problem under the bi-objective perspective, “minimizing” simultaneously the total traveled distance and the stock. A bi-objective mixed-integer linear model for the problem is formulated and two methodologies of solution are presented. The first one is based on a series of linked variable neighborhood searches and the second one is based on NSGA-II provided of specific operators. Numerical results showing the obtained estimated Pareto front in both cases are presented.
KeywordsVRP with flexibility in delivery VNS NSGA-II
Unable to display preview. Download preview PDF.
- Jozefowiez, N., Semet, F., Talbi, E.-G.: From single-objective to multiobjective vehicle routing problems: Motivations, case studies, and methods. In: Golden, B.L., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges, pp. 445–471. Springer, Berlin (2008a) CrossRefGoogle Scholar
- Or, I.: Traveling Salesman Type Combinatorial Problems and their relations to the logistics of blood banking. Dissertation, Northwestern University (1976) Google Scholar
- Romero, C.: Teoría de la Decisión Multicriterio: Conceptos, Técnicas y Aplicaciones. Alianza Universidad Textos. Alianza Editorial, Madrid (1993) Google Scholar