A heuristic manipulation technique for the sequential ordering problem

Authors:
R. Montemanni;D. H. Smith;L. M. Gambardella
Affiliations:
Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928 Manno-Lugano, Switzerland;Division of Mathematics and Statistics, University of Glamorgan, Pontypridd CF37 1DL, UK;Istituto Dalle Molle di Studi sull'Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928 Manno-Lugano, Switzerland
Venue:
Computers and Operations Research
Year:
2008

Citing 6
Cited 2

The precedence-constrained asymmetric traveling salesman polytope

Mathematical Programming: Series A and B
Ant algorithms for discrete optimization

Artificial Life
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem

INFORMS Journal on Computing
A cooperative parallel rollout algorithm for the sequential ordering problem

Parallel Computing - Special issue: Parallel computing in logistics
A hybrid genetic algorithm based on complete graph representation for the sequential ordering problem

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Ant colony system: a cooperative learning approach to the traveling salesman problem

IEEE Transactions on Evolutionary Computation

Heuristic manipulation, tabu search and frequency assignment

Computers and Operations Research
A hybrid particle swarm optimization approach for the sequential ordering problem

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

The sequential ordering problem is a version of the asymmetric travelling salesman problem where precedence constraints on vertices are imposed. A tour is feasible if these constraints are respected, and the objective is to find a feasible solution with minimum cost. The sequential ordering problem models many real-world applications, mainly in the fields of transportation and production planning. A problem manipulation technique to be used in conjunction with heuristic algorithms is discussed. The aim of the technique is to make the search space associated with each problem more attractive for the underlying heuristic algorithms. This novel methodology is tested in combination with the state-of-the-art method for the sequential ordering problem. Improved results are obtained, particularly for the largest problems considered.