The time-dependent traveling salesman problem
From MaRDI portal
Publication:1850351
DOI10.1016/S0378-4371(02)01078-6zbMATH Open1001.90054MaRDI QIDQ1850351FDOQ1850351
Authors: Yanyan Li
Publication date: 3 December 2002
Published in: Physica A (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (15)
- A comparison of algorithms for finding an efficient theme park tour
- The timetable constrained distance minimization problem
- A time-dependent hierarchical Chinese postman problem
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem
- A classification of formulations for the (time-dependent) traveling salesman problem
- Facets and valid inequalities for the time-dependent travelling salesman problem
- Time‐dependent traveling salesman problem–the deliveryman case
- Vehicle routing under time-dependent travel times: the impact of congestion avoidance
- Title not available (Why is that?)
- Traveling salesman problem with clustering
- On path ranking in time-dependent graphs
- Time-dependent routing problems: a review
- An enhanced lower bound for the time-dependent travelling salesman problem
- Drilling path optimization by the particle swarm optimization algorithm with global convergence characteristics
- Title not available (Why is that?)
This page was built for publication: 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 Q1850351)