Research on Traveling Salesman Problem of Short-Haul Freight Transportation

Xiao Chen Li; Ya Xu

doi:10.4028/www.scientific.net/AMM.253-255.1151

Paper Titles

The Analysis of Planning Guide Effect of Guangzhou Metro Line Five’s Construction to the Non-Existed Central District of the City
p.1130

A New Monitoring and Early-Warning System on Large Range Road Using IPv6 Network
p.1135

The Study on Expressway Reconstruction Project of China
p.1139

Transportation Accessibility Research on Shenyang TieXi Industrial Corridor Area
p.1147

Research on Traveling Salesman Problem of Short-Haul Freight Transportation
p.1151

Study on the Line Capacity on Passenger Dedicated Lines Based on the Stops Adjustment
p.1158

Port Competition in the International Transshipment Hub Sector, Busan and Shanghai
p.1163

The Queuing Model and Simulation of Container Terminal Based on Liner Transport
p.1167

Study on Planning of Entrance Fairway for Sea Port Based on Maritime Simulator
p.1171

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vols. 253-255Research on Traveling Salesman Problem of...

Research on Traveling Salesman Problem of Short-Haul Freight Transportation

Abstract:

This paper mainly focus on the traveling salesman problem of short haul freight transportation, according to the objectives and the constraints of this problem, this paper gives a example to confirm the salesman problem, and the conclusion shows that the reasonable constraints is useful for short haul freight transportation.

You might also be interested in these eBooks

Sustainable Development of Urban Infrastructure

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volumes 253-255)

Pages:

1151-1157

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.253-255.1151

Citation:

Cite this paper

Online since:

December 2012

Authors:

Xiao Chen Li, Ya Xu

Keywords:

Patching Heuristic, Salesman Problem, Transportation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Golden BL, Wasil EA, Kelly JA and Chao IM 1988 The impact of metaheuristics on solving the vehicle routing problem: algorithm, problem sets and computational results. In Fleet Management and Logistics (ed. Laporte G and Crainic TG). Kluwer, Boston.

DOI: 10.1007/978-1-4615-5755-5_2

Google Scholar

[2] Fisher ML1995 Vehicle routing. In Network Routing (ed. Ball MO, Magnanti TL, Monma CL and Nemhauser GL). North-Holland, Amsterdam.

Google Scholar

[3] Cordeau JF, Laporte G and Mercier A 2001 A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society 52, 928-936.

DOI: 10.1057/palgrave.jors.2601163

Google Scholar

[4] Assad A and Golden BL 1995 Arc routing methods and applications. In Hand-books in Operations Research and Management Science, 8: Network Routing (ed. Ball MO, Magnanti TL, Monma CL and Nemhauser GL), pp.374-483. Elsevier Sceience, Amsterdam.

DOI: 10.1016/s0927-0507(05)80104-5

Google Scholar

[5] Eiselt HA, Gendreau M and Laporte G 1995 Arc routing problems. Part I. The Chinese postman problem. Operations Research 43, 231-242.

DOI: 10.1287/opre.43.2.231

Google Scholar

[6] Eiselt HA, Gendreau M and Laporte G 1995 Arc routing problems. Part II. The rural postman problem. Operations Research 43, 399-414.

DOI: 10.1287/opre.43.3.399

Google Scholar

[7] Psaraftis HN 1995 Dynamic vehicle routing: status and prospects. Annals of Operations Research 61, 143-164.

DOI: 10.1007/bf02098286

Google Scholar

[8] Gendreau M and Potvin JY 1998 Dynamic vehicle routing and dispatching. In Fleet Management and Logistics (ed. Laporte G and Crainic TG). Kluwer, Boston.

DOI: 10.1007/978-1-4615-5755-5_5

Google Scholar