IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v30y2018i2p361-370.html
   My bibliography  Save this article

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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    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. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. Bode, Claudia & Irnich, Stefan, 2014. "The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 415-426.
    9. Wilson, Duncan T. & Hawe, Glenn I. & Coates, Graham & Crouch, Roger S., 2013. "A multi-objective combinatorial model of casualty processing in major incident response," European Journal of Operational Research, Elsevier, vol. 230(3), pages 643-655.
    10. Hashemi Doulabi, Seyed Hossein & Seifi, Abbas, 2013. "Lower and upper bounds for location-arc routing problems with vehicle capacity constraints," European Journal of Operational Research, Elsevier, vol. 224(1), pages 189-208.
    11. Hu, Shao-Long & Han, Chuan-Feng & Meng, Ling-Peng, 2016. "Stochastic optimization for investment in facilities in emergency prevention," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 14-31.
    12. Florentin Gloetzl & Ernest Aigner, 2015. "Pluralism in the Market of Science? A citation network analysis of economic research at universities in Vienna," Ecological Economics Papers ieep5, Institute of Ecological Economics.
    13. Kamil Yilmaz, 2018. "Bank Volatility Connectedness in South East Asia," Koç University-TUSIAD Economic Research Forum Working Papers 1807, Koc University-TUSIAD Economic Research Forum.
    14. Costantini, Mauro & Maaitah, Ahmad & Mishra, Tapas & Sousa, Ricardo M., 2023. "Bitcoin market networks and cyberattacks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 630(C).
    15. Nassar S. Al-Nassar & Abdulrahman A. Albahouth, 2023. "Inflation Spillovers among Advanced and Emerging Economies: Evidence from the G20 Group," Economies, MDPI, vol. 11(4), pages 1-25, April.
    16. Arman Nedjati & Bela Vizvari & Gokhan Izbirak, 2016. "Post-earthquake response by small UAV helicopters," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 80(3), pages 1669-1688, February.
    17. Ángel Corberán & Elena Fernández & Carles Franquesa & José María Sanchis, 2011. "The Windy Clustered Prize-Collecting Arc-Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 317-334, August.
    18. Yan, Weiwei & Zhang, Yin, 2018. "Research universities on the ResearchGate social networking site: An examination of institutional differences, research activity level, and social networks formed," Journal of Informetrics, Elsevier, vol. 12(1), pages 385-400.
    19. Chu, Feng & Labadi, Nacima & Prins, Christian, 2006. "A Scatter Search for the periodic capacitated arc routing problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 586-605, March.
    20. Lin, Yen-Hung & Batta, Rajan & Rogerson, Peter A. & Blatt, Alan & Flanigan, Marie, 2011. "A logistics model for emergency supply of critical items in the aftermath of a disaster," Socio-Economic Planning Sciences, Elsevier, vol. 45(4), pages 132-145, December.

    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.