Preliminary communication
https://doi.org/10.7307/ptt.v27i6.1645
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
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.
Keywords
rich vehicle routing problem; heterogeneous fleet; compartmentalized vehicles; soft and hard time windows
Hrčak ID:
151923
URI
Publication date:
17.12.2015.
Visits: 1.168 *