An interactive algorithm for vehicle routeing for winter — gritting

Journal of the Operational Research Society

Volumn 47, Issue 2, 1996, Pages 217-228

  Li, Leon Y O ^a   Eglese, Richard W ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b LANCASTER UNIVERSITY   (United Kingdom)

Author keywords

Heuristics; Vehicle routeing; Winter gritting

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; GEOGRAPHIC INFORMATION SYSTEMS; HEURISTIC METHODS; HIGHWAY TRAFFIC CONTROL; HUMAN COMPUTER INTERACTION; ICE PROBLEMS; PROBLEM SOLVING; ROADS AND STREETS; TRANSPORTATION ROUTES;

CAPACITATED ARC ROUTING PROBLEM; GRITTING; INTERACTIVE ALGORITHM; VEHICLE ROUTING;

HIGHWAY ADMINISTRATION;

EID: 0030086498     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.20     Document Type: Article

References (21)

1. L. D. Bodin, S. J. Kursh (1978), A computer-assisted system for the routing and scheduling of street sweepers. Opns Res. 26, 525-537.
2. R. W. Eglese and H. Murdock (1991) Routeing road sweepers in a rural area. J. Opl Res. Soc. 42, 281-288.
3. J. W. Male and J. C. Liebman (1978) Districting and routing for solid waste collection. J. Environmental Enging Div., ASCE 104, 1-14.
4. E. Beltrami and L. Bodin (1974) Networks and vehicle routing for municipal waste collection. Networks 4, 65-94.
5. R. W. Eglese (1994) Routeing winter gritting vehicles. Discrete App. Maths. 48, 231-244.
6. R. W. Eglese and L. Y. O. Li (1992) Efficient routeing for winter gritting. J. Opl Res. Soc. 43, 1031-1034.
7. H. I. Stern and M. Dror (1979) Routing electric meter readers. Comps and Opns. Res. 6, 209-223.
8. B. L. Golden and A. A. Assad (Eds.) (1988) Vehicle Routing: Methods and Studies. North Holland, Amsterdam.
9. L. Bodin, B. L. Golden, A. A. Assad and M. Ball (1983) Routing and scheduling of vehicles and crews: the state of the art. Comps, and Opns Res. 10, 63-211.
10. H. A. Eiselt, M. Gendreau and G. Laporte (1994) Arc routing problems. Part I: The Chinese postman problem. Report #960 from Centre de Recherche sur les Transports, Universite de Montreal, Canada.
11. H. A. Eiselt, M. Gendreau and G. Laporte (1994) Arc routing problems. Part II: The rural postman problem. Report #961 from Centre de Recherche sur les Transports, Universite de Montreal, Canada.
12. M. Guan, (Kwan, Mei-Ko) (1962) Graphic programming using odd or even points. Chinese Maths. 1, 273-277.
13. J. Edmonds and E. Johnson (1973) Matching, Euler tours and the Chinese postman problem. Math. Prog. 5, 88-124.
14. B. L. Golden and R. T. Wong (1981) Capacitated arc routing problems. Networks 11, 305-315.
15. L. Y. O. Li (1992) Vehicle Routeing for Winter Gritting. Ph. D. Thesis, Lancaster University.
16. B. L. Golden, J. S. DeArmon and E. K. Baker (1983) Computational experiments with algorithms for a class of routing problems, Comps and Opns. Res. 10, 47-59.
17. E. Benavent, V. Campos, A. Corberan and E. Mota (1990) The capacitated arc routing problem: a heuristic algorithm. Quaderns d’Estadistica, Sistemes, Informatica i Investigacio Operativa (QVESTIIO) 14, 107-122.
18. C. Clarke and J. Wright (1964) Scheduling of vehicles from a central depot to a number of delivery points. Opns Res. 12, 568-581.
19. W. L. Pearn (1991) Augment-insert algorithms for the capacitated arc routing problem. Comps, and Opns Res. 18, 189-198.
20. L. Y. O. Li and R. W. Eglese (1992) A lower bound for the time constrained arc routeing problem. Presented at C092, Oxford.
21. E. Benavent, V. Campos, A. Corberan and E. Mota (1992) The capacitated arc-routing problem: lower bounds. Networks 22, 669-690.