IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v235y2015i1p371-39310.1007-s10479-015-1930-5.html
   My bibliography  Save this article

A heuristic method for solving the problem of partitioning graphs with supply and demand

Author

Listed:
  • Raka Jovanovic
  • Abdelkader Bousselham
  • Stefan Voß

Abstract

In this paper we present a greedy algorithm for solving the problem of the maximum partitioning of graphs with supply and demand (MPGSD). The goal of the method is to solve the MPGSD for large graphs in a reasonable time limit. This is done by using a two stage greedy algorithm, with two corresponding types of heuristics. The solutions acquired in this way are improved by applying a computationally inexpensive, hill climbing like, greedy correction procedure. In our numeric experiments we analyze different heuristic functions for each stage of the greedy algorithm, and show that their performance is highly dependent on the properties of the specific instance. Our tests show that by exploring a relatively small number of solutions generated by combining different heuristic functions, and applying the proposed correction procedure we can find solutions within only a few percent of the optimal ones. Copyright Springer Science+Business Media New York 2015

Suggested Citation

  • Raka Jovanovic & Abdelkader Bousselham & Stefan Voß, 2015. "A heuristic method for solving the problem of partitioning graphs with supply and demand," Annals of Operations Research, Springer, vol. 235(1), pages 371-393, December.
    • Handle: RePEc:spr:annopr:v:235:y:2015:i:1:p:371-393:10.1007/s10479-015-1930-5
    DOI: 10.1007/s10479-015-1930-5
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-015-1930-5
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10479-015-1930-5?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Philippe Galinier & Zied Boujbel & Michael Coutinho Fernandes, 2011. "An efficient memetic algorithm for the graph partitioning problem," Annals of Operations Research, Springer, vol. 191(1), pages 1-22, November.
    2. Scheuerer, Stephan & Wendolsky, Rolf, 2006. "A scatter search heuristic for the capacitated clustering problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 533-547, March.
    3. G. A. Croes, 1958. "A Method for Solving Traveling-Salesman Problems," Operations Research, INFORMS, vol. 6(6), pages 791-812, December.
    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. Raka Jovanovic & Abdelkader Bousselham & Stefan Voß, 2018. "Partitioning of supply/demand graphs with capacity limitations: an ant colony approach," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 224-249, January.

    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. 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.
    2. Pan-Li Zhang & Xiao-Bo Sun & Ji-Quan Wang & Hao-Hao Song & Jin-Ling Bei & Hong-Yu Zhang, 2022. "The Discrete Carnivorous Plant Algorithm with Similarity Elimination Applied to the Traveling Salesman Problem," Mathematics, MDPI, vol. 10(18), pages 1-34, September.
    3. Arthur Charpentier & Romuald Élie & Carl Remlinger, 2023. "Reinforcement Learning in Economics and Finance," Computational Economics, Springer;Society for Computational Economics, vol. 62(1), pages 425-462, June.
    4. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    5. Noureddine Bouhmala, 2019. "Combining simulated annealing with local search heuristic for MAX-SAT," Journal of Heuristics, Springer, vol. 25(1), pages 47-69, February.
    6. CASTRO, Marco & SÖRENSEN, Kenneth & VANSTEENWEGEN, Pieter & GOOS, Peter, 2012. "A simple GRASP+VND for the travelling salesperson problem with hotel selection," Working Papers 2012024, University of Antwerp, Faculty of Business and Economics.
    7. Eric Bonabeau & Florian Henaux & Sylvain Gu'erin & Dominique Snyers & Pascale Kuntz & Guy Theraulaz, 1998. "Routing in Telecommunications Networks with ``Smart'' Ant-Like Agents," Working Papers 98-01-003, Santa Fe Institute.
    8. Zachariadis, Emmanouil E. & Tarantilis, Christos D. & Kiranoudis, Christos T., 2009. "A Guided Tabu Search for the Vehicle Routing Problem with two-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 195(3), pages 729-743, June.
    9. Z P Fan & Y Chen & J Ma & S Zeng, 2011. "Erratum: A hybrid genetic algorithmic approach to the maximally diverse grouping problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1423-1430, July.
    10. Luc Muyldermans & Patrick Beullens & Dirk Cattrysse & Dirk Van Oudheusden, 2005. "Exploring Variants of 2-Opt and 3-Opt for the General Routing Problem," Operations Research, INFORMS, vol. 53(6), pages 982-995, December.
    11. Lin, Geng & Guan, Jian & Feng, Huibin, 2018. "An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 500(C), pages 199-209.
    12. Castillo, Cristian & Alvarez-Palau, Eduard J. & Calvet, Laura & Panadero, Javier & Viu-Roig, Marta & Serena-Latre, Anna & Juan, Angel A., 2024. "Home healthcare in Spanish rural areas: Applying vehicle routing algorithms to health transport management," Socio-Economic Planning Sciences, Elsevier, vol. 92(C).
    13. Böhnlein, Dominik & Schweiger, Katharina & Tuma, Axel, 2011. "Multi-agent-based transport planning in the newspaper industry," International Journal of Production Economics, Elsevier, vol. 131(1), pages 146-157, May.
    14. A. S. Santos & A. M. Madureira & M. L. R. Varela, 2018. "The Influence of Problem Specific Neighborhood Structures in Metaheuristics Performance," Journal of Mathematics, Hindawi, vol. 2018, pages 1-14, July.
    15. N. A. Arellano-Arriaga & J. Molina & S. E. Schaeffer & A. M. Álvarez-Socarrás & I. A. Martínez-Salazar, 2019. "A bi-objective study of the minimum latency problem," Journal of Heuristics, Springer, vol. 25(3), pages 431-454, June.
    16. Healy, Patrick & Moll, Robert, 1995. "A new extension of local search applied to the Dial-A-Ride Problem," European Journal of Operational Research, Elsevier, vol. 83(1), pages 83-104, May.
    17. Li Zhu & Yeming Gong & Yishui Xu & Jun Gu, 2019. "Emergency relief routing models for injured victims considering equity and priority," Annals of Operations Research, Springer, vol. 283(1), pages 1573-1606, December.
    18. Sandra Zajac, 2018. "On a two-phase solution approach for the bi-objective k-dissimilar vehicle routing problem," Journal of Heuristics, Springer, vol. 24(3), pages 515-550, June.
    19. Jose Carlos Molina & Ignacio Eguia & Jesus Racero, 2019. "Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 27(2), pages 253-287, July.
    20. Briseida Sarasola & Karl Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.

    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:spr:annopr:v:235:y:2015:i:1:p:371-393:10.1007/s10479-015-1930-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.