A Hybrid Exact Algorithm for the TSPTW
From MaRDI portal
Publication:2884545
DOI10.1287/ijoc.14.4.403.2827zbMath1238.90054OpenAlexW2120365438MaRDI QIDQ2884545
Andrea Lodi, Filippo Focacci, Michela Milano
Publication date: 30 May 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2c984bb0d4206f3954c6e28e478ebb24f5d07f90
Programming involving graphs or networks (90C35) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Production models (90B30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Constraint programming and operations research, A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem, A learning based algorithm for drone routing, Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO, A column generation-based heuristic for a rehabilitation patient scheduling and routing problem, A general variable neighborhood search for the traveling salesman problem with time windows under various objectives, Coordinating Particle Swarm Optimization, Ant Colony Optimization and K-Opt Algorithm for Traveling Salesman Problem, A general VNS heuristic for the traveling salesman problem with time windows, The delivery man problem with time windows, CP-Based Local Branching, Unnamed Item, Improved filtering for weighted circuit constraints, A branch and bound method for the job-shop problem with sequence-dependent setup times, New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP, A variable iterated greedy algorithm for the traveling salesman problem with time windows, Bounding, filtering and diversification in CP-based local branching, 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, 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, Exact and heuristic algorithms for routing AGV on path with precedence constraints, Semidefinite Programming and Constraint Programming, Decision diagrams for solving traveling salesman problems with pickup and delivery in real time, A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows, A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem, New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows, A matheuristic for the generalized order acceptance and scheduling problem, A stochastic dynamic traveling salesman problem with hard time windows, Unconstrained binary models of the travelling salesman problem variants for quantum optimization, Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
Uses Software
