A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
From MaRDI portal
Publication:1266514
DOI10.1016/0377-2217(94)00299-1zbMath0916.90262OpenAlexW1981245140MaRDI QIDQ1266514
Robert B. Dial, Chryssi Malandraki
Publication date: 7 October 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)00299-1
Related Items (37)
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization ⋮ A queueing framework for routing problems with time-dependent travel times ⋮ A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine ⋮ A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times ⋮ A simulation based restricted dynamic programming approach for the green time dependent vehicle routing problem ⋮ Time-dependent routing problems: a review ⋮ Deep policy dynamic programming for vehicle routing problems ⋮ On path ranking in time-dependent graphs ⋮ The time-dependent capacitated profitable tour problem with time windows and precedence constraints ⋮ Matheuristics: survey and synthesis ⋮ Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows ⋮ Vehicle routing with dynamic travel times: a queueing approach ⋮ The Synchronized Dynamic Vehicle Dispatching Problem ⋮ A bi-criteria moving-target travelling salesman problem under uncertainty ⋮ Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows ⋮ Dispersion with connectivity in wireless mesh networks ⋮ Evolutionary algorithms for solving multi-objective travelling salesman problem ⋮ Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem ⋮ A comparison of algorithms for finding an efficient theme park tour ⋮ Optimality conditions to the acyclic travelling salesman problem. ⋮ An iterated local search algorithm for the time-dependent vehicle routing problem with time windows ⋮ A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation ⋮ Restricted dynamic programming: a flexible framework for solving realistic VRPs ⋮ Vehicle routing under time-dependent travel times: the impact of congestion avoidance ⋮ Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints ⋮ A dynamic vehicle routing problem with time-dependent travel times ⋮ A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty ⋮ Dynamic programming based metaheuristics for the dial-a-ride problem ⋮ A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem ⋮ A dynamic programming heuristic for the \(P\)-median problem ⋮ An enhanced lower bound for the time-dependent travelling salesman problem ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding ⋮ Vehicle dispatching with time-dependent travel times
Cites Work
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Time dependency in multiple objective dynamic programming
- Dynamic Programming Treatment of the Travelling Salesman Problem
- A Dynamic Programming Approach to Sequencing Problems
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- Solution of a Large-Scale Traveling-Salesman Problem
- On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
