A novel methodology for designing a household waste collection system for insular zones

Transportation Research Part E: Logistics and Transportation Review

Volumn 77, Issue , 2015, Pages 227-247

  Miranda, Pablo A ^a   Blazquez, Carola A ^b   Vergara, Rodrigo ^a   Weitzler, Sebastian ^a  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE VALPARAÍSO   (Chile)

^b UNIVERSIDAD ANDRÉS BELLO   (Chile)

Author keywords

Insular rural household waste; Periodic vehicle routing problem; Waste collection site selection; Waste Collection System Design

Indexed keywords

BARGES; BINS; DESIGN; INTEGER PROGRAMMING; PICKUPS; RURAL AREAS; SOLID WASTES; VEHICLE ROUTING;

COLLECTION SYSTEMS; HOUSEHOLD WASTE; INSULAR RURAL HOUSEHOLD WASTE; NOVEL METHODOLOGY; PERIODIC VEHICLE ROUTING PROBLEM; RURAL HOUSEHOLD WASTES; WASTE COLLECTION; WASTE COLLECTION SITE SELECTION; WASTE COLLECTION SYSTEM DESIGN;

SITE SELECTION;

DECISION SUPPORT SYSTEM; DESIGN; MODEL TEST; MODEL VALIDATION; PLANNING METHOD; RURAL AREA; TRANSPORTATION SYSTEM; WASTE MANAGEMENT;

CHILE;

EID: 84925649410     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2015.02.019     Document Type: Article

References (58)

1. Agarwal R., Ergun O. Ship scheduling and network design for cargo routing in liner shipping. Transport. Sci. 2008, 42:175-196.
2. Agra A., Christiansen M., Delgado A. Mixed integer formulations for a short sea fuel oil distribution problem. Transport. Sci. 2013, 47(1):108-124.
3. Aksen D., Kaya O., Salman F.S., Akça Y. Selective and periodic inventory routing problem for waste vegetable oil collection. Optim. Lett. 2012, 6(6):1063-1080.
4. Al-Khayyal F., Hwang S.-J. Inventory constrained maritime routing and scheduling for multi-commodity liquid bulk, Part I: Applications and model. Eur. J. Oper. Res. 2007, 176(1):106-130.
5. Ando N., Taniguchi E. Travel time reliability in vehicle routing and scheduling with time windows. Network Spatial Econ. 2006, 6(3-4):293-311.
6. Angelelli E., Speranza M.G. The application of a vehicle routing model to a waste-collection problem: two case studies. J. Oper. Res. Soc. 2002, 53:944-952.
7. Angelelli E., Speranza M.G. The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 2002, 137(2):233-247.
8. Arribas C.A., Blazquez C.A., Lamas A. Urban solid waste collection system using mathematical modelling and tools of geographic information systems. Waste Manage. Res. 2010, 28(4):355-363.
9. Bertazzi L., Paletta G., Speranza M. Deterministic order up to level policies in an inventory routing problem. Transport. Sci. 2002, 36(1):119-132.
10. Bertazzi L., Savelsbergh M., Speranza M. Inventory routing in the vehicle routing problem: latest advances and new challenges. Oper. Res./Comput. Sci. Interfaces Ser. 2008, 43(I):49-72.
11. Bronmo G., Christiansen M., Nygreen B. Ship routing and scheduling with flexible cargo sizes. J. Oper. Res. Soc. 2007, 58(9):1167-1177.
12. Campbell A., Savelsbergh M. A decomposition approach for the inventory-routing problem. Transport. Sci. 2004, 38:488-502.
13. Christiansen M., Fagerholt K., Ronen D. Ship routing and scheduling: status and perspectives. Transport. Sci. 2003, 38(1):1-18.
14. Dadkar Y., Jones D., Nozick L. Identifying geographically diverse routes for the transportation of hazardous materials. Transp. Res. Part E 2008, 44(3):333-349.
15. De Figueiredo J.N., Mayerle S.F. Designing minimum-cost recycling collection networks with required throughput. Transp. Res. Part E 2008, 44:731-752.
16. Desrosiers J., Dumas Y., Solomon M.M., Soumis F. Time constrained routing and scheduling. Handbooks in Operations Research and Management Science, Network Routing 1995, vol. 8:35-139. North Holland, Amsterdam.
17. El-Hamouz A.M. Logistical management and private sector involvement in reducing the cost of municipal solid waste collection service in the Tubas are of the West Bank. Waste Manage. 2008, 28:260-271.
18. Erkut E. On the credibility of the conditional risk model for routing hazardous materials. Oper. Res. Lett. 1995, 18:49-52.
19. Erkut E., Verter V. Modeling of transport risk for hazardous materials. Oper. Res. 1998, 46:625-642.
20. Francis P.M., Smilowitz K.R., Tzur M. The period vehicle routing problem and its extensions. In the vehicle routing problem: latest advances and new challenges. Operations Research/Computer Science Interfaces Series 2008, 73-102. vol. 43.
21. Gatica R., Miranda P.A. A time based discretization approach for ship routing and scheduling with variable speed. Netw. Spat. Econ. 2011, 11:465-485.
22. Gendreau M., Laporte G., Semet F. A branch and cut algorithm for the undirected selective traveling salesman problem. Networks 1998, 32:263-273.
23. Giannikos I. A multiobjective programming model for locating treatment sites and routing hazardous wastes. Eur. J. Oper. Res. 1998, 104:333-342.
24. Gottinger H.W. A computational model for solid waste management with application. Eur. J. Oper. Res. 1988, 35:350-364.
25. Gribkovskaia I., Laporte G., Shyshou A. The single vehicle routing problem with deliveries and selective pickups. Comput. Oper. Res. 2007, 35(9):2908-2924.
26. Gribkovskaia I., Halskau O., Laporte G., Vlcek M. General solutions to the single vehicle routing problem with pickups and deliveries. Eur. J. Oper. Res. 2007, 180(2):568-584.
27. Grupo de Residuos Sólidos, GRS, 2009. Diagnóstico para la gestión integral de residuos sólidos en las provincias de Chiloé y Palena. Pontificia Universidad Catolica de Valparaíso, Chile. http://www.grs-pucv.cl.
28. Gutierrez-Jarpa G., Desaulniers G., Laporte G., Marianov V. A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows. Eur. J. Oper. Res. 2010, 206:341-349.
29. He L., Huang G.-H., Zeng G.-M., Lu H.-W. Identifying optima regional solid waste management strategies through an inexact integer programming model containing infinite objectives and constraints. Waste Manage. 2009, 29:21-31.
30. Hemmelmayr V., Doerner K.F., Hartl R.F., Rath S. A heuristic solution method for node routing based solid waste collection problems. J. Heurist. 2013, 19(2):129-156.
31. Huang B., Cheu R.L. GIS and genetic algorithms for HAZMAT route planning with security considerations. Int. J. Geogr. Inform. Sci. 2004, 18(8):769-787.
32. Karadimas N., Papatzelou K., Loumos V. Optimal solid waste collection routes identified by the ant colony system algorithm. Waste Manage. Res. 2007, 25:139-147.
33. Kim B., Kim S., Sahoo S. Waste collection vehicle routing problem with time windows. Comput. Oper. Res. 2006, 33:3624-3642.
34. Kirca Ö., Erkip N. Selecting transfer station locations for large solid waste systems. Eur. J. Oper. Res. 1988, 35:339-349.
35. Laporte G., Martello S. The selective traveling salesman problem. Discrete Appl. Math. 1990, 26:193-207.
36. Laporte G., Osman I.H. Routing problems: a bibliography. Ann. Oper. Res. 1995, 61:227-262.
37. List G., Mirchandani P.B. An integrated network/planar multiobjective model for routing and siting for hazardous materials and wastes. Transport. Sci. 1991, 25:146-156.
38. List G.F., Mirchandani P.B., Turnquist M.A., Zofragos K.G. Modeling and analysis for hazardous materials transportation: risk analysis, routing/scheduling and facility location. Transport. Sci. 1991, 25:100-114.
39. Meng Q., Lee D.-H., Cheu R.L. Multiobjective vehicle routing and scheduling problem with time window constraints in hazardous material transportation. ASCE J. Transport. Eng. 2005, 131(9):699-707.
40. Nemhauser G., Wolsey L. Integer and Combinatorial Optimization 1988, Wiley, New York.
41. Parker N., Fan Y., Ogden J. From waste to hydrogen: an optimal design of energy production and distribution network. Transp. Res. Part E 2010, 46:534-545.
42. Patel M.H., Horowitz A.J. Optimal routing of hazardous materials considering risk of spill. Transp. Res. Part A 1994, 28A:119-132.
43. Raa B., Aghezzaf E. A practical solution approach for the cyclic inventory routing problem. Eur. J. Oper. Res. 2007, 192:429-441.
44. Raa B., Aghezzaf E., Dullaert W. Cyclic scheduling of multiple tours with multiple frequencies for a single vehicle. Int. J. Logistics Syst. Manage. 2007, 5(3-4):214-227.
45. Ramos T.R.P., Gomes M.I., Barbosa-Póvoa A.P. Economic and environmental concerns in planning recyclable waste collection systems. Transp. Res. Part E 2014, 62:34-54.
46. Revelle C., Cohon J., Shobrys D. Simultaneous sitting and routing in the disposal of hazardous wastes. Transport. Sci. 1991, 25:138-145.
47. Ronen D. Ship scheduling: the last decade. Eur. J. Oper. Res. 1993, 71(3):325-333.
48. Saccomanno F.F., Shortreed J.H. Hazardous material transport risk: societal and individual perspectives. ASCE J. Transport. Eng. 1993, 119:177-188.
49. Sharholy M., Ahmad K., Vaishya R.C., Grupta R.D. Municipal solid waste characteristics and management in Allahabad, India. Waste Manage. 2007, 27:490-496.
50. Sherali H.D., Al-Yakoob S.M., Hassan M.M. Fleet management models and algorithms for an oil tanker routing and scheduling problem. IIE Trans. 1999, 31(5):395-406.
51. Sivakumar R.A., Batta R., Karwan M.H. A multiple route conditional risk model for transporting hazardous materials. Inform. Syst. Oper. Res. 1995, 33:20-33.
52. Süral H., Bookbinder J. The single-vehicle routing problem with unrestricted backhauls. Networks 2003, 41(3):127-136.
53. Viotti P., Polettini A., Pomi R., Innocenti C. Genetic algorithms as a promising tool for optimization of the solid waste collection routes. Waste Manage. Res. 2003, 21:292-298.
54. Wolsey L. Integer Programming 1998, John Wiley & Sons, Inc., New York.
55. Xu Y., Huang G.H., Qin X.S., Cao M.F., Sun Y. An interval-parameter stochastic robust optimization model for supporting municipal solid waste management under uncertainty. Waste Manage. 2010, 30:316-327.
56. Zhang J., Hodgson J., Erkut E. Using GIS to assess the risks of hazardous materials transport in networks. Eur. J. Oper. Res. 2000, 121:316-329.
57. Zheng H.Z., Guo H.Y., Zhang X.D. Modeling and approach for VMI cyclic inventory routing problem. Proceedings of the Eighth International Conference on Machine Learning and Cybernetics 2009, 1393-1398.
58. Zhong Y., Aghezzaf E.H. A combined dc programming and branch-and-bound to solve the single-vehicle cyclic inventory routing problem with a fixed cycle time. Proceedings of the International Conference on Computers & Industrial Engineering 2009, 338-343.