An integer programming approach for the time-dependent traveling salesman problem with time windows

DOI10.1016/j.cor.2017.06.026zbMath1391.90613OpenAlexW2733776472MaRDI QIDQ1651554

Agustín Montero, Isabel Méndez-Díaz, Juan José Miranda-Bront

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.06.026

zbMATH Keywords

integer linear programmingtime windowsbranch-and-cuttime-dependent TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items (12)

Scheduling activities with time-dependent durations and resource consumptions ⋮ Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows ⋮ On path ranking in time-dependent graphs ⋮ Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ A comparison of algorithms for finding an efficient theme park tour ⋮ Perspectives on integer programming for time-dependent models ⋮ A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times ⋮ 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 ⋮ An assign-and-route matheuristic for the time-dependent inventory routing problem

Uses Software

• VRP

Cites Work

• Time-dependent routing problems: a review
• Natural and extended formulations for the time-dependent traveling salesman problem
• Improved rolling horizon approaches to the aircraft sequencing problem
• A new formulation for the traveling deliveryman problem
• A classification of formulations for the (time-dependent) traveling salesman problem
• Implementing an efficient minimum capacity cut algorithm
• Vehicle dispatching with time-dependent travel times
• The precedence-constrained asymmetric traveling salesman polytope
• The time dependent traveling salesman problem: polyhedra and algorithm
• 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
• A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows
• Vehicle Routing
• Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The Delivery Man Problem and Cumulative Matroids
• Time‐dependent traveling salesman problem–the deliveryman case
• A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: An integer programming approach for the time-dependent traveling salesman problem with time windows