Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
From MaRDI portal
Publication:6096613
DOI10.1016/j.ejor.2023.06.001OpenAlexW4376635561MaRDI QIDQ6096613
Romain Fontaine, Christine Solnon, Jilles Steeve Dibangoye
Publication date: 15 September 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2023.06.001
Cites Work
- Unnamed Item
- Unnamed Item
- Time-dependent routing problems: a review
- A general VNS heuristic for the traveling salesman problem with time windows
- Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- An integer programming approach for the time-dependent traveling salesman problem with time windows
- An adaptive large neighborhood search metaheuristic for agile satellite scheduling with time-dependent transition time
- Vehicle dispatching with time-dependent travel times
- Perspectives on integer programming for time-dependent models
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- An assign-and-route matheuristic for the time-dependent inventory routing problem
- Improving the filtering of branch-and-bound MDD solver
- Time dependent orienteering problem with time windows and service time dependent profits
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
- Time dependent vehicle routing problem with a multi ant colony system
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows
- An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows
- Discrete Optimization with Decision Diagrams
- 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 Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- Dynamic Programming Treatment of the Travelling Salesman Problem
- State-space relaxation procedures for the computation of bounds to routing problems
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
- The Vehicle Routing Problem with Time Windows Part II: Genetic Search
- A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems
This page was built for publication: Exact and anytime approach for solving the time dependent traveling salesman problem with time windows
