An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
From MaRDI portal
Publication:2482754
DOI10.1016/j.ejor.2006.09.099zbMath1146.90363OpenAlexW2077539478MaRDI QIDQ2482754
José Albiach, David Soler, José María Sanchis
Publication date: 24 April 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10251/140207
Related Items
A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine, Dealing with time in the multiple traveling salespersons problem with moving targets, An integer programming approach for the time-dependent traveling salesman problem with time windows, Time-dependent routing problems: a review, The traveling salesman problem with job-times (\textit{TSPJ}), On path ranking in time-dependent graphs, Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm, Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery, Hybrid optimization methods for time-dependent sequencing problems, Perspectives on integer programming for time-dependent models, A way to optimally solve a time-dependent vehicle routing problem with time windows, A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows, A time-dependent hierarchical Chinese postman problem, An enhanced lower bound for the time-dependent travelling salesman problem, Iterated maximum large neighborhood search for the traveling salesman problem with time windows and its time-dependent version
Uses Software
Cites Work
- An additive bounding procedure for the asymmetric travelling salesman problem
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Modeling and solving several classes of arc routing problems as traveling salesman problems
- The mixed general routing polyhedron
- A dynamic vehicle routing problem with time-dependent travel times
- Vehicle dispatching with time-dependent travel times
- Vehicle routing and scheduling with dynamic travel times
- 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
- A New Heuristic for the Traveling Salesman Problem with Time Windows
- The Shortest Path Problem with Time Windows and Linear Waiting Costs
- A Hybrid Exact Algorithm for the TSPTW
- Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
- An Efficient Transformation Of The Generalized Traveling Salesman Problem
- Exact solution of large-scale, asymmetric traveling salesman problems
- Algorithm 750: CDT
- A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
- A polyhedral study of the asymmetric traveling salesman problem with time windows
- Exact solution of the generalized routing problem through graph transformations
- The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- The Directed Rural Postman Problem with Turn Penalties
- New Results on the Mixed General Routing Problem
- Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
- The Rural Postman Problem on mixed graphs with turn penalties
