An integer programming approach for the time-dependent traveling salesman problem with time windows
type: Item
instance of: scholarly article
title: An integer programming approach for the time-dependent traveling salesman problem with time windows
zbMATH Open document ID: 1391.90613
author: Agustín Montero
author: Isabel Méndez-Díaz
author: Juan José Miranda-Bront
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6902776
zbMATH Keywords: time-dependent TSP
zbMATH Keywords: time windows
zbMATH Keywords: integer linear programming
zbMATH Keywords: branch-and-cut
describes a project that uses: VRP
MaRDI profile type: Publication
full work available at URL: j.cor.2017.06.026
OpenAlex ID: W2733776472
cites work: The time dependent traveling salesman problem: polyhedra and algorithm
cites work: An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut
cites work: The precedence-constrained asymmetric traveling salesman polytope
cites work: A time bucket formulation for the traveling salesman problem with time windows
cites work: The Delivery Man Problem and Cumulative Matroids
cites work: Improved rolling horizon approaches to the aircraft sequencing problem
cites work: Time-dependent routing problems: a review
cites work: Natural and extended formulations for the time-dependent traveling salesman problem
cites work: A classification of formulations for the (time-dependent) traveling salesman problem
cites work: Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems
cites work: Vehicle dispatching with time-dependent travel times
cites work: Time‐dependent traveling salesman problem–the deliveryman case
cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms
cites work: A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems
cites work: A new formulation for the traveling deliveryman problem
cites work: Implementing an efficient minimum capacity cut algorithm
cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
cites work: A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times
cites work: Vehicle Routing
DOI: 10.1016/J.COR.2017.06.026
description: scientific article; zbMATH DE number 6902776