IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v292y2021i3p818-829.html
   My bibliography  Save this article

The multiple shortest path problem with path deconfliction

Author

Listed:
  • Hughes, Michael S.
  • Lunday, Brian J.
  • Weir, Jeffrey D.
  • Hopkinson, Kenneth M.

Abstract

To address the increasingly relevant challenge of routing autonomous agents within contested environments, this research formulates and examines the Multiple Shortest Path Problem with Path Deconfliction (MSPP-PD) to balance agent routing efficiency with group vulnerability. Within the general model formulation, multiple agents are routed between respective source and terminus nodes while minimizing both the total distance travelled and a measure of path conflict, where path conflict occurs for any instance of more than one agent traversing an arc and/or node. Within this modeling structure, this research presents and inspects a set of alternative, conceptually-motivated penalty metrics to inhibit path conflict between agents. Illustrative testing demonstrates the distinguishability of different MSPP-PD variants as they relate to optimal agent routing solutions, as well as the non-dominated solutions attainable via different relative priorities over the objective functions. Subsequent empirical testing over a set of synthetic instances demonstrates the effect of different penalty function metrics on both optimal solutions and the computational effort required to identify them. Concluding the work are recommendations about the utility of the MSPP-PD model variants, both individually and collectively.

Suggested Citation

  • Hughes, Michael S. & Lunday, Brian J. & Weir, Jeffrey D. & Hopkinson, Kenneth M., 2021. "The multiple shortest path problem with path deconfliction," European Journal of Operational Research, Elsevier, vol. 292(3), pages 818-829.
  • Handle: RePEc:eee:ejores:v:292:y:2021:i:3:p:818-829
    DOI: 10.1016/j.ejor.2020.11.033
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221720309796
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2020.11.033?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. Kulkarni, R. V. & Bhave, P. R., 1985. "Integer programming formulations of vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 20(1), pages 58-67, April.
    2. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    3. Lehuédé, Fabien & Péton, Olivier & Tricoire, Fabien, 2020. "A lexicographic minimax approach to the vehicle routing problem with route balancing," European Journal of Operational Research, Elsevier, vol. 282(1), pages 129-147.
    4. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    5. Kerbache, Laoucine & Smith, J. MacGregor, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," European Journal of Operational Research, Elsevier, vol. 121(1), pages 105-123, February.
    6. Stuart E. Dreyfus, 1969. "An Appraisal of Some Shortest-Path Algorithms," Operations Research, INFORMS, vol. 17(3), pages 395-412, June.
    7. Merrill M. Flood, 1956. "The Traveling-Salesman Problem," Operations Research, INFORMS, vol. 4(1), pages 61-75, February.
    8. Olaf Jahn & Rolf H. Möhring & Andreas S. Schulz & Nicolás E. Stier-Moses, 2005. "System-Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion," Operations Research, INFORMS, vol. 53(4), pages 600-616, August.
    9. Talarico, Luca & Sörensen, Kenneth & Springael, Johan, 2015. "Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(2), pages 457-470.
    10. Garcia-Martinez, C. & Cordon, O. & Herrera, F., 2007. "A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP," European Journal of Operational Research, Elsevier, vol. 180(1), pages 116-148, July.
    11. F. Benjamin Zhan & Charles E. Noon, 1998. "Shortest Path Algorithms: An Evaluation Using Real Road Networks," Transportation Science, INFORMS, vol. 32(1), pages 65-73, February.
    12. Potvin, Jean-Yves & Rousseau, Jean-Marc, 1993. "A parallel route building algorithm for the vehicle routing and scheduling problem with time windows," European Journal of Operational Research, Elsevier, vol. 66(3), pages 331-340, May.
    13. Talarico, L. & Sörensen, K. & Springael, J., 2015. "The k-dissimilar vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 244(1), pages 129-140.
    14. Dial, Robert B., 1979. "A model and algorithm for multicriteria route-mode choice," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 311-316, December.
    15. B J Lunday & H D Sherali, 2012. "Minimizing the maximum network flow: models and algorithms with resource synergy considerations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(12), pages 1693-1707, December.
    16. Kara, Imdat & Laporte, Gilbert & Bektas, Tolga, 2004. "A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for the capacitated vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 158(3), pages 793-795, November.
    17. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    18. Theys, Christophe & Bräysy, Olli & Dullaert, Wout & Raa, Birger, 2010. "Using a TSP heuristic for routing order pickers in warehouses," European Journal of Operational Research, Elsevier, vol. 200(3), pages 755-763, February.
    19. Van Breedam, Alex, 1995. "Improvement heuristics for the Vehicle Routing Problem based on simulated annealing," European Journal of Operational Research, Elsevier, vol. 86(3), pages 480-490, November.
    20. Modesti, Paola & Sciomachen, Anna, 1998. "A utility measure for finding multiobjective shortest paths in urban multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 111(3), pages 495-508, December.
    21. Laoucine Kerbache & J. Macgregor Smith, 2000. "Multi-objective routing within large scale facilities using open finite queueing networks," Post-Print hal-00798811, HAL.
    22. Matthias Ehrgott, 2005. "Multicriteria Optimization," Springer Books, Springer, edition 0, number 978-3-540-27659-3, January.
    23. George B. Dantzig, 1960. "On the Shortest Route Through a Network," Management Science, INFORMS, vol. 6(2), pages 187-190, January.
    24. Wang, Zutong & Guo, Jiansheng & Zheng, Mingfa & Wang, Ying, 2015. "Uncertain multiobjective traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 241(2), pages 478-489.
    25. Laporte, Gilbert, 1992. "The vehicle routing problem: An overview of exact and approximate algorithms," European Journal of Operational Research, Elsevier, vol. 59(3), pages 345-358, June.
    26. Paessens, H., 1988. "The savings algorithm for the vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 34(3), pages 336-344, March.
    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. Allahyari, Somayeh & Salari, Majid & Vigo, Daniele, 2015. "A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 242(3), pages 756-768.
    2. Baals, Julian & Emde, Simon & Turkensteen, Marcel, 2023. "Minimizing earliness-tardiness costs in supplier networks—A just-in-time truck routing problem," European Journal of Operational Research, Elsevier, vol. 306(2), pages 707-741.
    3. 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.
    4. Luigi Di Puglia Pugliese & Francesca Guerriero, 2016. "On the shortest path problem with negative cost cycles," Computational Optimization and Applications, Springer, vol. 63(2), pages 559-583, March.
    5. Van Breedam, Alex, 2002. "A parametric analysis of heuristics for the vehicle routing problem with side-constraints," European Journal of Operational Research, Elsevier, vol. 137(2), pages 348-370, March.
    6. Ioannou, Petros & Giuliano, Genevieve & Dessouky, Maged & Chen, Pengfei & Dexter, Sue, 2020. "Freight Load Balancing and Efficiencies in Alternative Fuel Freight Modes," Institute of Transportation Studies, Working Paper Series qt3ns4b894, Institute of Transportation Studies, UC Davis.
    7. Groß, Patrick-Oliver & Ehmke, Jan Fabian & Mattfeld, Dirk Christian, 2020. "Interval travel times for robust synchronization in city logistics vehicle routing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    8. Ioannou, Petros & Chen, Pengfei, 2023. "Centrally Coordinated Schedules and Routes of Airport Shuttles with LAX Terminals as Application Area," Institute of Transportation Studies, Working Paper Series qt6gg7r6c5, Institute of Transportation Studies, UC Davis.
    9. Allahyari, Somayeh & Yaghoubi, Saeed & Van Woensel, Tom, 2021. "A novel risk perspective on location-routing planning: An application in cash transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    10. Yunyue He & Zhong Liu & Jianmai Shi & Yishan Wang & Jiaming Zhang & Jinyuan Liu, 2015. "K-Shortest-Path-Based Evacuation Routing with Police Resource Allocation in City Transportation Networks," PLOS ONE, Public Library of Science, vol. 10(7), pages 1-23, July.
    11. Opasanon, Sathaporn & Miller-Hooks, Elise, 2006. "Multicriteria adaptive paths in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 173(1), pages 72-91, August.
    12. Curtin, Kevin M. & Biba, Steve, 2011. "The Transit Route Arc-Node Service Maximization problem," European Journal of Operational Research, Elsevier, vol. 208(1), pages 46-56, January.
    13. Çetinkaya, Cihan & Karaoglan, Ismail & Gökçen, Hadi, 2013. "Two-stage vehicle routing problem with arc time windows: A mixed integer programming formulation and a heuristic approach," European Journal of Operational Research, Elsevier, vol. 230(3), pages 539-550.
    14. Liu, Ran & Jiang, Zhibin, 2012. "The close–open mixed vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 220(2), pages 349-360.
    15. Agarwal, Y.K. & Aneja, Y.P. & Jayaswal, Sachin, 2022. "Directed fixed charge multicommodity network design: A cutting plane approach using polar duality," European Journal of Operational Research, Elsevier, vol. 299(1), pages 118-136.
    16. Pradhananga, Rojee & Taniguchi, Eiichi & Yamada, Tadashi & Qureshi, Ali Gul, 2014. "Bi-objective decision support system for routing and scheduling of hazardous materials," Socio-Economic Planning Sciences, Elsevier, vol. 48(2), pages 135-148.
    17. Chen, Shih-Pin, 2004. "Parametric nonlinear programming for analyzing fuzzy queues with finite capacity," European Journal of Operational Research, Elsevier, vol. 157(2), pages 429-438, September.
    18. Wu, Kan & McGinnis, Leon, 2012. "Performance evaluation for general queueing networks in manufacturing systems: Characterizing the trade-off between queue time and utilization," European Journal of Operational Research, Elsevier, vol. 221(2), pages 328-339.
    19. Eduardo Lalla-Ruiz & Christopher Expósito-Izquierdo & Shervin Taheripour & Stefan Voß, 2016. "An improved formulation for the multi-depot open vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 38(1), pages 175-187, January.
    20. Chen, Shih-Pin, 2007. "Solving fuzzy queueing decision problems via a parametric mixed integer nonlinear programming method," European Journal of Operational Research, Elsevier, vol. 177(1), pages 445-457, February.

    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:eee:ejores:v:292:y:2021:i:3:p:818-829. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.