Context-Independent Scatter and Tabu Search for Permutation Problems

Authors:
Vicente Campos;Manuel Laguna;Rafael Martí
Affiliations:
Departamento de Estadística e Investigación Operativa, Facultad de Matemáticas, Universitat de Valencia, Dr. Moliner, 50, 46100 Burjassot-Valencia, Spain;Leeds School of Business, University of Colorado, Boulder, Colorado 80309-0419, USA;Departamento de Estadística e Investigación Operativa, Facultad de Matemáticas, Universitat de Valencia, Dr. Moliner, 50, 46100 Burjassot-Valencia, Spain
Venue:
INFORMS Journal on Computing
Year:
2005

Citing 7
Cited 13

Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)

Discrete Applied Mathematics - Special volume: viewpoints on optimization
A new heuristic algorithm solving the linear ordering problem

Computational Optimization and Applications
Intensification and diversification with elite tabu search solutions for the linear ordering problem

Computers and Operations Research
Scatter search for the linear ordering problem

New ideas in optimization
Genetic Algorithms Plus Data Structures Equals Evolution Programs

Genetic Algorithms Plus Data Structures Equals Evolution Programs
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem

Journal of Global Optimization
A Template for Scatter Search and Path Relinking

AE '97 Selected Papers from the Third European Conference on Artificial Evolution

Solving weighted Max-Sat optimization problems using a Taboo Scatter Search metaheuristic

Proceedings of the 2004 ACM symposium on Applied computing
A reactive GRASP and path relinking for a combined production-distribution problem

Computers and Operations Research
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem

Computers and Operations Research
Two memetic algorithms for heterogeneous fleet vehicle routing problems

Engineering Applications of Artificial Intelligence
MA|PM: memetic algorithms with population management

Computers and Operations Research
Black box scatter search for general classes of binary optimization problems

Computers and Operations Research
An effective memetic algorithm with population management for the split delivery vehicle routing problem

HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
A GRASP with evolutionary path relinking for the truck and trailer routing problem

Computers and Operations Research
A hybrid dual-population genetic algorithm for the single machine maximum lateness problem

EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
Revised GRASP with path-relinking for the linear ordering problem

Journal of Combinatorial Optimization
Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries

Computers and Operations Research
A black-box scatter search for optimization problems with integer variables

Journal of Global Optimization
On the performance of Scatter Search for post-enrolment course timetabling problems

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we develop a general-purpose heuristic for permutations problems. The procedure is based on the scatter-search and tabu-search methodologies and treats the objective-function evaluation as a black box, making the search algorithm context-independent. Therefore, our main contribution consists of the development and testing of a procedure that uses no knowledge from the problem context to search for the optimal solution. We perform computational experiments with four well-known permutation problems to study the efficiency and effectiveness of the proposed method. These experiments include a comparison with two commercially available software packages that are also based on meta-heuristic optimization technology and allow solutions to be represented as permutations.