ROUTE OPTIMIZATION FOR THE DISTRIBUTION NETWORK OF A CONFECTIONARY CHAIN

被引：4

作者：

Inanli, Anil ^{[1
]}

Unsal, Basak ^{[2
]}

Eliiyi, Deniz Tursel ^{[3
]}

机构：

[1] Politecn Milan, Sch Ind & Informat Engn, I-20133 Milan, Italy

[2] Bilkent Univ, Dept Comp Engn, TR-06800 Ankara, Turkey

[3] Yasar Univ, Dept Ind Engn, TR-35100 Izmir, Turkey

来源：

PROMET-TRAFFIC & TRANSPORTATION | 2015年 / 27卷 / 06期

关键词：

rich vehicle routing problem; heterogeneous fleet; compartmentalized vehicles; soft and hard time windows; TIME-WINDOWS; PERISHABLE FOOD; ALGORITHMS; DELIVERY;

D O I：

10.7307/ptt.v27i6.1645

中图分类号：

U [交通运输];

学科分类号：

08 ; 0823 ;

摘要：

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.

引用

页码：497 / 503

页数：7

共 15 条

[1]

Ambrosino D., 2007, IMA Journal of Management Mathematics, V18, P33, DOI 10.1093/imaman/dp1012

[2] A rich vehicle routing problem dealing with perishable food: a case study [J].

Amorim, Pedro ;

Parragh, Sophie N. ;

Sperandio, Fabricio ;

Almada-Lobo, Bernardo .

TOP, 2014, 22 (02) :489-508

[3] SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].

CLARKE, G ;

WRIGHT, JW .

OPERATIONS RESEARCH, 1964, 12 (04) :568-&

[4] Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows [J].

Doerner, Karl F. ;

Gronalt, Manfred ;

Hartl, Richard F. ;

Kiechlec, Guenter ;

Reimann, Marc .

COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (09) :3034-3048

[5] The Vehicle Routing Problem with Time Windows and Temporal Dependencies [J].

Dohn, Anders ;

Rasmussen, Matias Sevel ;

Larsen, Jesper .

NETWORKS, 2011, 58 (04) :273-289

[6] THE CASE STUDY OF IMPLEMENTING THE DELIVERY OPTIMIZATION SYSTEM AT A FAST-MOVING CONSUMER GOODS DISTRIBUTER [J].

Galic, Ante ;

Caric, Tonci ;

Fosin, Juraj .

PROMET-TRAFFIC & TRANSPORTATION, 2013, 25 (06) :595-603

[7] A tabu search heuristic for the heterogeneous fleet vehicle routing problem [J].

Gendreau, M ;

Laporte, G ;

Musaraganyi, C ;

Taillard, ÉD .

COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (12) :1153-1173

[8] Vehicle routing problem with time-windows for perishable food delivery [J].

Hsu, Chaug-Ing ;

Hung, Sheng-Feng ;

Li, Hui-Chieh .

JOURNAL OF FOOD ENGINEERING, 2007, 80 (02) :465-475

[9] Multi-objective genetic algorithms for vehicle routing problem with time windows [J].

Ombuki, B ;

Ross, BJ ;

Hanshar, F .

APPLIED INTELLIGENCE, 2006, 24 (01) :17-30

[10] A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food [J].

Osvald, Ana ;

Stirn, Lidija Zadnik .

JOURNAL OF FOOD ENGINEERING, 2008, 85 (02) :285-295

← 1 2 →