Business Commons^™

Solving Hierarchical Constraints Over Finite Domains With Local Search, Martin Henz, Roland H.C. Yap, Yun Fong Lim, Seet Chong Lua, J. Paul Walser, Xiao Ping Shi

Research Collection Lee Kong Chian School Of Business

Many real world problems have requirements and constraints which conflict with each other. One approach for dealing with such over-constrained problems is with constraint hierarchies. In the constraint hierarchy framework, constraints are classified into ranks, and appropriate solutions are selected using a comparator which takes into account the constraints and their ranks. In this paper, we present a local search solution to solving hierarchical constraint problems over finite domains (HCPs). This is an extension of local search for over-constrained integer programs WSAT(OIP) to constraint hierarchies and general finite domain constraints.The motivation for this work arose from solving large airport gate …