Comparative study between the heuristic algorithm and the optimization technique for vehicle routing and scheduling in a solid waste collection system

Civil Engineering and Environmental Systems

Volumn 19, Issue 1, 2002, Pages 41-65

  Chang, Ni Bin ^a   Wei, Y L ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

Environmental systems analysis; Heuristic algorithm; Optimization; Solid waste collection; Solid waste management; Vehicle routing

Indexed keywords

ALGORITHMIC LANGUAGES; ENVIRONMENTAL IMPACT; HEURISTIC METHODS; PROBLEM SOLVING; SCHEDULING;

ENVIRONMENTAL WASTE COLLECTION; HEURISTIC ALGORITHMS; SOLID WASTE COLLECTION; VEHICLE ROUTING;

WASTE DISPOSAL;

CIVIL ENGINEERING;

EID: 28344450312     PISSN: 10286608     EISSN: 10290249     Source Type: Journal    
DOI: 10.1080/10286600212162     Document Type: Article

References (55)

1. Achuthan, N. R. and Caccetta, L. (1991) Integer linear programming formulation for a vehicle routing problem. European Journal of Operational Research, 52, 86-89.
2. Bodin, L. D. and Krush, S. J. (1978) A computer-assisted system for the routing and scheduling of street sweepers. Operations Research, 26(4), 525-537.
3. Brodie, G. R. and Wasters, C. D. J. (1988) Integer linear programming formulation for vehicle routing problems. European Journal of Operational Research, 34, 403-404.
4. Blanton, J. L. and Wainwright, R. L. (1993) Multiple vehicle routing with time and capacity constraints using genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms, University of Illinois at Urbana-Champaign, IL, USA, pp. 452-459.
5. Balas, E. and Christofides, N. A. (1981) Restricted Lagrangean approach to the traveling salesman problem. Mathematical Programming, 21, 19-46.
6. Bodin, L. D. and Golden, B. (1983) Routing and scheduling of vehicles and crews - the state of the art. Computers and Operation Research, 10, 63-211.
7. Chang, N. B. and Wang, S. F. (1994) A locational model for the site selection of solid waste management facilities with traffic congestion constraints. Journal of Civil Engineering Systems, 11, 287-306.
8. Chang, N. B., Lu, H. Y. and Wei, Y. L. (1997a) GIS technology for vehicle routing and scheduling in solid waste collection systems. Journal of Environmental Engineering, ASCE, 123(9), 901-910.
9. Chang, N. B., Chang, Y. H. and Chen, Y. L. (1997b) Cost-effective and Workload Balancing Operation in Solid Waste Management Systems. Journal of Environmental Engineering, ASCE, 123(2), 178-190.
10. Chang, Y. H. and Chang, N. B. (1998) Optimization analysis for the development of short-term solid waste management strategies using presorting process prior to incinerator. Resources Conservation and Recycling, 24, 7-32.
11. Chang, N. B. and Wei, Y. L. (1999) Strategic planning of recycling drop-off stations by multi-objective programming. Environmental Management, 24(2), 247-264.
12. Chang, N. B. and Chang, Y. H. (2000) Optimal shipping strategy of solid waste streams with respect to throughput and energy recovery goals of incineration facilities. Civil Engineering and Environmental Systems, in press.
13. Christofides, N. (1976) The vehicle routing problems revue francaised. Automatique, Informatiqueet Recherche Operationnelle, 10, 55.
14. Chiplunkar, A. V., Mehndiratta, S. L. and Khanna, P. (1981) Optimization of refuse collection systems. Journal of Environmental Engineering, ASCE, 107(6), 1203-1210.
15. Christofides, N., Mingozzi, A. and Toth, P. (1981) State space relaxation procedures for the computation of bounds to routing problems. Networks, 11, 145-164.
16. Clark, G. and Wright, J. W. (1964) Scheduling of vehicles from a central depot to a number of delivery points. Operation Research, 12, 568-581.
17. Cornuejols, G. and Harche, F. (1993) Polyhedral study of the capacitated vehicle routing problem. Mathematical Programming, 60, 21-52.
18. Davis, L. (1991) Handbook of Genetic Algorithm, Van Nostrand Reinhold, New York, USA.
19. Eilon, S. (1977) Management perspectives in physical distribution. OMEGA, pp. 437-462.
20. Foster, B. A. and Ryan, D. M. (1976) An integer programming approach to the vehicle scheduling problem. Operational Research Quarterly, 27, 367-384.
21. Fisher, M. L. and Jaikumar, R. A. (1981) A generalized assignment heuristic for vehicle routing. Networks, 11, 109-124.
22. Fisher, M. L. (1994) Optimal solution of vehicle routing problems using minimum k-trees. Operations Research, 42(4), 626-642
23. Eiselt, H. A., Gendreau, M. and Laporte, G. (1995) Arc routing problems, part II: the rural postal problem. Operations Research, 43, 399-414.
24. Golden, B. L. and Skiscim, C. C. (1986) Using simulated annealing to solve routing and location problem. Navy Research Logistics Quarterly, 33, 261-279.
25. Gillett, B. and Miller, L. (1974) A heuristic algorithm for the vehicle dispatch problem. Operation Research, 22, 304-349.
26. Golden, B. L., Magnanti, T. L. and Nguyen, H. Q. (1977) Implementing vehicle routing algorithms. Networks, 7, 113-148.
27. Golden, B. L., Assad, A., Levy, L. and Gheysens, F. G. (1984) The fleet size and mix vehicle routing problem. Computers & Operations Research, 11, 49-66.
28. Garcia, B. L., Potvin, J. Y. and Rousseau, J. M. (1993) A parallel implementation of the Tabu search heuristic for the vehicle routing problem with time window constraints. Computers Operations Research, 21(9), 1025-1033.
29. Gendreau, M., Hertz, A. and Laporte, G. (1992) New insertion and post-optimization procedures for the travelling salsman problem. Operations Research, 40, 1086-1094.
30. Gendreau, M., Hertz, A. and Laporte, G. (1994) Tabu search heuristic for the vehicle routing problem, Management Science, 40(10), 1276-1290.
31. Gcndrcau, M., Laporte, G. and Potvin, J. Y. (1997) Vehicle routing: modern heuristics. In: Arts, E. A. and Lenstra, J. K. (Eds.), Local Search in Combinatorial Optimization, John Wiley, Chichester, UK, pp. 311-336.
32. Goldberg, D. E. and Lingle, R. A. L. Jr. (1985) Genetic algorithms and the traveling salesman problem. Proceedings of the First International Conference on Genetic Algorithms, and Their Applications, Carnegie-Mellon University, Pittsburg, PA, USA, pp. 154-159.
33. Held, M. and Karp, R. (1970) The traveling salesman problem and minimum spanning trees. Operations Research, 18, 1138-1162.
34. Hadjiconstantinou, E., Christofides, N. and Mingozzi, A. (1995) Anew exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations. Annals of Operation Research, 61, 21-43.
35. Klincewicz, J. G., Luss, H. and Pilcher, M. G. (1990) Fleet size planning when outside carrier service are available. Transportation Research, 24, 169-182.
36. Koskosidis, Y. A. and Powell, W. B. (1992) Clustering algorithms for consolidation of customer orders into vehicle shipments. Transportation Research, 26, 365-379.
37. Laporte, G., Mercure, H. and Nobert, Y. (1986) An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks, 16, 33-46.
38. Laporte, G. (1995) The vehicle routing problem: overview of the exact and approximate algorithms. European Journal of Operational Research, 59, 345-358.
39. Liebman, J. C., Male, J. W. and Wathne, M. (1975) Minimum cost in residential refuse vehicle routes. Journal of Environmental Engineering, ASCE, 101(3), 399-411.
40. Lin, S. and Kernighan, B. (1973) An effective heuristic for the traveling salesman problems. Operations Research, 21, 498-516.
41. Lysgaard, J. (1992) Dynamic transportation networks in vehicle routing and schedule. Interfaces, 22(3), 45-55.
42. Miller, D. L. (1995) A matching based exact algorithm for capacitated vehicle routing problems. ORSA/Journal on Computing, 7, 1-9.
43. Mole, R. H. (1975) Dynamic optimization of vehicle fleet size. Operational Research Quarterly, 26, 25-34.
44. Mole, R. H. and Jameson, C. A. (1976) A sequential route building algorithm employing a generalized saving criterion. Operational Research Quarterly, 27, 503-511.
45. Nelson, M. D., Nygard, K. E., Griffin, J. H. and Shreve, W. E. (1985) Implementation techniques for the vehicle routing problem. Computers and Operations Research, 12, 273-283.
46. Newton, R. M. and Thomas, W. H. (1974) Bus routing in a multi-school system. Computers and Operations Research, 1, 213-222.
47. Ong, H. L., Goh, T. N. and Poh, K. L. (1990) A computerised vehicle routing system for refuse collection. Advances in Engineering Software, 12(2), 54-58.
48. Oliver, I. M. (1987) A study of permutation crossover operators on the traveling salesman problem. Proceedings of the Second International Conference on Genetic Algorithms, and Their Applications, Massachusetts Institute of Technology, Cambridge, MA, USA, pp. 224-230.
49. Osman, I. H. (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41, 421-451.
50. ReVelle, C., Cohon, J. and Shobrys, D. (1991) Simultaneous siting and routing in the disposal of hazardous wastes. Transportation Science, 25(2), 138-145.
51. Renaud, J., Boctor, F. F. and Laporte, G. (1996) Improved petal heuristic for the vehicle routing problem. Journal of Operational Research Society, 47(2), 329-336.
52. Renaud, J., Boctor, F. F. and Laporte, G. A. (1996) Fast composite heuristic for the symmetric traveling salesman problem. INFORMS Journal on Computing, 3, 2, 134-143.
53. Thangiah, S. R. (1995) An Adaptive Clustering Method Using a Geometric Shape for Vehicle Routing Problems with Time Windows. Proceedings of the Sixth International Conference on Genetic Algorithms, University of Pittsburg, USA, pp. 536-543.
54. Thangiah, S. R., Vinayagamoorthy, R. and Gubbi, A. (1993) Vehicle Routing with Time Deadlines Using Genetic and Local Algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms, University of Illinois at Urbana-Champaign, USA, pp. 506-513.
55. Taillard, E. (1993) Parallel iterative search methods for vehicle routing problems. Networks, 23, 1-13.