{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T18:25:16Z","timestamp":1761675916200},"reference-count":7,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Math. Algorithm. Appl."],"published-print":{"date-parts":[[2011,12]]},"abstract":"<jats:p> Experts working for railway operators still have to devote much time and effort to creating plans for rolling stock allocation. In this paper, we formulate the railway rolling stock allocation problem as a set partitioning multi-commodity flow (SPMCF) problem and propose a search-based heuristic approach for SPMCF. We show that our approach can obtain an approximate solution near the optimum in shorter time than CPLEX for real-life problems. Since our approach deals with a wide variety of constraint expressions, it would be applicable to automatic development of practical plans for many railway operators. <\/jats:p>","DOI":"10.1142\/s1793830911001334","type":"journal-article","created":{"date-parts":[[2012,1,4]],"date-time":"2012-01-04T19:00:28Z","timestamp":1325703628000},"page":"443-456","source":"Crossref","is-referenced-by-count":3,"title":["A SEARCH-BASED APPROACH TO RAILWAY ROLLING STOCK ALLOCATION PROBLEMS"],"prefix":"10.1142","volume":"03","author":[{"given":"TOMOSHI","family":"OTSUKI","sequence":"first","affiliation":[{"name":"Toshiba Corporation, 1, Komukai-Toshiba-cho, Saiwai-ku, Kawasaki, 212-8582, Japan"}]},{"given":"HIDEYUKI","family":"AISU","sequence":"additional","affiliation":[{"name":"Toshiba Corporation, 1, Komukai-Toshiba-cho, Saiwai-ku, Kawasaki, 212-8582, Japan"}]},{"given":"TOSHIAKI","family":"TANAKA","sequence":"additional","affiliation":[{"name":"Toshiba Corporation, 1, Komukai-Toshiba-cho, Saiwai-ku, Kawasaki, 212-8582, Japan"}]}],"member":"219","published-online":{"date-parts":[[2012,4,5]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1030.0044"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.1060.0155"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.32.4.380"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.34.2.133.12308"},{"key":"rf6","first-page":"48","volume":"51","author":"Krishna C.","journal-title":"Networks"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.34.4.337.12316"},{"key":"rf8","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russell S.","year":"2003"}],"container-title":["Discrete Mathematics, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793830911001334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T01:40:37Z","timestamp":1565142037000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793830911001334"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":7,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2012,4,5]]},"published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1142\/S1793830911001334"],"URL":"https:\/\/doi.org\/10.1142\/s1793830911001334","relation":{},"ISSN":["1793-8309","1793-8317"],"issn-type":[{"value":"1793-8309","type":"print"},{"value":"1793-8317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12]]}}}