An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
From MaRDI portal
Publication:2783791
DOI10.1287/trsc.32.1.12zbMath0987.90086OpenAlexW2135644739MaRDI QIDQ2783791
Jean-Yves Potvin, Jean-Marc Rousseau, Gilles Pesant, Michel Gendreau
Publication date: 17 April 2002
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e14ad53dd65244bccff68fbce31e5e9301c12981
Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Combinatorial optimization (90C27) Logic programming (68N17)
Related Items
Combining Two Structured Domains for Modeling Various Graph Matching Problems, Pricing routines for vehicle routing with time windows on road networks, A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows, Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints, History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence, A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints, Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO, A weighted counting algorithm for the circuit constraint, Exact and anytime approach for solving the time dependent traveling salesman problem with time windows, A general variable neighborhood search for the traveling salesman problem with time windows under various objectives, The Synchronized Dynamic Vehicle Dispatching Problem, Integrating driver behavior into last-mile delivery routing: combining machine learning and optimization in a hybrid decision support framework, A bibliometric and social network analysis of data-driven heuristic methods for logistics problems, Efficient filtering for the resource-cost alldifferent constraint, A general VNS heuristic for the traveling salesman problem with time windows, The delivery man problem with time windows, Integrated production and material handling scheduling using mathematical programming and constraint programming, Unnamed Item, Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams, Improved filtering for weighted circuit constraints, A variable iterated greedy algorithm for the traveling salesman problem with time windows, A Column Generation Model for a Scheduling Problem with Maintenance Constraints, Perspectives on integer programming for time-dependent models, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation, The item dependent stockingcost constraint, The weighted arborescence constraint, Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks, New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times, Beam-ACO for the travelling salesman problem with time windows, A constraint programming approach to the Chinese postman problem with time windows, Optimizing Time Slot Allocation in Single Operator Home Delivery Problems, A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows, New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows, A matheuristic for the generalized order acceptance and scheduling problem, On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem, An ant colony system approach for variants of the traveling salesman problem with time windows, Unconstrained binary models of the travelling salesman problem variants for quantum optimization, Branch-and-refine for solving time-expanded MILP formulations, Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version, Improving the filtering of branch-and-bound MDD solver
