Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

The time-dependent traveling salesman problem

From MaRDI portal
Publication:1850351
Jump to:navigation, search

DOI10.1016/S0378-4371(02)01078-6zbMath1001.90054MaRDI QIDQ1850351

Yanyan Li

Publication date: 3 December 2002

Published in: Physica A (Search for Journal in Brave)


zbMATH Keywords

simulated annealingtraffic jamsphysical optimization algorithms


Mathematics Subject Classification ID

Combinatorial optimization (90C27)


Related Items (9)

A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem ⋮ Time-dependent routing problems: a review ⋮ On path ranking in time-dependent graphs ⋮ Traveling salesman problem with clustering ⋮ Drilling path optimization by the particle swarm optimization algorithm with global convergence characteristics ⋮ A comparison of algorithms for finding an efficient theme park tour ⋮ Vehicle routing under time-dependent travel times: the impact of congestion avoidance ⋮ A time-dependent hierarchical Chinese postman problem ⋮ An enhanced lower bound for the time-dependent travelling salesman problem



Cites Work

  • Optimization by Simulated Annealing
  • Equation of State Calculations by Fast Computing Machines
  • Computer Solutions of the Traveling Salesman Problem
  • Unnamed Item


This page was built for publication: The time-dependent traveling salesman problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1850351&oldid=14234924"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 12:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki