Models and algorithms for the traveling salesman problem with time-dependent service times

DOI10.1016/J.EJOR.2019.11.046zbMath1441.90132OpenAlexW2991581571WikidataQ126625309 ScholiaQ126625309MaRDI QIDQ2294625

Valentina Cacchiani, Carlos Contreras-Bolton, Paolo Toth

Publication date: 11 February 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.11.046

zbMATH Keywords

branch-and-cut algorithmgenetic algorithmmathematical modeltravelling salesmantime-dependent service times

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (5)

The traveling salesman problem with job-times (\textit{TSPJ}) ⋮ A metaheuristic for the double traveling salesman problem with partial last‐in‐first‐out loading constraints ⋮ The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ A linearithmic heuristic for the travelling salesman problem

Uses Software

• TSPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• The traveling salesman problem with time-dependent service times
• The ``molecular traveling salesman
• An efficient algorithm for the minimum capacity cut problem
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• A comparative analysis of several asymmetric traveling salesman problem formulations
• A mixed-integer model for solving ordering problems with side constraints
• A classification of formulations for the (time-dependent) traveling salesman problem
• An integer programming approach for the time-dependent traveling salesman problem with time windows
• The time-dependent capacitated profitable tour problem with time windows and precedence constraints
• Hybrid optimization methods for time-dependent sequencing problems
• A new memetic algorithm for the asymmetric traveling salesman problem
• Vehicle dispatching with time-dependent travel times
• The time dependent traveling salesman problem: polyhedra and algorithm
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
• Facets and valid inequalities for the time-dependent travelling salesman problem
• Integer Programming Formulation of Traveling Salesman Problems
• TSPLIB—A Traveling Salesman Problem Library
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The Continuous-Time Service Network Design Problem
• Solution of a Large-Scale Traveling-Salesman Problem

This page was built for publication: Models and algorithms for the traveling salesman problem with time-dependent service times