Route Optimization for the Distribution Network of a Confectionary Chain
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 decre...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zagreb, Faculty of Transport and Traffic Sciences
2015-12-01
|
Series: | Promet (Zagreb) |
Subjects: | |
Online Access: | http://www.fpz.unizg.hr/traffic/index.php/PROMTT/article/view/1645 |
_version_ | 1818946071535026176 |
---|---|
author | Anıl İnanlı Başak Ünsal Deniz Türsel Eliiyi |
author_facet | Anıl İnanlı Başak Ünsal Deniz Türsel Eliiyi |
author_sort | Anıl İnanlı |
collection | DOAJ |
description | 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. |
first_indexed | 2024-12-20T08:09:11Z |
format | Article |
id | doaj.art-7fd441f69200429bbbb81ade448e24fe |
institution | Directory Open Access Journal |
issn | 0353-5320 1848-4069 |
language | English |
last_indexed | 2024-12-20T08:09:11Z |
publishDate | 2015-12-01 |
publisher | University of Zagreb, Faculty of Transport and Traffic Sciences |
record_format | Article |
series | Promet (Zagreb) |
spelling | doaj.art-7fd441f69200429bbbb81ade448e24fe2022-12-21T19:47:19ZengUniversity of Zagreb, Faculty of Transport and Traffic SciencesPromet (Zagreb)0353-53201848-40692015-12-0127649750310.7307/ptt.v27i6.16451231Route Optimization for the Distribution Network of a Confectionary ChainAnıl İnanlı0Başak Ünsal1Deniz Türsel Eliiyi2Politecnico di MilanoBilkent UniversityYasar UniversityThis 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.http://www.fpz.unizg.hr/traffic/index.php/PROMTT/article/view/1645rich vehicle routing problemheterogeneous fleetcompartmentalized vehiclessoft and hard time windows |
spellingShingle | Anıl İnanlı Başak Ünsal Deniz Türsel Eliiyi Route Optimization for the Distribution Network of a Confectionary Chain Promet (Zagreb) rich vehicle routing problem heterogeneous fleet compartmentalized vehicles soft and hard time windows |
title | Route Optimization for the Distribution Network of a Confectionary Chain |
title_full | Route Optimization for the Distribution Network of a Confectionary Chain |
title_fullStr | Route Optimization for the Distribution Network of a Confectionary Chain |
title_full_unstemmed | Route Optimization for the Distribution Network of a Confectionary Chain |
title_short | Route Optimization for the Distribution Network of a Confectionary Chain |
title_sort | route optimization for the distribution network of a confectionary chain |
topic | rich vehicle routing problem heterogeneous fleet compartmentalized vehicles soft and hard time windows |
url | http://www.fpz.unizg.hr/traffic/index.php/PROMTT/article/view/1645 |
work_keys_str_mv | AT anılinanlı routeoptimizationforthedistributionnetworkofaconfectionarychain AT basakunsal routeoptimizationforthedistributionnetworkofaconfectionarychain AT denizturseleliiyi routeoptimizationforthedistributionnetworkofaconfectionarychain |