Route optimization cold chain logistic distribution using greedy search method
- PDF / 744,487 Bytes
- 16 Pages / 439.37 x 666.142 pts Page_size
- 53 Downloads / 261 Views
Route optimization cold chain logistic distribution using greedy search method Xiong Qiang1 · Martinson Yeboah Appiah1 · Kwasi Boateng2 · Frederick VonWolff Appiah3 Accepted: 7 May 2020 © Operational Research Society of India 2020
Abstract Currently the best way to achieve an efficient chain of distribution for third party refrigerated logistics companies is the use of optimization technique in computerbased software. This work introduces the greedy search method to solve a capacitated vehicle route problem integrated by means of travelling salesman problem concept and to minimize transport cost at the same time. The model is used to locally optimize route, and we also used a single truck to cover all customers located within a certain distance limit. To obtain possible set of routes for each vehicle, permutations and combinations are used. Route distances and vehicle distances are formed using the greedy search method with increasing number of customers. By means of critical path method, we presented computational results on a set of routes and we identified optimal routes which are more efficient for despatching of cold food. Finally, we imputed these optimal distances into a transportation cost function to find the optimal cost. This model will provide a theoretical basis in planning vehicle path for cold chain logistics and despatching activity for distribution centres and also to minimize cost. Keywords Greedy search method · Cold-logistics · Optimization · Travelling salesman problem
* Martinson Yeboah Appiah [email protected]; [email protected] 1
School of Management, Jiangsu University, Jiangsu, China
2
Department of Financial Mathematics, Jiangsu University, Jiangsu, China
3
Kwame Nkrumah University of Science and Technology, Accra, Ghana
13
Vol.:(0123456789)
OPSEARCH
1 Introduction While globalization has made the distance among countries minute, their geographical locations are very apart thus causing higher freight damage in complex transport operations. To avoid damages or compromises throughout this process, the food, pharmaceutical, medical industries highly rely on cold chain [1]. Cold chain logistics is the management of goods moved from one point to the other in a controlled temperature without interrupting the refrigerated production, distribution, and storage activities [2]. Although the cold chain logistics industry is developing, third party logistics companies in Ghana still encounter challenges along the distribution chain. Distribution chain problem also called vehicle routing problem (VRP) is a challenge in logistics management. According to Joshi and Jadav [3] the greedy algorithm has several advantages over other algorithms, because it is simple and easy to code-up. It also has higher efficiency because it is easy to implement as compared to others. VRP is one of the variants of distribution network problems and therefore this study shows how greedy search method can be used to solve VRP. Categorically the problem deals with reaching the customers from the
Data Loading...
