We describe in this paper our attempts to build problem solving engines that together cover a large portion of combinatorial optimization problems encountered in real world applications. Our approach is to select a li...
详细信息
ISBN:
(纸本)0769521509
We describe in this paper our attempts to build problem solving engines that together cover a large portion of combinatorial optimization problems encountered in real world applications. Our approach is to select a list of standard problems, and develop their solvers as engines. All the engines we developed are based on the idea of local search and metaheuristics. As standard problems, we have chosen so far CSP (constraint satisfaction problem), RCPSP (recource constrainedprojectschedulingproblem), GAP (generalized assignment problem), VRP (vehicle routing problem), SCP (set covering problem), MAX-SAT (maximum satisfiability problem), 2PP (2-dimensional packing problem) and others. In this paper we outline definitions of these problems, algorithmic contents of engines, and some computational results, putting emphasis on RCPSP and VRR.
暂无评论