Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
From MaRDI portal
Publication:4367231
DOI10.1287/opre.45.3.365zbMath0893.90167OpenAlexW2038970683MaRDI QIDQ4367231
Aristide Mingozzi, Salvatore Ricciardelli, Lucio Bianco
Publication date: 16 August 1998
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.45.3.365
traveling salesmanstate space relaxationHamiltonian tourbounding functionstime window and precedence constraints
Related Items
The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem ⋮ A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows ⋮ Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows ⋮ An enhanced branch-and-bound algorithm for the talent scheduling problem ⋮ A traveling salesman problem with pickups and deliveries, time windows and draft limits: case study from chemical shipping ⋮ Deep policy dynamic programming for vehicle routing problems ⋮ An exact dynamic programming algorithm for the precedence-constrained class sequencing problem ⋮ The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach ⋮ Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery ⋮ The delivery man problem with time windows ⋮ Shipping problems with body clock constraints. ⋮ The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches ⋮ Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem ⋮ Network-Based Approximate Linear Programming for Discrete Optimization ⋮ New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP ⋮ Scheduling tasks on moving executors to minimise the maximum lateness ⋮ Nodal aggregation of resource constraints in a shortest path problem ⋮ New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times ⋮ Exact and heuristic algorithms for routing AGV on path with precedence constraints ⋮ 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 ⋮ Single-vehicle scheduling with time window constraints ⋮ An efficient genetic algorithm for the traveling salesman problem with precedence constraints ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding ⋮ Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version ⋮ A tabu search algorithm for scheduling a single robot in a job-shop environment
