Exploiting the Versatility of Constraint Programming over Finite Domains to Integrate Product Line Models

2009 ◽  
Author(s):  
Camille Salinesi ◽  
Daniel Diaz ◽  
Olfa Djebbi ◽  
Raul Mazo ◽  
Colette Rolland
Keyword(s):  
Constraint Programming ◽  
Product Line ◽  
Finite Domains

scholarly journals Improved Filtering for the Euclidean Traveling Salesperson Problem in CLP(FD)

2020 ◽  
Vol 34 (02) ◽  
pp. 1412-1419
Author(s):  
Alessandro Bertagnon ◽  
Marco Gavanelli
Keyword(s):  
Cost Function ◽  
Computer Science ◽  
Constraint Programming ◽  
Euclidean Distance ◽  
Distance Matrix ◽  
Constraint Propagation ◽  
Geometric Information ◽  
Traveling Salesperson Problem ◽  
Finite Domains ◽  
Special Case

The Traveling Salesperson Problem (TSP) is one of the best-known problems in computer science. The Euclidean TSP is a special case in which each node is identified by its coordinates on the plane and the Euclidean distance is used as cost function. Many works in the Constraint Programming (CP) literature addressed the TSP, and use as benchmark Euclidean instances; however the usual approach is to build a distance matrix from the points coordinates, and then address the problem as a TSP, disregarding the information carried by the points coordinates for constraint propagation. In this work, we propose to use geometric information, present in Euclidean TSP instances, to improve the filtering power. In order to have a declarative approach, we implemented the filtering algorithms in Constraint Logic Programming on Finite Domains (CLP(FD)).

A Method of Train Regulation Planning by the Constraint Programming Using Train Regulation Knowledge

2010 ◽  
Vol 130 (2) ◽  
pp. 332-342 ◽  
Author(s):  
Shuichiro Sakikawa ◽  
Tatsuhiro Sato ◽  
Toyohisa Morita ◽  
Kenji Ohta
Keyword(s):  
Constraint Programming
Sign in / Sign up

Export Citation Format

Share Document