Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem

DOI10.1287/trsc.29.2.167zbMath0860.90123OpenAlexW2095776854MaRDI QIDQ5689145

Nikolaos V. Sahinidis, Russ J. vander Wiel

Publication date: 20 February 1997

Published in: Transportation Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/trsc.29.2.167

zbMATH Keywords

upper boundtime-dependent traveling salesman problemBenders-decomposition-based heuristicdirected multipartite graph representation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11)

Related Items (5)

A comparison of algorithms for finding an efficient theme park tour ⋮ Hybrid optimization methods for time-dependent sequencing problems ⋮ Facets and valid inequalities for the time-dependent travelling salesman problem ⋮ A new formulation for the traveling deliveryman problem ⋮ An efficient two-phase metaheuristic algorithm for the time dependent traveling Salesman problem

Uses Software

• TSPLIB

This page was built for publication: Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem