Route Optimization for the Distribution Network of a Confectionary Chain

  • Anıl İnanlı Politecnico di Milano
  • Başak Ünsal Bilkent University
  • Deniz Türsel Eliiyi Yasar University
DOI: https://doi.org/10.7307/ptt.v27i6.1645
Keywords: rich vehicle routing problem, heterogeneous fleet, compartmentalized vehicles, soft and hard time windows,

Abstract

This study considers the distribution network of a well-known perishable food manufacturer and its franchises in Turkey. As the countrywide number of stores is increasing fast, the company is facing problems due to its central distribution of products from a single factory. The objective is to decrease the cost of transportation while maintaining a high level of customer satisfaction. Hence, the focus is on the vehicle routing problem (VRP) of this large franchise chain within each city. The problem is defined as a rich VRP with heterogeneous fleet, site-dependent and compartmentalized vehicles, and soft/hard time windows. This NP-hard problem is modelled and tried with real data on a commercial solver. A basic heuristic procedure which can be used easily by the decision makers is also employed for obtaining quick and high-quality solutions for large instances.

Author Biographiesaaa replica rolex repwatches replica rolex watches for men replica iwc watch

Anıl İnanlı, Politecnico di Milano

B.Eng. in Industrial Systems Engineering

Politecnico di Milano, School of Industrial and Information Engineering

Piazza Leonardo da Vinci 32, 20133, Milano, Italy

Phone: +39 393 379 98 56
Başak Ünsal, Bilkent University

B.Eng. in Industrial Systems Engineering

Bilkent University, Computer Engineering Department

06800, Bilkent, Ankara, Turkey

Phone: +90 554 357 96 07

Deniz Türsel Eliiyi, Yasar University

Dr. of Industrial Engineering

Yasar University, Department of Industrial Engineering

Selcuk Yasar Kampusu, 35100, Bornova, Izmir, Turkey

Phone: +90 232 4115697, Fax:+90 232 3745474

References

Tarantilis C, Kiranoudis C. A meta-heuristic algorithm for the efficient distribution of perishable foods. J Food Eng. 2001;50(1):1-9.

Gendreau M, Laporte G, Musaraganyi C, Taillard ÉD. A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput Oper Res. 1999;26(12):1153-1173.

Ambrosino D, Sciomachen A. A food distribution network problem: a case study. IMA J Manage Math. 2007;18(1):33-53.

Doerner KF, Gronalt M, Hartl RF, Kiechle G, Reimann M. Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows. Comput Oper Res. 2008;35(9):3034-3048.

Ombuki B, Ross BJ, Hanshar F. Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell. 2006;24(1):17-30.

Taner F, Galić A, Carić T. Solving practical vehicle routing problem with time windows using metaheuristic algorithms. Promet-Traffic & Transportation. 2012;24(4):343-351.

Galić A, Carić T, Fosin J. The case study of implementing the delivery optimization system at a fast-moving consumer goods distributer. Promet-Traffic & Transportation. 2013;25(6):595-603.

Özdemirel A, Gökgür B, Eliiyi DT. An assignment and routing problem with time windows and capacity restriction. Procedia Soc Behav Sci. 2012;54(1):149-158.

Dohn A, Rasmussen MS, Larsen J. The vehicle routing problem with time windows and temporal dependencies. Networks. 2011;58(4):273-289.

Pisinger D, Ropke S. A general heuristic for vehicle routing problems. Comput Oper Res. 2007;34(8):2403-2435.

Tarantilis C, Kiranoudis C. Distribution of fresh meat. J Food Eng. 2002;51(1):85–91.

Amorim P, Parragh SN, Sperandio F, Almada-Lobo B. A rich vehicle routing problem dealing with perishable food. TOP. 2014;22(2):489-508.

Osvald A, Stirn LZ. A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. J Food Eng. 2008;85(2):285-295.

Hsu CI, Hung SF, Li HC. Vehicle routing problem with time-windows for perishable food delivery. J Food Eng. 2007;80(2):465-475.

Clarke G, Wright JW. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Oper Res. 1964;12(4):568-581.

Published
2015-12-17
How to Cite
1.
İnanlı A, Ünsal B, Eliiyi DT. Route Optimization for the Distribution Network of a Confectionary Chain. Promet [Internet]. 2015Dec.17 [cited 2024Dec.22];27(6):497-03. Available from: https://traffic.fpz.hr/index.php/PROMTT/article/view/1645
Issue
Vol 27 No 6 (2015)
Section
Articles

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).