6533b7dcfe1ef96bd12728b5
RESEARCH PRODUCT
Context-Independent Scatter and Tabu Search for Permutation Problems
Manuel LagunaRafael MartíVicente Campossubject
Mathematical optimizationTheoretical computer scienceComputer sciencebusiness.industrySearch-based software engineeringGeneral EngineeringBest-first searchTabu searchBeam searchLocal search (optimization)Guided Local SearchbusinessHill climbingMetaheuristicdescription
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.
| year | journal | country | edition | language |
|---|---|---|---|---|
| 2005-02-01 | INFORMS Journal on Computing |