IDEAS home Printed from https://ideas.repec.org/a/sae/envirb/v43y2016i4p663-680.html
   My bibliography  Save this article

MOGADOR revisited: Improving a genetic approach to multi-objective corridor search

Author

Listed:
  • Eric Daniel Fournier

Abstract

The MOGADOR algorithm is a specialized heuristic approach to the shortest path problem, which employs genetic operators to the search for near optimal corridors within the context of multiple independent objectives. This article expands upon the work contained in the MOGADOR algorithm’s debut publication by introducing a set of refined techniques for initializing the algorithm, which are responsive to the characteristics of the problem specification, the desired runtime, and the global quality of the output solution set. A core component of these techniques is the introduction of a novel process for constructing so-called pseudo-random walks that is based on the repetitive sampling of a dynamically parameterized bivariate-normal distribution. Guidance is provided regarding the appropriate parameterization of the proposed initialization procedure for a variety of problem contexts. The article concludes with a prospective treatment of different approaches to the parallelization of the algorithm’s various components and references an open source library containing the source code for the various new algorithms introduced.

Suggested Citation

  • Eric Daniel Fournier, 2016. "MOGADOR revisited: Improving a genetic approach to multi-objective corridor search," Environment and Planning B, , vol. 43(4), pages 663-680, July.
    • Handle: RePEc:sae:envirb:v:43:y:2016:i:4:p:663-680
    DOI: 10.1177/0265813515618562
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/0265813515618562
    Download Restriction: no
    File URL: https://libkey.io/10.1177/0265813515618562?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. Maria Scaparra & Richard Church & F. Medrano, 2014. "Corridor location: the multi-gateway shortest path model," Journal of Geographical Systems, Springer, vol. 16(3), pages 287-309, July.
    2. Stuart E. Dreyfus, 1969. "An Appraisal of Some Shortest-Path Algorithms," Operations Research, INFORMS, vol. 17(3), pages 395-412, June.
    Full references (including those not matched with items on IDEAS)

    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. Rolando Quintero & Esteban Mendiola & Giovanni Guzmán & Miguel Torres-Ruiz & Carlos Guzmán Sánchez-Mejorada, 2023. "Algorithm for the Accelerated Calculation of Conceptual Distances in Large Knowledge Graphs," Mathematics, MDPI, vol. 11(23), pages 1-30, November.
    2. Pijls, Wim & Post, Henk, 2009. "A new bidirectional search algorithm with shortened postprocessing," European Journal of Operational Research, Elsevier, vol. 198(2), pages 363-369, October.
    3. Xin Feng & Alan T. Murray, 2018. "Allocation using a heterogeneous space Voronoi diagram," Journal of Geographical Systems, Springer, vol. 20(3), pages 207-226, July.
    4. Steven K. Peterson & Richard L. Church, 2008. "A Framework for Modeling Rail Transport Vulnerability," Growth and Change, Wiley Blackwell, vol. 39(4), pages 617-641, December.
    5. Yang, Jinling & Chen, Zhiwei & Criado, Regino & Zhang, Shenggui, 2024. "A mathematical framework for shortest path length computation in multi-layer networks with inter-edge weighting and dynamic inter-edge weighting: The case of the Beijing bus network, China," Chaos, Solitons & Fractals, Elsevier, vol. 182(C).
    6. Delafield, Gemma & Smith, Greg S. & Day, Brett & Holland, Robert A. & Donnison, Caspar & Hastings, Astley & Taylor, Gail & Owen, Nathan & Lovett, Andrew, 2024. "Spatial context matters: Assessing how future renewable energy pathways will impact nature and society," Renewable Energy, Elsevier, vol. 220(C).
    7. Dimitri P. Bertsekas, 2019. "Robust shortest path planning and semicontractive dynamic programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(1), pages 15-37, February.
    8. Yueyue Fan & Yu Nie, 2006. "Optimal Routing for Maximizing the Travel Time Reliability," Networks and Spatial Economics, Springer, vol. 6(3), pages 333-344, September.
    9. Murray, Alan T., 2021. "Contemporary optimization application through geographic information systems," Omega, Elsevier, vol. 99(C).
    10. Azar Sadeghnejad-Barkousaraie & Rajan Batta & Moises Sudit, 2017. "Convoy movement problem: a civilian perspective," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 14-33, January.
    11. Irina S. Dolinskaya, 2012. "Optimal path finding in direction, location, and time dependent environments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(5), pages 325-339, August.
    12. Huang, He & Gao, Song, 2012. "Optimal paths in dynamic networks with dependent random link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 46(5), pages 579-598.
    13. Irina S. Dolinskaya & Marina A. Epelman & Esra Şişikoğlu Sir & Robert L. Smith, 2016. "Parameter-Free Sampled Fictitious Play for Solving Deterministic Dynamic Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 631-655, May.
    14. Ahuja, Ravindra & Orlin, James & Pallottino, Stefano & Scutella, Maria, 2003. "Dynamic Shortest Paths Minimizing Travel Times And Costs," Working papers 4390-02, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    15. Xin Feng & Shaohua Wang & Alan T Murray & Yuanpei Cao & Song Gao, 2021. "Multi-objective trajectory optimization in planning for sequential activities across space and through time," Environment and Planning B, , vol. 48(4), pages 945-963, May.
    16. C. Jacobs-Crisioni & C. C. Koopmans, 2016. "Transport link scanner: simulating geographic transport network expansion through individual investments," Journal of Geographical Systems, Springer, vol. 18(3), pages 265-301, July.
    17. Francesca Guerriero & Roberto Musmanno & Valerio Lacagnina & Antonio Pecorella, 2001. "A Class of Label-Correcting Methods for the K Shortest Paths Problem," Operations Research, INFORMS, vol. 49(3), pages 423-429, June.
    18. Hanif D. Sherali & Antoine G. Hobeika & Sasikul Kangwalklai, 2003. "Time-Dependent, Label-Constrained Shortest Path Problems with Applications," Transportation Science, INFORMS, vol. 37(3), pages 278-293, August.
    19. Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
    20. Daniel Selva & Bruce Cameron & Ed Crawley, 2016. "Patterns in System Architecture Decisions," Systems Engineering, John Wiley & Sons, vol. 19(6), pages 477-497, November.

    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:sae:envirb:v:43:y:2016:i:4:p:663-680. 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: SAGE Publications (email available below). General contact details of provider: .

    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.