An integer programming approach for the time-dependent TSP

DOI10.1016/j.endm.2010.05.045zbMath1237.90168OpenAlexW2001239606MaRDI QIDQ2883581

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

Publication date: 13 May 2012

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.045

zbMATH Keywords

combinatorial optimizationbranch and cutTDTSP

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (8)

A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment ⋮ Time-dependent routing problems: a review ⋮ On path ranking in time-dependent graphs ⋮ 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 ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ An enhanced lower bound for the time-dependent travelling salesman problem ⋮ An assign-and-route matheuristic for the time-dependent inventory routing problem

Cites Work

• Unnamed Item
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• A new formulation for the traveling deliveryman problem
• On the dimension of projected polyhedra
• Scheduling in a sequence dependent setup environment with genetic search
• A classification of formulations for the (time-dependent) traveling salesman problem
• Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

This page was built for publication: An integer programming approach for the time-dependent TSP