IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v30y2018i2p361-370.html

An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances

Author

Listed:
  • Oliver Lum

    (Department of Applied Mathematics and Scientific Computation, University of Maryland, College Park, Maryland 20742)

  • Bruce Golden

    (Robert H. Smith School of Business, University of Maryland, College Park, Maryland 20742)

  • Edward Wasil

    (Kogod School of Business, American University, Washington, DC 20016)

Abstract

Optimization algorithms and heuristic procedures for arc-routing problems often use benchmark instances to validate and demonstrate performance. Ideally, these benchmark instances capture the features of real-world street networks. Typically, benchmark instances are artificially generated and only approximate real-world networks. We develop a software tool that allows users to generate arc-routing instances directly from an open-source, user-driven map database. Our tool gives the user the ability to edit the instances by hand or by using configurable parameters. The instances generated by our tool can then be exported for use by researchers. In addition, our tool has a visualization capability that can produce images of routes overlaid on the instance.

Suggested Citation

  • Oliver Lum & Bruce Golden & Edward Wasil, 2018. "An Open-Source Desktop Application for Generating Arc-Routing Benchmark Instances," INFORMS Journal on Computing, INFORMS, vol. 30(2), pages 361-370, May.
    • Handle: RePEc:inm:orijoc:v:30:y:2018:i:2:p:361-370
    DOI: 10.1287/ijoc.2017.0785
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/ijoc.2017.0785
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2017.0785?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. Cabral, Edgar Alberto & Gendreau, Michel & Ghiani, Gianpaolo & Laporte, Gilbert, 2004. "Solving the hierarchical Chinese postman problem as a rural postman problem," European Journal of Operational Research, Elsevier, vol. 155(1), pages 44-50, May.
    2. Beullens, Patrick & Muyldermans, Luc & Cattrysse, Dirk & Van Oudheusden, Dirk, 2003. "A guided local search heuristic for the capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 147(3), pages 629-643, June.
    3. Constantino, Miguel & Gouveia, Luís & Mourão, Maria Cândida & Nunes, Ana Catarina, 2015. "The mixed capacitated arc routing problem with non-overlapping routes," European Journal of Operational Research, Elsevier, vol. 244(2), pages 445-456.
    4. Benavent, Enrique & Carrotta, Alessandro & Corberan, Angel & Sanchis, Jose M. & Vigo, Daniele, 2007. "Lower bounds and heuristics for the Windy Rural Postman Problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 855-869, January.
    5. Mathieu Jacomy & Tommaso Venturini & Sebastien Heymann & Mathieu Bastian, 2014. "ForceAtlas2, a Continuous Graph Layout Algorithm for Handy Network Visualization Designed for the Gephi Software," PLOS ONE, Public Library of Science, vol. 9(6), pages 1-12, June.
    6. Korteweg, Peter & Volgenant, Ton, 2006. "On the Hierarchical Chinese Postman Problem with linear ordered classes," European Journal of Operational Research, Elsevier, vol. 169(1), pages 41-52, February.
    7. Jotshi, Arun & Gong, Qiang & Batta, Rajan, 2009. "Dispatching and routing of emergency vehicles in disaster mitigation using data fusion," Socio-Economic Planning Sciences, Elsevier, vol. 43(1), pages 1-24, 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. Lan Peng & Chase Murray, 2022. "VeRoViz: A Vehicle Routing Visualization Toolkit," INFORMS Journal on Computing, INFORMS, vol. 34(4), pages 1842-1848, July.

    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. Enrico Bartolini & Jean-François Cordeau & Gilbert Laporte, 2013. "An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand," Operations Research, INFORMS, vol. 61(2), pages 315-327, April.
    2. Oliveira, Diogo F. & Martins, Miguel S.E. & Sousa, João M.C. & Vieira, Susana M. & Figueira, José Rui, 2025. "Divide-and-conquer initialization and mutation operators for the large-scale mixed Capacitated Arc Routing Problem," European Journal of Operational Research, Elsevier, vol. 321(2), pages 383-396.
    3. Merve Kayacı Çodur & Mustafa Yılmaz, 2020. "A time-dependent hierarchical Chinese postman problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 337-366, March.
    4. Marco Colombi & Ángel Corberán & Renata Mansini & Isaac Plana & José M. Sanchis, 2017. "The Hierarchical Mixed Rural Postman Problem," Transportation Science, INFORMS, vol. 51(2), pages 755-770, May.
    5. Jessica Rodríguez-Pereira & Gilbert Laporte, 2022. "The target visitation arc routing problem," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 30(1), pages 60-76, April.
    6. Nathalie Perrier & André Langevin & Ciro-Alberto Amaya, 2008. "Vehicle Routing for Urban Snow Plowing Operations," Transportation Science, INFORMS, vol. 42(1), pages 44-56, February.
    7. Colombi, Marco & Corberán, Ángel & Mansini, Renata & Plana, Isaac & Sanchis, José M., 2017. "The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 257(1), pages 1-12.
    8. Mert Demirer & Francis X. Diebold & Laura Liu & Kamil Yilmaz, 2018. "Estimating global bank network connectedness," Journal of Applied Econometrics, John Wiley & Sons, Ltd., vol. 33(1), pages 1-15, January.
    9. McLay, Laura A. & Boone, Edward L. & Brooks, J. Paul, 2012. "Analyzing the volume and nature of emergency medical calls during severe weather events using regression methodologies," Socio-Economic Planning Sciences, Elsevier, vol. 46(1), pages 55-66.
    10. Diego Pecin & Eduardo Uchoa, 2019. "Comparative Analysis of Capacitated Arc Routing Formulations for Designing a New Branch-Cut-and-Price Algorithm," Transportation Science, INFORMS, vol. 53(6), pages 1673-1694, November.
    11. Shuhei Nomura & Ryoma Kayano & Shinichi Egawa & Nahoko Harada & Yuichi Koido, 2021. "Expected Scopes of Health Emergency and Disaster Risk Management (Health EDRM): Report on the Expert Workshop at the Annual Conference for the Japanese Association for Disaster Medicine 2020," IJERPH, MDPI, vol. 18(9), pages 1-10, April.
    12. Thais Ávila & Ángel Corberán & Isaac Plana & José M. Sanchis, 2017. "Formulations and exact algorithms for the distance-constrained generalized directed rural postman problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 339-365, September.
    13. Vahdani, Behnam & Veysmoradi, D. & Mousavi, S.M. & Amiri, M., 2022. "Planning for relief distribution, victim evacuation, redistricting and service sharing under uncertainty," Socio-Economic Planning Sciences, Elsevier, vol. 80(C).
    14. Mara Maretti & Vanessa Russo & Emiliano Gobbo, 2021. "Open data governance: civic hacking movement, topics and opinions in digital space," Quality & Quantity: International Journal of Methodology, Springer, vol. 55(3), pages 1133-1154, June.
    15. A. Anaya-Arenas & J. Renaud & A. Ruiz, 2014. "Relief distribution networks: a systematic review," Annals of Operations Research, Springer, vol. 223(1), pages 53-79, December.
    16. Luis de-Marcos & Manuel Goyanes & Adrián Domínguez-Díaz, 2024. "Mapping science through editorial board interlocking: connections and distance between fields of knowledge and institutional affiliations," Scientometrics, Springer;Akadémiai Kiadó, vol. 129(6), pages 3385-3406, June.
    17. Bostanci, Gorkem & Yilmaz, Kamil, 2020. "How connected is the global sovereign credit risk network?," Journal of Banking & Finance, Elsevier, vol. 113(C).
    18. Duan, Zhengxiao & Zhang, Yanni & Deng, Jun & Shu, Pan & Yao, Di, 2023. "A systematic exploration of mapping knowledge domains for free radical research related to coal," Energy, Elsevier, vol. 282(C).
    19. Xiaoguang Bao & Xinhao Ni, 2024. "Approximation algorithms for two clustered arc routing problems," Journal of Combinatorial Optimization, Springer, vol. 47(5), pages 1-12, July.
    20. Caunhye, Aakil M. & Li, Mingzhe & Nie, Xiaofeng, 2015. "A location-allocation model for casualty response planning during catastrophic radiological incidents," Socio-Economic Planning Sciences, Elsevier, vol. 50(C), pages 32-44.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:orijoc:v:30:y:2018:i:2:p:361-370. 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.