Abstract
In this paper, some of the main known algorithms for the traveling salesman problem are surveyed. The paper is organized as follows: 1) definition; 2) applications; 3) complexity analysis; 4) exact algorithms; 5) heuristic algorithms; 6) conclusion.
Author supplied keywords
- a n u m
- and
- b e r of
- can be described as
- central role in the
- collection routes from one
- customers
- fields of physical distribution
- geographically scattered cities or
- optimal delivery or
- or several depots to
- problem
- r p plays a
- routing problem
- subject to side constraints
- survey
- t h e v
- t h e vehicle
- t i n g
- the problem of designing
- v r p
- vehicle r o u
Cite
CITATION STYLE
APA
Gilbert, Laporte. (1992). The Vehicle Routing Problem: An overview of exact and approximate algorithms. European Journal Of Operational Research, 59(1992), 231–247. Retrieved from http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.461.189&rep=rep1&type=pdf
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free