Let's Connect
Follow Us
Watch Us
(+385) 1 2380 262
journal.prometfpz.unizg.hr
Promet - Traffic&Transportation journal

Accelerating Discoveries in Traffic Science

Accelerating Discoveries in Traffic Science

Login Submit

PDF
PUBLISHED
17.12.2015
DOI
https://doi.org/10.7307/ptt.v27i6.1645
ISSUE
2015 (Vol 27), Issue 6
LICENSE
Copyright (c) 2024 Anıl İnanlı, Başak Ünsal, Deniz Türsel Eliiyi
Creative Commons 4.0 logo
This work is licensed under a
Creative Commons Attribution-NonCommercial-
NoDerivatives 4.0 International License.

Route Optimization for the Distribution Network of a Confectionary Chain

Authors:

Anıl İnanlı
Politecnico di Milano

Başak Ünsal
Bilkent University

Deniz Türsel Eliiyi
Yasar University

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.

References

  1. 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 im

Show more
How to Cite
İnanlı, A. (et al.) 2015. Route Optimization for the Distribution Network of a Confectionary Chain. Traffic&Transportation Journal. 27, 6 (Dec. 2015), 497-503. DOI: https://doi.org/10.7307/ptt.v27i6.1645.

SPECIAL ISSUE IS OUT

Innovation and New Technologies in Transport and Logistics

Guest Editor: Eleonora Papadimitriou, PhD

Editors: Marko Matulin, PhD, Dario Babić, PhD, Marko Ševrović, PhD

RECENT PAPERS

Browse through the selection of our recent research
Optimisation Methods for Cold Chain Logistics Path Considering Carbon Emission Costs in Time-Varying NetworksFusing Visual Quantified Features for Heterogeneous Traffic Flow PredictionVessel Trajectory Prediction Method Based on the Time Series Data Fusion ModelUnderstanding the Impact of Integration Strategy of Ride-Hailing Platforms on Traveller’s Choice Behaviour

Accelerating Discoveries in Traffic Science |
2024 © Promet - Traffic&Transportation journal