Route optimization for the distribution network of a confectionary chain
Date
Authors
Editor(s)
Advisor
Supervisor
Co-Advisor
Co-Supervisor
Instructor
Source Title
Print ISSN
Electronic ISSN
Publisher
Volume
Issue
Pages
Language
Type
Journal Title
Journal ISSN
Volume Title
Series
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. ©, 2001, Faculty of Transport and Traffic Engineering, All rights reserved.