论文信息 - The Adult Training Centre Problem: A Case Study

The Adult Training Centre Problem: A Case Study

An optimal solution is found to a real-world problem which has the characteristics of a multiple travelling-salesman problem. It deals specifically with methods of obtaining the ‘best’ routeing for four vehicles which provide a daily service from a depot to 38 locations. The solution technique uses both heuristic and exact algorithms to derive the order for visits to the 38 locations.

C. Okonjo-Adigwe | C. Okonjo-Adigwe

[1] P. Miliotis,et al. Using cutting planes to solve the symmetric Travelling Salesman problem , 1978, Math. Program..

[2] Shen Lin. Computer solutions of the traveling salesman problem , 1965 .

[3] Mandell Bellmore,et al. Pathology of Traveling-Salesman Subtour-Elimination Algorithms , 1971, Oper. Res..

[4] Mandell Bellmore,et al. Transformation of Multisalesman Problem to the Standard Traveling Salesman Problem , 1974, JACM.

[5] Richard H Mole,et al. Combinatorial analysis for route first-cluster second vehicle routing , 1983 .

[6] Thomas L. Magnanti,et al. Implementing vehicle routing algorithms , 1977, Networks.

[7] L. Bodin. ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .