IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v28y2014i3d10.1007_s10878-012-9574-8.html
   My bibliography  Save this article

Best routes selection in multimodal networks using multi-objective genetic algorithm

Author

Listed:
  • Guiwu Xiong

    (Chongqing Key Laboratory of Logistics, Chongqing University)

  • Yong Wang

    (Chongqing Key Laboratory of Logistics, Chongqing University)

Abstract

In this study, we propose a bi-level multi-objective Taguchi genetic algorithm for a multimodal routing problem with time windows. The mathematic model is constructed, which is featured by two optimal objectives, multiple available transportation manners and different demanded delivery times. After thoroughly analyzing the characteristics of the formulated model, a corresponding bi-level multi-objective Taguchi genetic algorithm is designed to find the Pareto-optimal front. At the upper level, a genetic multi-objective algorithm simultaneously searches the Pareto-optimal front and provides the most feasible routing path choices for the lower level. After generalizing the matrices of costs and time in a multimodal transportation network, the $$k$$ -shortest path algorithm is applied to providing some potential feasible paths. A multi-objective genetic algorithm is proposed at the lower level to determine the local optimal combination of transportation manners for these potential feasible paths. To make the genetic algorithm more robust, sounder and faster, the Taguchi (orthogonal) experimental design method is adopted in generating the initial population and the crossover operator. The case study shows that the proposed algorithm can effectively find the Pareto-optimal front solutions and offer series of transportation routes with best combinations of transportation manners. The shipper can easily select the required shipping schemes with specified demands.

Suggested Citation

  • Guiwu Xiong & Yong Wang, 2014. "Best routes selection in multimodal networks using multi-objective genetic algorithm," Journal of Combinatorial Optimization, Springer, vol. 28(3), pages 655-673, October.
    • Handle: RePEc:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-012-9574-8
    DOI: 10.1007/s10878-012-9574-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-012-9574-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-012-9574-8?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. Jean-Charles Créput & Amir Hajjam & Abderrafiaa Koukam & Olivier Kuhn, 2012. "Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 437-458, November.
    2. Niaz A. Wassan & A. Hameed Wassan & Gábor Nagy, 2008. "A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries," Journal of Combinatorial Optimization, Springer, vol. 15(4), pages 368-386, May.
    3. Guiwu Xiong & Yong Wang, 2010. "Research on job integration of multi-agent in multimodal transportation with time windows," International Journal of Services, Economics and Management, Inderscience Enterprises Ltd, vol. 2(3/4), pages 307-321.
    4. Wanpracha Chaovalitwongse & Dukwon Kim & Panos M. Pardalos, 2003. "GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows," Journal of Combinatorial Optimization, Springer, vol. 7(2), pages 179-207, June.
    5. R. Montemanni & L. M. Gambardella & A. E. Rizzoli & A. V. Donati, 2005. "Ant Colony System for a Dynamic Vehicle Routing Problem," Journal of Combinatorial Optimization, Springer, vol. 10(4), pages 327-343, December.
    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. Zhiguo Wang & Lufei Huang & Cici Xiao He, 2021. "A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design," Journal of Combinatorial Optimization, Springer, vol. 42(4), pages 785-812, November.
    2. Meiyan Li & Xiaoni Sun, 2022. "Path Optimization of Low-Carbon Container Multimodal Transport under Uncertain Conditions," Sustainability, MDPI, vol. 14(21), pages 1-17, October.
    3. Chunjiao Shao & Haiyan Wang & Meng Yu, 2022. "Multi-Objective Optimization of Customer-Centered Intermodal Freight Routing Problem Based on the Combination of DRSA and NSGA-III," Sustainability, MDPI, vol. 14(5), pages 1-25, March.
    4. Li, Zhaojin & Liu, Ya & Yang, Zhen, 2021. "An effective kernel search and dynamic programming hybrid heuristic for a multimodal transportation planning problem with order consolidation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    5. Xue Li & Zhengwen He & Nengmin Wang & Mario Vanhoucke, 2022. "Multimode time-cost-robustness trade-off project scheduling problem under uncertainty," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1173-1202, July.
    6. Majbah Uddin & Nathan Huynh, 2019. "Reliable Routing of Road-Rail Intermodal Freight under Uncertainty," Networks and Spatial Economics, Springer, vol. 19(3), pages 929-952, September.
    7. Yan Sun & Xinya Li & Xia Liang & Cevin Zhang, 2019. "A Bi-Objective Fuzzy Credibilistic Chance-Constrained Programming Approach for the Hazardous Materials Road-Rail Multimodal Routing Problem under Uncertainty and Sustainability," Sustainability, MDPI, vol. 11(9), pages 1-27, May.
    8. Zhiguo Wang & Lufei Huang & Cici Xiao He, 0. "A multi-objective and multi-period optimization model for urban healthcare waste’s reverse logistics network design," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-28.
    9. Dandan Chen & Yong Zhang & Liangpeng Gao & Russell G. Thompson, 2019. "Optimizing Multimodal Transportation Routes Considering Container Use," Sustainability, MDPI, vol. 11(19), pages 1-18, September.
    10. Yan Sun & Xinya Li, 2019. "Fuzzy Programming Approaches for Modeling a Customer-Centred Freight Routing Problem in the Road-Rail Intermodal Hub-and-Spoke Network with Fuzzy Soft Time Windows and Multiple Sources of Time Uncerta," Mathematics, MDPI, vol. 7(8), pages 1-40, August.
    11. Archetti, Claudia & Peirano, Lorenzo & Speranza, M. Grazia, 2022. "Optimization in multimodal freight transportation problems: A Survey," European Journal of Operational Research, Elsevier, vol. 299(1), pages 1-20.

    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. S. F. Ghannadpour & S. Noori & R. Tavakkoli-Moghaddam, 2014. "A multi-objective vehicle routing and scheduling problem with uncertainty in customers’ request and priority," Journal of Combinatorial Optimization, Springer, vol. 28(2), pages 414-446, August.
    2. Cristián E. Cortés & Doris Sáez & Alfredo Núñez & Diego Muñoz-Carpintero, 2009. "Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 43(1), pages 27-42, February.
    3. Mariusz Izdebski & Marianna Jacyna, 2021. "An Efficient Hybrid Algorithm for Energy Expenditure Estimation for Electric Vehicles in Urban Service Enterprises," Energies, MDPI, vol. 14(7), pages 1-23, April.
    4. Bian, Zheyong & Liu, Xiang & Bai, Yun, 2020. "Mechanism design for on-demand first-mile ridesharing," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 77-117.
    5. Zhang, Jian & Woensel, Tom Van, 2023. "Dynamic vehicle routing with random requests: A literature review," International Journal of Production Economics, Elsevier, vol. 256(C).
    6. Jie Zhang & Yifan Zhu & Tao Wang & Weiping Wang & Rui Wang & Xiaobo Li, 2022. "An Improved Intelligent Auction Mechanism for Emergency Material Delivery," Mathematics, MDPI, vol. 10(13), pages 1-30, June.
    7. Jean-Charles Créput & Amir Hajjam & Abderrafiaa Koukam & Olivier Kuhn, 2012. "Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 437-458, November.
    8. Angel Juan & Javier Faulin & Albert Ferrer & Helena Lourenço & Barry Barrios, 2013. "MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 109-132, April.
    9. Daqing Wu & Rong Yan & Hongtao Jin & Fengmao Cai, 2023. "An Adaptive Nutcracker Optimization Approach for Distribution of Fresh Agricultural Products with Dynamic Demands," Agriculture, MDPI, vol. 13(7), pages 1-21, July.
    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. Baris Yildiz & Martin Savelsbergh, 2019. "Provably High-Quality Solutions for the Meal Delivery Routing Problem," Transportation Science, INFORMS, vol. 53(5), pages 1372-1388, September.
    12. Sina Abolhoseini & Ali Asghar Alesheikh, 2021. "Dynamic routing with ant system and memory-based decision-making process," Environment Systems and Decisions, Springer, vol. 41(2), pages 198-211, June.
    13. Cheung, Bernard K.-S. & Choy, K.L. & Li, Chung-Lun & Shi, Wenzhong & Tang, Jian, 2008. "Dynamic routing model and solution methods for fleet management with mobile technologies," International Journal of Production Economics, Elsevier, vol. 113(2), pages 694-705, June.
    14. Wang, Zheng, 2018. "Delivering meals for multiple suppliers: Exclusive or sharing logistics service," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 496-512.
    15. Briseida Sarasola & Karl Doerner & Verena Schmid & Enrique Alba, 2016. "Variable neighborhood search for the stochastic and dynamic vehicle routing problem," Annals of Operations Research, Springer, vol. 236(2), pages 425-461, January.
    16. Vicky Mak & Andreas Ernst, 2007. "New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 66(1), pages 69-98, August.
    17. Henriette Koch & Andreas Bortfeldt & Gerhard Wäscher, 2017. "A hybrid solution approach for the 3L-VRP with simultaneous delivery and pickups," FEMM Working Papers 170005, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    18. Fröhlich von Elmbach, Alexander & Scholl, Armin & Walter, Rico, 2019. "Minimizing the maximal ergonomic burden in intra-hospital patient transportation," European Journal of Operational Research, Elsevier, vol. 276(3), pages 840-854.
    19. Mostafa Khatami & Seyed Hessameddin Zegordi, 2017. "Coordinative production and maintenance scheduling problem with flexible maintenance time intervals," Journal of Intelligent Manufacturing, Springer, vol. 28(4), pages 857-867, April.
    20. 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.

    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:spr:jcomop:v:28:y:2014:i:3:d:10.1007_s10878-012-9574-8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.