IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v48y2014i1p103-120.html
   My bibliography  Save this article

Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management

Author

Listed:
  • Vera C. Hemmelmayr

    (Department of Business Administration, University of Vienna, A-1210 Wien, Austria; and Institute for Transport and Logistics Management, Vienna University of Economics and Business, 1090 Wien, Austria)

  • Karl F. Doerner

    (Department of Business Administration, University of Vienna, A-1210 Wien, Austria; and Institute of Production and Logistics Management, Johannes Kepler University Linz, A-4040 Linz, Austria)

  • Richard F. Hartl

    (Department of Business Administration, University of Vienna, A-1210 Wien, Austria)

  • Daniele Vigo

    (Department of Electrical, Electronic, and Information Engineering “G. Marconi,” University of Bologna, 40136 Bologna, Italy)

Abstract

The efficient organization of waste collection systems based on bins located along the streets involves the solution of several tactical optimization problems. In particular, the bin configuration and sizing at each collection site as well as the service frequency over a given planning horizon have to be decided. In this context, a higher service frequency leads to higher routing costs, but at the same time less or smaller bins are required, which leads to lower bin allocation investment costs. The bins used have different types and different costs and there is a limit on the space at each collection site as well as a limit on the total number of bins of each type that can be used. In this paper we consider the problem of designing a collection system consisting of the combination of a vehicle routing and a bin allocation problem in which the trade-off between the associated costs has to be considered. The solution approach combines an effective variable neighborhood search metaheuristic for the routing part with a mixed integer linear programming-based exact method for the solution of the bin allocation part. We propose hierarchical solution procedures where the two decision problems are solved in sequence, as well as an integrated approach where the two problems are considered simultaneously. Extensive computational testing on synthetic and real-world instances with hundreds of collection sites shows the benefit of the integrated approaches with respect to the hierarchical ones.

Suggested Citation

  • Vera C. Hemmelmayr & Karl F. Doerner & Richard F. Hartl & Daniele Vigo, 2014. "Models and Algorithms for the Integrated Planning of Bin Allocation and Vehicle Routing in Solid Waste Management," Transportation Science, INFORMS, vol. 48(1), pages 103-120, February.
  • Handle: RePEc:inm:ortrsc:v:48:y:2014:i:1:p:103-120
    DOI: 10.1287/trsc.2013.0459
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.2013.0459
    Download Restriction: no

    File URL: https://libkey.io/10.1287/trsc.2013.0459?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Baptista, Susana & Oliveira, Rui Carvalho & Zuquete, Eduardo, 2002. "A period vehicle routing case study," European Journal of Operational Research, Elsevier, vol. 139(2), pages 220-229, June.
    2. Beasley, JE, 1983. "Route first--Cluster second methods for vehicle routing," Omega, Elsevier, vol. 11(4), pages 403-408.
    3. Tan, C.C.R. & Beasley, J.E., 1984. "A heuristic algorithm for the period vehicle routing problem," Omega, Elsevier, vol. 12(5), pages 497-504.
    4. Peter Francis & Karen Smilowitz & Michal Tzur, 2006. "The Period Vehicle Routing Problem with Service Choice," Transportation Science, INFORMS, vol. 40(4), pages 439-454, November.
    5. C Archetti & M G Speranza, 2004. "Vehicle routing in the 1-skip collection problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 717-727, July.
    6. David Pisinger, 2000. "A Minimal Algorithm for the Bounded Knapsack Problem," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 75-82, February.
    7. G. Clarke & J. W. Wright, 1964. "Scheduling of Vehicles from a Central Depot to a Number of Delivery Points," Operations Research, INFORMS, vol. 12(4), pages 568-581, August.
    8. Peter Francis & Karen Smilowitz & Michal Tzur, 2007. "Flexibility and complexity in periodic distribution problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 136-150, March.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Han, Jialin & Zhang, Jiaxiang & Guo, Haoyue & Zhang, Ning, 2024. "Optimizing location-routing and demand allocation in the household waste collection system using a branch-and-price algorithm," European Journal of Operational Research, Elsevier, vol. 316(3), pages 958-975.
    2. Feng Dai & Yi Chen, 2023. "Integrated dynamic municipal solid waste transfer station location decision study based on the dynamic MSW generation," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 25(7), pages 6033-6047, July.
    3. Haoqing Wang & Wen Yi & Yannick Liu, 2022. "Optimal Route Design for Construction Waste Transportation Systems: Mathematical Models and Solution Algorithms," Mathematics, MDPI, vol. 10(22), pages 1-13, November.
    4. Gläser, Sina & Stücken, Mareike, 2021. "Introduction of an underground waste container system–model and solution approaches," European Journal of Operational Research, Elsevier, vol. 295(2), pages 675-689.
    5. Yi Chen & Feng Dai & Mengjuan Cao, 2021. "An optimized MSW transfer station location system based on internet of things," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(4), pages 675-688, August.
    6. Pradeep Rathore & Sarada Prasad Sarmah & Arti Singh, 2020. "Location–allocation of bins in urban solid waste management: a case study of Bilaspur city, India," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 22(4), pages 3309-3331, April.
    7. Markov, Iliya & Varone, Sacha & Bierlaire, Michel, 2016. "Integrating a heterogeneous fixed fleet and a flexible assignment of destination depots in the waste collection VRP with intermediate facilities," Transportation Research Part B: Methodological, Elsevier, vol. 84(C), pages 256-273.
    8. Edoardo Fadda & Luca Gobbato & Guido Perboli & Mariangela Rosano & Roberto Tadei, 2018. "Waste Collection in Urban Areas: A Case Study," Interfaces, INFORMS, vol. 48(4), pages 307-322, August.
    9. Gläser, Sina, 2022. "A waste collection problem with service type option," European Journal of Operational Research, Elsevier, vol. 303(3), pages 1216-1230.
    10. Tamás Bányai & Péter Tamás & Béla Illés & Živilė Stankevičiūtė & Ágota Bányai, 2019. "Optimization of Municipal Waste Collection Routing: Impact of Industry 4.0 Technologies on Environmental Awareness and Sustainability," IJERPH, MDPI, vol. 16(4), pages 1-26, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. le Blanc, H.M. & Cruijssen, F. & Fleuren, H.A. & de Koster, M.B.M., 2006. "Factory gate pricing: An analysis of the Dutch retail distribution," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1950-1967, November.
    2. Ann-Kathrin Rothenbächer, 2019. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Transportation Science, INFORMS, vol. 53(3), pages 850-866, May.
    3. Rodríguez-Martín, Inmaculada & Salazar-González, Juan-José & Yaman, Hande, 2019. "The periodic vehicle routing problem with driver consistency," European Journal of Operational Research, Elsevier, vol. 273(2), pages 575-584.
    4. Rodríguez-Martín, Inmaculada & Yaman, Hande, 2022. "Periodic Vehicle Routing Problem with Driver Consistency and service time optimization," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 468-484.
    5. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    6. Aksen, Deniz & Kaya, Onur & Sibel Salman, F. & Tüncel, Özge, 2014. "An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem," European Journal of Operational Research, Elsevier, vol. 239(2), pages 413-426.
    7. Cruijssen, F., 2006. "Horizontal cooperation in transport and logistics," Other publications TiSEM ab6dbe68-aebc-4b03-8eea-d, Tilburg University, School of Economics and Management.
    8. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    9. Roberto Baldacci & Enrico Bartolini & Aristide Mingozzi & Andrea Valletta, 2011. "An Exact Algorithm for the Period Routing Problem," Operations Research, INFORMS, vol. 59(1), pages 228-241, February.
    10. Nasr Al-Hinai & Chefi Triki, 2020. "A two-level evolutionary algorithm for solving the petrol station replenishment problem with periodicity constraints and service choice," Annals of Operations Research, Springer, vol. 286(1), pages 325-350, March.
    11. Glize, Estèle & Roberti, Roberto & Jozefowiez, Nicolas & Ngueveu, Sandra Ulrich, 2020. "Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems," European Journal of Operational Research, Elsevier, vol. 283(3), pages 812-824.
    12. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.
    13. Gläser, Sina & Stücken, Mareike, 2021. "Introduction of an underground waste container system–model and solution approaches," European Journal of Operational Research, Elsevier, vol. 295(2), pages 675-689.
    14. D Ronen & C A Goodhart, 2008. "Tactical store delivery planning," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1047-1054, August.
    15. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    16. Ferrer, Laia & Pastor, Rafael & García-Villoria, Alberto, 2009. "Designing salespeople's routes with multiple visits of customers: A case study," International Journal of Production Economics, Elsevier, vol. 119(1), pages 46-54, May.
    17. Chebbi, Olfa & Chaouachi, Jouhaina, 2016. "Reducing the wasted transportation capacity of Personal Rapid Transit systems: An integrated model and multi-objective optimization approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 236-258.
    18. Leonardo Berbotto & Sergio García & Francisco Nogales, 2014. "A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem," Annals of Operations Research, Springer, vol. 222(1), pages 153-173, November.
    19. Ann-Kathrin Rothenbächer, 2017. "Branch-and-Price-and-Cut for the Periodic Vehicle Routing Problem with Flexible Schedule Structures," Working Papers 1714, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    20. Baptista, Susana & Oliveira, Rui Carvalho & Zuquete, Eduardo, 2002. "A period vehicle routing case study," European Journal of Operational Research, Elsevier, vol. 139(2), pages 220-229, June.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:48:y:2014:i:1:p:103-120. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.