A parallel tabu search and its hybridization with genetic algorithms
Authors:
- T. MatsumuraTMT. Matsumura
- M. NakamuraMNM. Nakamura
- S. TamakiSTS. Tamaki
- K. OnagaKOK. Onaga
- 11 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- The zero/one multiple knapsack problem and genetic algorithms1994
- Solving real-life vehicle routing problems efficiently using tabu searchAnnals of Operations Research, 1993
- Solving the maximum clique problem using a tabu search approachAnnals of Operations Research, 1993
- Large-scale controlled rounding using tabu search with strategic oscillationAnnals of Operations Research, 1993
- Tabu search and design optimizationComputer-Aided Design, 1991
- Job Shop Scheduling with Tooling Constraints: a Tabu Search ApproachJournal of the Operational Research Society, 1991
- Optimization by Simulated AnnealingScience, 1983
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack ProblemJournal of the Operational Research Society, 1979
- An Effective Heuristic Algorithm for the Traveling-Salesman ProblemOperations Research, 1973
- Methods for the Solution of the Multidimensional 0/1 Knapsack ProblemOperations Research, 1967