Dynasearch algorithms for solving time dependent traveling salesman problem

MaRDI QIDQ3403334zbMATH OpenFDO

Authors Yan-Feng Li, Jun Li, Da Zhao

Publication date 12 February 2010

zbMATH Keywords

traveling salesman problemdynamic programming heuristicsdynasearch algorithm

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Combinatorial optimization (90C27)

Recommendations

• Traveling salesman problem in a time varying network
• scientific article; zbMATH DE number 947471
• A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
• Time‐dependent traveling salesman problem–the deliveryman case
• Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem

Cited in

(4)

• A sampling algorithm based on supervised learning for a dynamic traveling salesman problem
• Traveling salesman problem in a time varying network
• A pattern recognition lexi search approach to generalized time-dependent travelling salesman problem
• Hybrid control systems and the dynamic traveling salesman problem

This page was built for publication: Dynasearch algorithms for solving time dependent traveling salesman problem

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