An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem

DOI10.1080/03155986.2001.11732431MaRDI QIDQ5888195zbMATH OpenOpenAlexFDO

Authors Koji Nonobe, Toshihide Ibaraki

Publication date 24 April 2023

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.2001.11732431

zbMATH Keywords

schedulingtabu searchweighted constraint satisfaction problemcombinatorial optimization problemgeneral problem solver

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• A tabu search approach to the constraint satisfaction problem as a general problem solver
• Using Tabu Search in CSPs
• A tabu search approach to machine scheduling
• Tabu search for resource-constrained scheduling
• Weight-based heuristics for constraint satisfaction and combinatorial optimization problems

Cited in

(8)

• A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem
• Effective learning hyper-heuristics for the course timetabling problem
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• Relaxation heuristics for the set multicover problem with generalized upper bound constraints
• Fast machine reassignment
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP
• Using tabu search with longer-term memory and relaxation to create examination timetables.
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem

This page was built for publication: An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5888195)