{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T04:18:01Z","timestamp":1760242681395,"version":"build-2065373602"},"reference-count":29,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2016,3,4]],"date-time":"2016-03-04T00:00:00Z","timestamp":1457049600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"the National Natural Science Foundation","award":["No.71390332-3"],"award-info":[{"award-number":["No.71390332-3"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>In this study, we combine the fuzzy customer information problem with the multicommodity multimodal routing with schedule-based services which was explored in our previous study [1]. The fuzzy characteristics of the customer information are embodied in the demanded volumes of the multiple commodities and the time windows of their due dates. When the schedule-based services are considered in the routing, schedule constraints emerge because the operations of block container trains should follow their predetermined schedules. This will restrict the routes selection from space-time feasibility. To solve this combinatorial optimization problem, we first build a fuzzy chance-constrained nonlinear programming model based on fuzzy possibility theory. We then use a crisp equivalent method and a linearization method to transform the proposed model into the classical linear programming model that can be effectively solved by the standard mathematical programming software. Finally, a numerical case is presented to demonstrate the feasibility of the proposed method. The sensitivity of the best solution with respect to the values of the confidence levels is also examined.<\/jats:p>","DOI":"10.3390\/info7010013","type":"journal-article","created":{"date-parts":[[2016,3,4]],"date-time":"2016-03-04T10:53:34Z","timestamp":1457088814000},"page":"13","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["On Solving the Fuzzy Customer Information Problem in Multicommodity Multimodal Routing with Schedule-Based Services"],"prefix":"10.3390","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4704-5578","authenticated-orcid":false,"given":"Yan","family":"Sun","sequence":"first","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"},{"name":"MOE Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong University, Beijing 100044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maoxiang","family":"Lang","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"},{"name":"MOE Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong University, Beijing 100044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaxi","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2016,3,4]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"406218","DOI":"10.1155\/2015\/406218","article-title":"Modeling the Multicommodity Multimodal Routing Problem with Schedule-Based Services and Carbon Dioxide Emission Costs","volume":"2015","author":"Sun","year":"2015","journal-title":"Math. Probl. Eng."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"714","DOI":"10.2174\/1874149501509010714","article-title":"Optimization Models and Solution Algorithms for Freight Routing Planning Problem in the Multi-modal Transportation Networks: A Review of the State-of-the-Art","volume":"9","author":"Sun","year":"2015","journal-title":"Open Civ. Eng. J."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.trd.2006.10.004","article-title":"Modelling the full costs of an intermodal and road freight transport network","volume":"12","author":"Janic","year":"2007","journal-title":"Transp. Res. Part D Transp. Environ."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.trd.2009.05.002","article-title":"Comparing carbon dioxide emissions of trucking and intermodal container transport in Taiwan","volume":"14","author":"Liao","year":"2009","journal-title":"Transp. Res. Part D Transp. Environ."},{"key":"ref_5","first-page":"6","article-title":"Introduction to multimodal transport in America and Canada","volume":"20","author":"Zhang","year":"2009","journal-title":"Containerization"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/0191-2607(91)90013-G","article-title":"International intermodal choices via chance-constrained goal programming","volume":"25","author":"Min","year":"1991","journal-title":"Transp. Res. Part A Gen."},{"key":"ref_7","first-page":"205","article-title":"Modeling intermodal routing","volume":"14","author":"Barnhart","year":"1993","journal-title":"J. Bus. Logist."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0360-8352(97)00100-9","article-title":"Computer assisted routing of intermodal shipments","volume":"33","author":"Boardman","year":"1997","journal-title":"Comput. Ind. Eng."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0965-8564(99)00056-7","article-title":"Shortest viable path algorithm in multimodal networks","volume":"35","author":"Lozano","year":"1997","journal-title":"Transp. Res. Part A Policy Pract."},{"key":"ref_10","unstructured":"Lam, S.K., and Srikanthan, T. (2002, January 3\u20136). Accelerating the K-Shortest Paths Computation in Multimodal Transportation Networks. Proceedings of the IEEE 5th International Conference on Intelligent Transportation Systems, Singapore, Singapore."},{"key":"ref_11","unstructured":"Boussedjra, M., Bloch, C., and Moudni, A.E.I. (2004, January 21\u201323). An exact method to find the intermodal shortest path (ISP). Proceedings of the 2004 IEEE International Conference on Networking, Sensing and Control, Taipei, Taiwan."},{"key":"ref_12","first-page":"114","article-title":"A multimode transportation network assignment model","volume":"24","author":"Zhang","year":"2004","journal-title":"J. China Railw. Soc."},{"key":"ref_13","first-page":"22","article-title":"Research on a Generalized Shortest Path Method of Optimizing Intermodal Transportation Problems","volume":"28","author":"Zhang","year":"2006","journal-title":"J. China Railw. Soc."},{"key":"ref_14","unstructured":"Reddy, V.R., and Kasilingam, R.G. Intermodal transportation considering transfer costs. Available online: http:\/\/d.wanfangdata.com.cn\/ExternalResource\/tdxb201110001%5E1."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.3155\/1047-3289.58.8.1004","article-title":"Assessing energy, environmental, and economic tradeoffs in intermodal freight transportation","volume":"58","author":"Winebrake","year":"2008","journal-title":"J. Air Waste Manag. Assoc."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1080\/03088830701849084","article-title":"Optimizing the transportation of international container cargoes in Korea","volume":"35","author":"Kim","year":"2008","journal-title":"Marit. Pol. Mgmt. Flagship J. Int. Ship. Port Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"99","DOI":"10.3141\/2166-12","article-title":"Optimization model for transportation of container cargoes considering short sea shipping and external cost: South Korean case","volume":"2166","author":"Chang","year":"2010","journal-title":"Transp. Res. Rec. J. Transp. Res. Board"},{"key":"ref_18","first-page":"1","article-title":"Study on optimization of dynamic paths of intermodal transportation network based on alternative set of transport modes","volume":"33","author":"Liu","year":"2011","journal-title":"J. China Railw. Soc."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10489-010-0223-6","article-title":"An intermodal transport network planning algorithm using dynamic programming-a case study: from Busan to Rotterdam in intermodal freight routing","volume":"36","author":"Cho","year":"2012","journal-title":"Appl. Intell."},{"key":"ref_20","first-page":"1195","article-title":"Bi-objective optimization for multi-modal transportation routing planning problem based on Pareto optimality","volume":"8","author":"Sun","year":"2015","journal-title":"J. Ind. Eng. Manag."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1007\/s10878-012-9574-8","article-title":"Best routes selection in multimodal networks using multi-objective genetic algorithm","volume":"28","author":"Xiong","year":"2014","journal-title":"J. Combin. Optim."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0165-0114(95)00276-6","article-title":"The fuzzy set theory approach to the vehicle routing problem when demand at nodes is uncertain","volume":"82","year":"1996","journal-title":"Fuzzy Sets Syst."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.cam.2009.02.015","article-title":"A hybrid differential evolution algorithm to vehicle routing problem with fuzzy demands","volume":"231","author":"Erbao","year":"2009","journal-title":"J. Comput. Appl. Math."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Castro, L.F., and Montoya-Torres, J.R. (2011, January 11\u201315). Vehicle routing with fuzzy time windows using a genetic algorithm. Proceedings of the 2011 IEEE Workshop on Computational Intelligence in Production And Logistics Systems, Paris, France.","DOI":"10.1109\/CIPLS.2011.5953356"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1287\/trsc.1090.0265","article-title":"A study of demand stochasticity in service network design","volume":"43","author":"Lium","year":"2009","journal-title":"Transp. Sci."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.trb.2013.11.001","article-title":"Stochastic service network design with rerouting","volume":"60","author":"Bai","year":"2014","journal-title":"Transp. Res. Part B Methodol."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/j.apm.2005.09.001","article-title":"New models for shortest path problem with fuzzy arc lengths","volume":"31","author":"Ji","year":"2007","journal-title":"Appl. Math. Model."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.asoc.2013.08.015","article-title":"A multi-objective dynamic vehicle routing problem with fuzzy time windows: Model, solution and application","volume":"14","author":"Ghannadpour","year":"2014","journal-title":"Appl. Soft Comput."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/S0165-0114(96)00236-9","article-title":"Chance constrained programming with fuzzy parameters","volume":"94","author":"Liu","year":"1998","journal-title":"Fuzzy Sets Syst."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/7\/1\/13\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T19:20:13Z","timestamp":1760210413000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/7\/1\/13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,4]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2016,3]]}},"alternative-id":["info7010013"],"URL":"https:\/\/doi.org\/10.3390\/info7010013","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2016,3,4]]}}}