A Hybrid Genetic Algorithm for the min-max Multiple Traveling Salesman Problem

by   Sasan Mahmoudinazlou, et al.

This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a TSP sequence as the representation of each individual, and a dynamic programming algorithm is employed to evaluate the individual and find the optimal mTSP solution for the given sequence of cities. A novel crossover operator is designed to combine similar tours from two parents and offers great diversity for the population. For some of the generated offspring, we detect and remove intersections between tours to obtain a solution with no intersections. This is particularly useful for the min-max mTSP. The generated offspring are also improved by a self-adaptive random local search and a thorough neighborhood search. Our algorithm outperforms all existing algorithms on average, with similar cutoff time thresholds, when tested against multiple benchmark sets found in the literature. Additionally, we improve the best-known solutions for 21 out of 89 instances on four benchmark sets.


page 1

page 2

page 3

page 4


A Hybrid Genetic Algorithm with Type-Aware Chromosomes for Traveling Salesman Problems with Drone

There are emerging transportation problems known as the Traveling Salesm...

A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Drone

This paper addresses the Traveling Salesman Problem with Drone (TSP-D), ...

GEO satellites on-orbit repairing mission planning with mission deadline constraint using a large neighborhood search-genetic algorithm

This paper proposed a novel large neighborhood search-adaptive genetic a...

Genetic Algorithm with Optimal Recombination for the Asymmetric Travelling Salesman Problem

We propose a new genetic algorithm with optimal recombination for the as...

Self-Adaptation Mechanism to Control the Diversity of the Population in Genetic Algorithm

One of the problems in applying Genetic Algorithm is that there is some ...

A Hybrid ACO Algorithm for the Next Release Problem

In this paper, we propose a Hybrid Ant Colony Optimization algorithm (HA...

Order Acceptance and Scheduling with Sequence-dependent Setup Times: a New Memetic Algorithm and Benchmark of the State of the Art

The Order Acceptance and Scheduling (OAS) problem describes a class of r...

Please sign up or login with your details

Forgot password? Click here to reset