Indian Journal of Science and Technology
Year: 2020, Volume: 13, Issue: 36, Pages: 3707-3715
Chris Jojo Obi1*, Xiong Qiang1, Appiah Martinson Yeboah1
1School of Management, Jiangsu University, 301, Xuefu Road, Zhenjiang, 212013, China
Email: [email protected]
Received Date:18 August 2020, Accepted Date:16 September 2020, Published Date:06 October 2020
Objectives: The Multiple Travelling Salesman problem is a complex combinatorial optimization problem which is a variance of the Traveling Salesman Problem,where a lot of salesmen are utilized in the solution. In this work a cold chain logistics and route optimization model with minimum transport cost, carbon cost and Refrigeration cost are constructed. Methods: A genetic algorithm is then proposed to solve for the Multiple Travelling Salesman Problem with time windows while transport cost, carbon emission cost and refrigeration cost is minimized. Findings: It was observed that the algorithm evolved towards the direction of the optimal value of the fitness function. Novelty: There are a number of studies that considered tournament selection strategy but just a few have applied genetic algorithm considering insertion method to solve a Multiple Travelling salesman Problem. This study uses insertion method to obtain optimal solution. Also, the researcher considered time windows, transport cost, carbon emission cost and refrigeration cost.
Keywords: Genetic algorithm method; cold-logistics; multiple travelling salesman problem
© 2020 Obi et al.This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Published By Indian Society for Education and Environment (iSee).
Subscribe now for latest articles and news.