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

A customized genetic algorithm for bi-objective routing in a dynamic network

Author

Listed:
  • Maskooki, Alaleh
  • Deb, Kalyanmoy
  • Kallio, Markku

Abstract

The article presents a proposed customized genetic algorithm (CGA) to find the Pareto frontier for a bi-objective integer linear programming (ILP) model of routing in a dynamic network, where the number of nodes and edge weights vary over time. Utilizing a hybrid method, the CGA combines a genetic algorithm with dynamic programming (DP); it is a fast alternative to an ILP solver for finding efficient solutions, particularly for large dimensions. A non-dominated sorting genetic algorithm (NSGA-II) is used as a base multi-objective evolutionary algorithm. Real data are used for target trajectories, from a case study of application of a surveillance boat to measure greenhouse-gas emissions of ships on the Baltic sea. The CGA’s performance is evaluated in comparison to ILP solutions in terms of accuracy and computation efficiency. Results over multiple runs indicate convergence to the efficient frontier, with a considerable computation speed-up relative to the ILP solver. The study stays as a model for hybridizing evolutionary optimization and DP methods together in solving complex real-world problems.

Suggested Citation

  • Maskooki, Alaleh & Deb, Kalyanmoy & Kallio, Markku, 2022. "A customized genetic algorithm for bi-objective routing in a dynamic network," European Journal of Operational Research, Elsevier, vol. 297(2), pages 615-629.
    • Handle: RePEc:eee:ejores:v:297:y:2022:i:2:p:615-629
    DOI: 10.1016/j.ejor.2021.05.018
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037722172100432X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.05.018?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. Gilbert Laporte & François Louveaux & Hélène Mercure, 1992. "The Vehicle Routing Problem with Stochastic Travel Times," Transportation Science, INFORMS, vol. 26(3), pages 161-170, August.
    2. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    3. Archetti, C. & Feillet, D. & Mor, A. & Speranza, M.G., 2020. "Dynamic traveling salesman problem with stochastic release dates," European Journal of Operational Research, Elsevier, vol. 280(3), pages 832-844.
    4. Mathias A. Klapp & Alan L. Erera & Alejandro Toriello, 2018. "The One-Dimensional Dynamic Dispatch Waves Problem," Transportation Science, INFORMS, vol. 52(2), pages 402-415, March.
    5. Dimitris J. Bertsimas & Garrett van Ryzin, 1991. "A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane," Operations Research, INFORMS, vol. 39(4), pages 601-615, August.
    6. Bertsimas, Dimitris & Van Ryzin, Garrett., 1991. "A stochastic and dynamic vehicle routing problem in the Euclidean plane," Working papers 3286-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    7. Dimitris J. Bertsimas, 1992. "A Vehicle Routing Problem with Stochastic Demand," Operations Research, INFORMS, vol. 40(3), pages 574-585, June.
    8. Michael Hassoun & Shraga Shoval & Eran Simchon & Liron Yedidsion, 2020. "The single line moving target traveling salesman problem with release times," Annals of Operations Research, Springer, vol. 289(2), pages 449-458, June.
    9. Alejandro Toriello & William B. Haskell & Michael Poremba, 2014. "A Dynamic Traveling Salesman Problem with Stochastic Arc Costs," Operations Research, INFORMS, vol. 62(5), pages 1107-1125, October.
    10. Gao, Shangce & Wang, Yirui & Cheng, Jiujun & Inazumi, Yasuhiro & Tang, Zheng, 2016. "Ant colony optimization with clustering for solving the dynamic location routing problem," Applied Mathematics and Computation, Elsevier, vol. 285(C), pages 149-173.
    11. Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar, 2018. "The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 554-569, August.
    12. Patrick Jaillet, 1988. "A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited," Operations Research, INFORMS, vol. 36(6), pages 929-936, December.
    13. Richard Bellman, 1957. "On a Dynamic Programming Approach to the Caterer Problem--I," Management Science, INFORMS, vol. 3(3), pages 270-278, April.
    14. Haitao Xu & Pan Pu & Feng Duan, 2018. "Dynamic Vehicle Routing Problems with Enhanced Ant Colony Optimization," Discrete Dynamics in Nature and Society, Hindawi, vol. 2018, pages 1-13, February.
    15. Grob, Marcel J.H.B., 2006. "Routing of platforms in a maritime surface surveillance operation," European Journal of Operational Research, Elsevier, vol. 170(2), pages 613-628, April.
    16. Deb, Kalyanmoy & Myburgh, Christie, 2017. "A population-based fast algorithm for a billion-dimensional resource allocation problem with integer variables," European Journal of Operational Research, Elsevier, vol. 261(2), pages 460-474.
    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. He, Pengfei & Hao, Jin-Kao, 2023. "Memetic search for the minmax multiple traveling salesman problem with single and multiple depots," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1055-1070.
    2. Maskooki, Alaleh & Kallio, Markku, 2023. "A bi-criteria moving-target travelling salesman problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 271-285.
    3. Liu, Zongtuan & Dong, Gang & Gui, Yunmiao, 2023. "Data-driven emergency evacuation decision for cruise ports under COVID-19: An improved genetic algorithm and simulation," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 629(C).
    4. Granado, Igor & Hernando, Leticia & Uriondo, Zigor & Fernandes-Salvador, Jose A., 2024. "A fishing route optimization decision support system: The case of the tuna purse seiner," European Journal of Operational Research, Elsevier, vol. 312(2), pages 718-732.

    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. Maskooki, Alaleh & Kallio, Markku, 2023. "A bi-criteria moving-target travelling salesman problem under uncertainty," European Journal of Operational Research, Elsevier, vol. 309(1), pages 271-285.
    2. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    3. Mathias A. Klapp & Alan L. Erera & Alejandro Toriello, 2018. "The One-Dimensional Dynamic Dispatch Waves Problem," Transportation Science, INFORMS, vol. 52(2), pages 402-415, March.
    4. Alejandro Toriello & William B. Haskell & Michael Poremba, 2014. "A Dynamic Traveling Salesman Problem with Stochastic Arc Costs," Operations Research, INFORMS, vol. 62(5), pages 1107-1125, October.
    5. Roberto Tadei & Guido Perboli & Francesca Perfetti, 2017. "The multi-path Traveling Salesman Problem with stochastic travel costs," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 3-23, March.
    6. Soumia Ichoua & Michel Gendreau & Jean-Yves Potvin, 2006. "Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching," Transportation Science, INFORMS, vol. 40(2), pages 211-225, May.
    7. Nikola Mardešić & Tomislav Erdelić & Tonči Carić & Marko Đurasević, 2023. "Review of Stochastic Dynamic Vehicle Routing in the Evolving Urban Logistics Environment," Mathematics, MDPI, vol. 12(1), pages 1-44, December.
    8. Zhang, Jian & Luo, Kelin & Florio, Alexandre M. & Van Woensel, Tom, 2023. "Solving large-scale dynamic vehicle routing problems with stochastic requests," European Journal of Operational Research, Elsevier, vol. 306(2), pages 596-614.
    9. Vidal, Thibaut & Laporte, Gilbert & Matl, Piotr, 2020. "A concise guide to existing and emerging vehicle routing problem variants," European Journal of Operational Research, Elsevier, vol. 286(2), pages 401-416.
    10. Malmborg, Charles J., 1996. "A genetic algorithm for service level based vehicle scheduling," European Journal of Operational Research, Elsevier, vol. 93(1), pages 121-134, August.
    11. Barrett W. Thomas & Chelsea C. White, 2004. "Anticipatory Route Selection," Transportation Science, INFORMS, vol. 38(4), pages 473-487, November.
    12. Jian Yang & Patrick Jaillet & Hani Mahmassani, 2004. "Real-Time Multivehicle Truckload Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 38(2), pages 135-148, May.
    13. Alexandra Anderluh & Rune Larsen & Vera C. Hemmelmayr & Pamela C. Nolz, 2020. "Impact of travel time uncertainties on the solution cost of a two-echelon vehicle routing problem with synchronization," Flexible Services and Manufacturing Journal, Springer, vol. 32(4), pages 806-828, December.
    14. Russell W. Bent & Pascal Van Hentenryck, 2004. "Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers," Operations Research, INFORMS, vol. 52(6), pages 977-987, December.
    15. Langevin, André & Mbaraga, Pontien & Campbell, James F., 1996. "Continuous approximation models in freight distribution: An overview," Transportation Research Part B: Methodological, Elsevier, vol. 30(3), pages 163-188, June.
    16. Ji, Chenlu & Mandania, Rupal & Liu, Jiyin & Liret, Anne, 2022. "Scheduling on-site service deliveries to minimise the risk of missing appointment times," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    17. Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
    18. Papastavrou, Jason D., 1996. "A stochastic and dynamic routing policy using branching processes with state dependent immigration," European Journal of Operational Research, Elsevier, vol. 95(1), pages 167-177, November.
    19. Xian Cheng & Shaoyi Liao & Zhongsheng Hua, 2017. "A policy of picking up parcels for express courier service in dynamic environments," International Journal of Production Research, Taylor & Francis Journals, vol. 55(9), pages 2470-2488, May.
    20. Marlin W. Ulmer & Dirk C. Mattfeld & Felix Köster, 2018. "Budgeting Time for Dynamic Vehicle Routing with Stochastic Customer Requests," Transportation Science, INFORMS, vol. 52(1), pages 20-37, 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:eee:ejores:v:297:y:2022:i:2:p:615-629. 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.