Facets and valid inequalities for the time-dependent travelling salesman problem

DOI10.1016/J.EJOR.2013.05.022MaRDI QIDQ2514741zbMATH OpenOpenAlexFDO

Authors Juan José Miranda-Bront, Paula Zabala, Isabel Méndez-Díaz

Publication date 3 February 2015

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

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

zbMATH Keywords

combinatorial optimizationinteger programmingbranch and cuttime-dependent TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• An enhanced lower bound for the time-dependent travelling salesman problem
• scientific article; zbMATH DE number 947471
• A classification of formulations for the (time-dependent) traveling salesman problem
• The time dependent traveling salesman problem: polyhedra and algorithm
• The time-dependent traveling salesman problem
• Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm
• An integer programming approach for the time-dependent TSP
• Natural and extended formulations for the time-dependent traveling salesman problem
• Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem

Cites work

• scientific article; zbMATH DE number 947471 (Why is no real title available?)
• A classification of formulations for the (time-dependent) traveling salesman problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A new formulation for the traveling deliveryman problem
• Computer Solutions of the Traveling Salesman Problem
• Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
• Lifted cycle inequalities for the asymmetric traveling salesman problem
• Multistars, partial multistars and the capacitated vehicle routing problem
• On the dimension of projected polyhedra
• Scheduling in a sequence dependent setup environment with genetic search
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
• The Delivery Man Problem and Cumulative Matroids
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• The traveling salesman problem and its variations
• Time‐dependent traveling salesman problem–the deliveryman case

Cited in

(11)

• An integer programming approach for the time-dependent TSP
• Solving the traveling delivery person problem with limited computational time
• Hybrid optimization methods for time-dependent sequencing problems
• A classification of formulations for the (time-dependent) traveling salesman problem
• Models and algorithms for the traveling salesman problem with time-dependent service times
• A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
• A time-dependent no-overlap constraint: application to urban delivery problems
• Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
• The time dependent traveling salesman problem: polyhedra and algorithm
• Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
• A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints

Describes a project that uses

Uses Software

• CVRPSP

This page was built for publication: Facets and valid inequalities for the time-dependent travelling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2514741)