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

DOI10.1287/TRSC.29.2.167MaRDI QIDQ5689145zbMATH OpenOpenAlexFDO

Authors Russ J. vander Wiel, Nikolaos V. Sahinidis

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

Benders-decomposition-based heuristicdirected multipartite graph representationtime-dependent traveling salesman problemupper bound

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 947471
• Time‐dependent traveling salesman problem–the deliveryman case
• The time dependent traveling salesman problem: polyhedra and algorithm
• Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms

Cited in

(10)

• A new formulation for the traveling deliveryman problem
• A comparison of algorithms for finding an efficient theme park tour
• Hybrid optimization methods for time-dependent sequencing problems
• The time dependent traveling salesman problem: polyhedra and algorithm
• Models and algorithms for the traveling salesman problem with time-dependent service times
• An enhanced lower bound for the time-dependent travelling salesman problem
• Facets and valid inequalities for the time-dependent travelling salesman problem
• Dynasearch algorithms for solving time dependent traveling salesman problem
• An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
• The traveling salesman problem with cumulative costs

Describes a project that uses

Uses Software

• TSPLIB

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

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