The time dependent traveling salesman problem: polyhedra and algorithm
From MaRDI portal
Publication:1947199
DOI10.1007/s12532-012-0047-yzbMath1269.90064OpenAlexW2080484716MaRDI QIDQ1947199
Hernán G. Abeledo, Artur Alves Pessoa, Eduardo Uchoa, Ricardo Fukasawa
Publication date: 12 April 2013
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-012-0047-y
integer programmingcutting planespolyhedral combinatoricsbranch-price-and-cuttime dependent traveling salesman
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (29)
Layered graph approaches for combinatorial optimization problems ⋮ An integrated approach for earthwork allocation, sequencing and routing ⋮ Dealing with time in the multiple traveling salespersons problem with moving targets ⋮ An integer programming approach for the time-dependent traveling salesman problem with time windows ⋮ A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment ⋮ A branch-and-price algorithm for the minimum latency problem ⋮ Load-dependent and precedence-based models for pickup and delivery problems ⋮ The arc-item-load and related formulations for the cumulative vehicle routing problem ⋮ A simple and effective metaheuristic for the minimum latency problem ⋮ Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery ⋮ Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem ⋮ Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND ⋮ Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization ⋮ Tight lower bounds for the traveling salesman problem with draft limits ⋮ An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem ⋮ Variable neighborhood search for the travelling deliveryman problem ⋮ A bi-criteria moving-target travelling salesman problem under uncertainty ⋮ A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem ⋮ Minimizing customers' waiting time in a vehicle routing problem with unit demands ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ Identification of unidentified equality constraints for integer programming problems ⋮ Perspectives on integer programming for time-dependent models ⋮ Exact algorithms for the traveling salesman problem with draft limits ⋮ A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints ⋮ A minmax regret version of the time-dependent shortest path problem ⋮ Models and algorithms for the traveling salesman problem with time-dependent service times ⋮ An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem ⋮ Solving the traveling delivery person problem with limited computational time ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A theorem on flows in networks
- 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 solution of traveling salesman problems
- A classification of formulations for the (time-dependent) traveling salesman problem
- New facets of the STS polytope generated from known facets of the ATS polytope
- An integer programming approach for the time-dependent TSP
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- 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
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- On Representatives of Subsets
- On the facial structure of set packing polyhedra
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
This page was built for publication: The time dependent traveling salesman problem: polyhedra and algorithm
