{"title":"Solving synchromodal container transportation problem using a genetic algorithm","authors":"Ananthakrishnan Vaikkathe, Abdelhamid Benaini, Jaouad Boukachour","doi":"10.1016/j.multra.2025.100229","DOIUrl":null,"url":null,"abstract":"<div><div>This paper proposes a Genetic Algorithm(GA) to solve the synchromodal transportation problem. The objective is to find a feasible transportation path for container transportation while minimizing travel duration and <span><math><mrow><mi>C</mi><msub><mi>O</mi><mn>2</mn></msub></mrow></math></span> emissions. The transportation network is modeled in a multigraph and a novel chromosome encoding method, that takes into account the parallel edges is proposed, along with the GA operators. The parameters of the GA are set using Taguchi analysis. The model is validated on instances based on the Seine Axis in France while considering three modes of transport: Barge, Train, and Truck as well as a benchmark instance. The GA finds optimal solutions for small instances and provides good enough solutions with a low deviation from the best-known solution in larger instances.</div></div>","PeriodicalId":100933,"journal":{"name":"Multimodal Transportation","volume":"4 4","pages":"Article 100229"},"PeriodicalIF":0.0000,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Multimodal Transportation","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2772586325000437","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
This paper proposes a Genetic Algorithm(GA) to solve the synchromodal transportation problem. The objective is to find a feasible transportation path for container transportation while minimizing travel duration and emissions. The transportation network is modeled in a multigraph and a novel chromosome encoding method, that takes into account the parallel edges is proposed, along with the GA operators. The parameters of the GA are set using Taguchi analysis. The model is validated on instances based on the Seine Axis in France while considering three modes of transport: Barge, Train, and Truck as well as a benchmark instance. The GA finds optimal solutions for small instances and provides good enough solutions with a low deviation from the best-known solution in larger instances.