An improved heuristic for the period traveling salesman problem

Authors:
Luca Bertazzi;Giuseppe Paletta;M. Grazia Speranza
Affiliations:
Dipartimento di Metodi Quantitativi, Università di Brescia, Contrada S.ta Chiara 50, Brescia 25122, Italy;Dipartimento di Economia Politica, Università della Calabria, Arcavacata di Rende (Cs) 87036, Italy;Dipartimento di Metodi Quantitativi, Università di Brescia, Contrada S.ta Chiara 50, Brescia 25122, Italy
Venue:
Computers and Operations Research
Year:
2004

Citing 6
Cited 5

New insertion and postoptimization procedures for the traveling salesman problem

Operations Research
A multiperiod traveling salesman problem: heuristic algorithms

Computers and Operations Research
New optimization heuristics

Journal of Computational Physics
A new heuristic for the period traveling salesman problem

Computers and Operations Research
The period traveling salesman problem: a new heuristic algorithm

Computers and Operations Research
Algorithms and solutions to multi-level vehicle routing problems

Algorithms and solutions to multi-level vehicle routing problems

Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows

Computers and Operations Research
Multilevel variable neighborhood search for periodic routing problems

EvoCOP'10 Proceedings of the 10th European conference on Evolutionary Computation in Combinatorial Optimization
Artificial bee colony algorithm with scanning strategy for the periodic vehicle routing problem

Simulation
Nested simulated annealing approach to periodic routing problem of a retail distribution system

Computers and Operations Research
A set-covering based heuristic algorithm for the periodic vehicle routing problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

We propose a heuristic algorithm for the solution of the period traveling salesman problem Computational results obtained on the classical test instances of the literature show that the total distance obtained by the algorithm is not worse than the best-known total distance in 95% of the instances and is strictly better in 18 of the 40 tested instances.