An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem

• Published in: INFOR. Information systems and operational research Vol. 39; no. 1; pp. 131 - 151
• Main Authors: Nonobe, Koji, Ibaraki, Toshihide
• Format: Journal Article
• Language: English
• Published: Ottawa Taylor & Francis 01.02.2001; Canadian Operational Research Society
• Subjects: Algorithms; Assignment problem; Codes; combinatorial optimization problem; Experiments; general problem solver; Heuristic; Integer programming; Manufacturing cells; Mathematical models; Mathematical optimization; Operations research; Optimization; Scheduling; Studies; tabu search; weighted constraint satisfaction problem

Aiming at developing a general problem solver for combinatorial optimization problems, we consider in this paper the weighted constraint satisfaction problem (WCSP), which, given a number of constraints and their weights of importance, asks to minimize the total weight of unsatisfied constraints. We...