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.90262MaRDI QIDQ1266514
Chryssi Malandraki, Robert B. Dial
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
90C35: Programming involving graphs or networks
Related Items
A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine, An iterated local search algorithm for the time-dependent vehicle routing problem with time windows, A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem, A dynamic programming heuristic for the \(P\)-median problem, A dynamic vehicle routing problem with time-dependent travel times, Vehicle dispatching with time-dependent travel times, A queueing framework for routing problems with time-dependent travel times, Vehicle routing with dynamic travel times: a queueing approach, Optimality conditions to the acyclic travelling salesman problem., A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times, An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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