A tabu search approach to the constraint satisfaction problem as a general problem solver

DOI10.1016/S0377-2217(97)00294-4zbMath0991.90102OpenAlexW2037361138MaRDI QIDQ1609921

Toshihide Ibaraki, Koji Nonobe

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00294-4

zbMATH Keywords

tabu searchcombinatorial problemsmeta-heuristicsconstraint satisfaction problem (CSP)general problem solver

Mathematics Subject Classification ID

Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial optimization (90C27)

Related Items

Integer programming techniques for the nurse rostering problem, A decomposed metaheuristic approach for a real-world university timetabling problem, Preference scheduling for nurses using column generation, Cyclic preference scheduling of nurses using a Lagrangian-based heuristic, A graph-based hyper-heuristic for educational timetabling problems, Nurse rostering problems -- a bibliographic survey., A systematic two phase approach for the nurse rostering problem, Essential particle swarm optimization queen with tabu search for MKP resolution, A personal perspective on problem solving by general purpose solvers, Linear combinations of heuristics for examination timetabling, The case for strategic oscillation, Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List, Multiple machine JIT scheduling: a tabu search approach, Layout optimization considering production uncertainty and routing flexibility, Satisfiability by Maxwell-Boltzmann and Bose-Einstein Statistical Distributions, A path relinking approach with ejection chains for the generalized assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Tabu search for large scale timetabling problems
• Network-based heuristics for constraint-satisfaction problems
• A GRASP for a difficult single machine scheduling problem
• A survey of algorithms for the generalized assignment problem
• Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
• A set partitioning heuristic for the generalized assignment problem
• A tabu search algorithm for computing an operational timetable
• A surrogate heuristic for set covering problems
• A genetic algorithm for the generalised assignment problem
• An algorithm for set covering problem
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Genetic and hybrid algorithms for graph coloring
• Solving hard set covering problems
• A note on some computationally difficult set covering problems
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• A Sufficient Condition for Backtrack-Free Search
• Tabu Search—Part I
• The Reactive Tabu Search
• A Greedy Randomized Adaptive Search Procedure for the Two-Partition Problem