Embedding Relaxations in Global Constraints for Solving TSP and TSPTW
Annals of Mathematics and Artificial Intelligence
Optimization-Oriented Global Constraints
Constraints
A Constraint Programming Framework for Local Search Methods
Journal of Heuristics
Heuristics for Large Constrained Vehicle Routing Problems
Journal of Heuristics
Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics
Journal of Heuristics
Constraint Programming and Operations Research: Comments from an Operations Researcher
Journal of Heuristics
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
Journal of Heuristics
SALSA: A Language for Search Algorithms
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Cutting Planes in Constraint Programming: A Hybrid Approach
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A Concurrent Constraint Programming Approach for Trajectory Determination of Autonomous Vehicles
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Combining local and global search in a constraint programming environment
The Knowledge Engineering Review
A constraint programming approach to the Chinese postman problem with time windows
Computers and Operations Research
Discrepancy-Based Additive Bounding Procedures
INFORMS Journal on Computing
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
INFORMS Journal on Computing
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Transportation Science
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Recent Advances in Constraints
Throughput Constraint for Synchronous Data Flow Graphs
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Beam-ACO for the travelling salesman problem with time windows
Computers and Operations Research
Optimization of the nested Monte-Carlo algorithm on the traveling salesman problem with time windows
EvoApplications'11 Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part II
Checking the Feasibility of Dial-a-Ride Instances Using Constraint Programming
Transportation Science
A General VNS heuristic for the traveling salesman problem with time windows
Discrete Optimization
The Delivery Man Problem with time windows
Discrete Optimization
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
INFORMS Journal on Computing
LION'12 Proceedings of the 6th international conference on Learning and Intelligent Optimization
Maximum-throughput mapping of SDFGs on multi-core SoC platforms
Journal of Parallel and Distributed Computing
Hi-index | 0.00 |
This paper presents a constraint logic programming model for the traveling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictive assumption on the time windows. Unlike dynamic programmi ng approaches whose performance relies heavily on the degree of discretization applied to the data, our algorithm does not suffer from such space-complexity issues. The data-driven mechanism at its core more fully exploits pruning rules developed in opera tions research by using them not only a priori but also dynamically during the search. Computational results are reported and comparisons are made with both exact and heuristic algorithms. On Solomon's well-known test bed, our algorithm is instrumental in achieving new best solutions for some of the problems in set RC2 and strengthens the presumption of optimality for the best known solutions to the problems in set C2.m