论文信息 - A computerised vehicle routing system for refuse collection

A computerised vehicle routing system for refuse collection

Abstract This paper describes the development and structure of a computerised vehicle routing system for refuse collection in Singapore. The system uses the ‘route first-cluster second’ approach with some enhancement made in order to improve the CPU time requirement. The results obtained with data from some existing routes are also described.

Thong Ngee Goh | Cheng-Chew Lim | H. L. Ong | Kim-Leng Poh

[1] Patrick D. Krolak,et al. A man-machine approach toward solving the traveling salesman problem , 1970, DAC '70.

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

[3] JATINDW N. D. GUPTA. A search algorithm for the traveling salesman problem , 1978, Comput. Oper. Res..

[4] Robert M. Clark,et al. Systems Analysis and Solid Waste Planning , 1974 .

[5] Lawrence Bodin,et al. Microcomputer-based vehicle routing and scheduling software , 1986, Comput. Oper. Res..

[6] G. Clarke,et al. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[7] Lawrence Bodin,et al. Classification in vehicle routing and scheduling , 1981, Networks.

[8] Richard D. McBride,et al. Controlling left and u-turns in the routing of refuse collection vehicles , 1982, Comput. Oper. Res..

[9] Bruce L. Golden,et al. A statistical approach to the tsp , 1977, Networks.