Progress on the Progressive Party Problem

Authors:
Helmut Simonis
Affiliations:
Cork Constraint Computation Centre, University College Cork,
Venue:
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Year:
2009

Citing 3
Cited 0

Organizing a social event—a difficult problem of combinatorial optimization

Computers and Operations Research
Constraint-Based Local Search

Constraint-Based Local Search
Generalizing alldifferent: the somedifferent constraint

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We report new results for solving the progressive party problem with finite domain constraints, which are competitive with the best local search results in the literature.When introduced in [1], the progressive party problem was a show case for finite domain constraint programming, since a solution of the original problem for 6 time periods could be found in 26 minutes with Ilog Solver, while an integer programming model was not successful. Improved results using finite domains were reported in [2]. Since then, alternative solutions using MILP have been proposed, while local search methods have been significantly faster, as well as more stable for given problem variations. The best results (to my knowledge) are from [3].