Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem

Authors:
Carlos E. Andrade;Flávio K. Miyazawa;Mauricio G.C. Resende
Affiliations:
University of Campinas, Campinas, Brazil;University of Campinas, Campinas, Brazil;AT&T Labs Research, Florham Park, NJ, USA
Venue:
Proceedings of the 15th annual conference on Genetic and evolutionary computation
Year:
2013

Citing 15
Cited 0

Application of a hybrid genetic algorithm to airline crew scheduling

Computers and Operations Research - Special issue: artificial intelligence, evolutionary programming and operations research
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator

ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)

The Traveling Salesman Problem: A Computational Study (Princeton Series in Applied Mathematics)
A random key based genetic algorithm for the resource constrained project scheduling problem

Computers and Operations Research
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic

Transportation Science
A transformation for a heterogeneous, multiple depot, multiple traveling salesman problem

ACC'09 Proceedings of the 2009 conference on American Control Conference
A Branch-and-Cut method for the Capacitated Location-Routing Problem

Computers and Operations Research
The Two-Echelon Capacitated Vehicle Routing Problem: Models and Math-Based Heuristics

Transportation Science
A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem

Journal of Combinatorial Optimization
Biased random-key genetic algorithms for combinatorial optimization

Journal of Heuristics
A Guide to Experimental Algorithmics

A Guide to Experimental Algorithmics
Least squares quantization in PCM

IEEE Transactions on Information Theory
An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem

Operations Research Letters
Large-step markov chains for the TSP incorporating local search heuristics

Operations Research Letters
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the $k$-Interconnected Multi-Depot Multi-Traveling Salesmen Problem, a new problem that resembles some network design and location routing problems but carries the inherent difficulty of not having a fixed set of depots or terminals. We propose a heuristic based on a biased random-key genetic algorithm to solve it. This heuristic uses local search procedures to best choose the terminal vertices and improve the tours of a given solution. We compare our heuristic with a multi-start procedure using the same local improvements and we show that the proposed algorithm is competitive.