Using genetic algorithm to solve multiple traveling salesman problem and considering Carbon emissions

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