Improved filtering for weighted circuit constraints |
| |
Authors: | Pascal Benchimol Willem-Jan van Hoeve Jean-Charles Régin Louis-Martin Rousseau Michel Rueher |
| |
Affiliation: | 1. INRIA Saclay and CMAP, ??cole Polytechnique, Palaiseau, France 2. Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA, USA 3. I3S-CNRS, University of Nice-Sophia Antipolis, Nice, France 4. CIRRELT, ??cole Polytechnique de Montr??al, Montr??al, Canada
|
| |
Abstract: | We study the weighted circuit constraint in the context of constraint programming. It appears as a substructure in many practical applications, particularly routing problems. We propose a domain filtering algorithm for the weighted circuit constraint that is based on the 1-tree relaxation of Held and Karp. In addition, we study domain filtering based on an additive bounding procedure that combines the 1-tree relaxation with the assignment problem relaxation. Experimental results on Traveling Salesman Problem instances demonstrate that our filtering algorithms can dramatically reduce the problem size. In particular, the search tree size and solving time can be reduced by several orders of magnitude, compared to existing constraint programming approaches. Moreover, for medium-size problem instances, our method is competitive with the state-of-the-art special-purpose TSP solver Concorde. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|