{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T21:11:29Z","timestamp":1777497089848,"version":"3.51.4"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031162442","type":"print"},{"value":"9783031162459","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16245-9_9","type":"book-chapter","created":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T10:03:06Z","timestamp":1662631386000},"page":"114-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A K-Prototype Clustering Assisted Hybrid Heuristic Approach for\u00a0Train Unit Scheduling"],"prefix":"10.1007","author":[{"given":"Pedro J.","family":"Copado-M\u00e9ndez","sequence":"first","affiliation":[]},{"given":"Zhiyuan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Eva","family":"Barrena","sequence":"additional","affiliation":[]},{"given":"Raymond S. K.","family":"Kwan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,5]]},"reference":[{"key":"9_CR1","unstructured":"Kmodes. https:\/\/pypi.org\/project\/kmodes\/"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"31883","DOI":"10.1109\/ACCESS.2019.2903568","volume":"7","author":"A Ahmad","year":"2019","unstructured":"Ahmad, A., Khan, S.S.: Survey of state-of-the-art mixed data clustering algorithms. IEEE Access 7, 31883\u201331902 (2019)","journal-title":"IEEE Access"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Akbay, M., Blum, C.: Application of CMSA to the minimum positive influence dominating set problem, vol. 339, pp. 17\u201326 (2021)","DOI":"10.3233\/FAIA210112"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/trsc.1060.0155","volume":"40","author":"A Alfieri","year":"2006","unstructured":"Alfieri, A., Groot, R., Kroon, L., Schrijver, A.: Efficient circulation of railway rolling stock. Transp. Sci. 40(3), 378\u2013391 (2006)","journal-title":"Transp. Sci."},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10732-017-9329-x","volume":"24","author":"C Blum","year":"2017","unstructured":"Blum, C., Blesa, M.J.: A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. J. Heuristics 24(3), 551\u2013579 (2017). https:\/\/doi.org\/10.1007\/s10732-017-9329-x","journal-title":"J. Heuristics"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","volume":"68","author":"C Blum","year":"2016","unstructured":"Blum, C., Pinacho, P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Lozano, J.A.: Construct, merge, solve and adapt a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75\u201388 (2016)","journal-title":"Comput. Oper. Res."},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: Solving a real-world train-unit assignment problem. Math. Program. 124(1\u20132), 207\u2013231 (2010)","DOI":"10.1007\/s10107-010-0361-y"},{"issue":"1","key":"9_CR8","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1016\/j.orl.2012.11.007","volume":"41","author":"V Cacchiani","year":"2013","unstructured":"Cacchiani, V., Caprara, A., Mar\u00f3ti, G., Toth, P.: On integer polytopes with few nonzero vertices. Oper. Res. Lett. 41(1), 74\u201377 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"9_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.trb.2009.07.007","volume":"44","author":"V Cacchiani","year":"2010","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: Scheduling extra freight trains on railway networks. Transp. Res. Part B Methodol. 44(2), 215\u2013231 (2010)","journal-title":"Transp. Res. Part B Methodol."},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Cao, F., Liang, J., Bai, L.: A new initialization method for categorical data clustering. Expert Syst. Appl. 36, 10223\u201310228 (2009)","DOI":"10.1016\/j.eswa.2009.01.060"},{"key":"9_CR11","doi-asserted-by":"publisher","unstructured":"Christian Blum, G.R.: Hybrid Metaheuristics: Powerful Tools for Optimization. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30883-8","DOI":"10.1007\/978-3-319-30883-8"},{"key":"9_CR12","unstructured":"Copado-Mendez, P., Lin, Z., Kwan, R.: Size limited iterative method: a hybridized heuristic for train unit scheduling optimization. In: CASPT 2018 (2017)"},{"key":"9_CR13","unstructured":"Copado-Mendez, P., Lin, Z., Kwan, R.: Size limited iterative method (slim) for train unit scheduling (2017)"},{"key":"9_CR14","unstructured":"Copado-Mendez, P.J., Lin, Z., Kwan, R.S.K.: Train units scheduling optimization (2018). http:\/\/archive.researchdata.leeds.ac.uk\/id\/eprint\/537"},{"key":"9_CR15","unstructured":"Copado-Mendez, P.J., Lin, Z., Kwan, R.S.: Size limited iterative method (SLIM) for train unit scheduling. In: Proceedings of the 12th Metaheuristics International Conference, Barcelona, Spain (2017). Leeds (2017)"},{"key":"9_CR16","unstructured":"Copado-Mendez, P., Lin, Z., Kwan, R.: Size limited iterative method (SLIM) for train unit scheduling. In: Proceedings of the 12th Metaheuristics International Conference, Barcelona, Spain (2017)"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., Lubbecke, M.: A Primer in Column Generation, pp. 1\u201332, March 2006","DOI":"10.1007\/0-387-25486-2_1"},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10732-020-09450-0","volume":"27","author":"N Dupin","year":"2021","unstructured":"Dupin, N., Talbi, E.G.: Matheuristics to optimize refueling and maintenance planning of nuclear power plants. J. Heuristics 27, 63\u2013105 (2021)","journal-title":"J. Heuristics"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Ferrer, J., Chicano, F., Ortega-Toro, J.: Cmsa algorithm for solving the prioritized pairwise test data generation problem in software product lines. J. Heuristics 27, 1\u201321 (2021)","DOI":"10.1007\/s10732-020-09462-w"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Fioole, P.J., Kroon, L., Mar\u00f3ti, G., Schrijver, A.: A rolling stock circulation model for combining and splitting of passenger trains. Eur. J. Oper. Res. 174, 1281\u20131297 (2006)","DOI":"10.1016\/j.ejor.2005.03.032"},{"key":"9_CR21","unstructured":"Huang, Z.: Clustering large data sets with mixed numeric and categorical values. In: The First Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 21\u201334 (1997)"},{"issue":"3","key":"9_CR22","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1009769707641","volume":"2","author":"Z Huang","year":"1998","unstructured":"Huang, Z.: Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Min. Knowl. Disc. 2(3), 283\u2013304 (1998)","journal-title":"Data Min. Knowl. Disc."},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"04021022","DOI":"10.1061\/(ASCE)ME.1943-5479.0000910","volume":"37","author":"A Karimzadeh","year":"2021","unstructured":"Karimzadeh, A., Sabeti, S., Shoghli, O.: Optimal clustering of pavement segments using k-prototype algorithm in a high-dimensional mixed feature space. J. Manag. Eng. 37(4), 04021022 (2021)","journal-title":"J. Manag. Eng."},{"key":"9_CR24","unstructured":"Koelbel, C.H., Loveman, D.B., Schreiber, R.S., Steele, G.L., Zosel, M.E.: Using MPI-2 PVM: parallel virtual machine-a users\u2019 guide and tutorial for network parallel computing. Schauble, C.J.C., Domik, G. (eds.) Unstructured Scientific Computation on Scalable Multiprocessors (1991)"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Kwan, R.: Case studies of successful train crew scheduling optimisation. J. Sched. 14, 423\u2013434 (2011)","DOI":"10.1007\/s10951-010-0212-y"},{"key":"9_CR26","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10479-007-0203-3","volume":"155","author":"R Kwan","year":"2007","unstructured":"Kwan, R., Kwan, A.: Effective search space control for large and\/or complex driver scheduling problems. Ann. Oper. Res. 155, 417\u2013435 (2007)","journal-title":"Ann. Oper. Res."},{"key":"9_CR27","doi-asserted-by":"publisher","first-page":"108568","DOI":"10.1016\/j.envres.2019.108568","volume":"176","author":"C Li","year":"2019","unstructured":"Li, C., et al.: Identification and analysis of vulnerable populations for malaria based on k-prototypes clustering. Environ. Res. 176, 108568 (2019)","journal-title":"Environ. Res."},{"key":"9_CR28","doi-asserted-by":"publisher","unstructured":"Li, L., Kwan, R., Lin, Z., Pedro J Copado-Mendez, P.: Resolution of coupling order and station level constraints in train unit scheduling. Public Transp. 14, 27\u201361 (2022). https:\/\/doi.org\/10.1007\/s12469-022-00295-3","DOI":"10.1007\/s12469-022-00295-3"},{"key":"9_CR29","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.endm.2013.05.089","volume":"41","author":"Z Lin","year":"2013","unstructured":"Lin, Z., Kwan, R.S.K.: An integer fixed-charge multicommodity flow (FCMF) model for train unit scheduling. Electron. Notes Discrete Math. 41, 165\u2013172 (2013)","journal-title":"Electron. Notes Discrete Math."},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Lin, Z., Barrena, E., Kwan, R.S.K.: Train unit scheduling guided by historic capacity provisions and passenger count surveys. Public Transp. 9(1-2), 137\u2013154 (2017)","DOI":"10.1007\/s12469-016-0138-7"},{"issue":"1","key":"9_CR31","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s12469-013-0073-9","volume":"6","author":"Z Lin","year":"2014","unstructured":"Lin, Z., Kwan, R.S.K.: A two-phase approach for real-world train unit scheduling. Public Transp. 6(1), 35\u201365 (2014)","journal-title":"Public Transp."},{"issue":"3","key":"9_CR32","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1007\/s10589-016-9831-3","volume":"64","author":"Z Lin","year":"2016","unstructured":"Lin, Z., Kwan, R.S.K.: Local convex hulls for a special class of integer multicommodity flow problems. Comput. Optim. Appl. 64(3), 881\u2013919 (2016). https:\/\/doi.org\/10.1007\/s10589-016-9831-3","journal-title":"Comput. Optim. Appl."},{"key":"9_CR33","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.trb.2016.09.007","volume":"94","author":"Z Lin","year":"2016","unstructured":"Lin, Z., Kwan, R.S.: A branch-and-price approach for solving the train unit scheduling problem. Transp. Res. Part B Methodol. 94, 97\u2013120 (2016)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"2","key":"9_CR34","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theor. 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"9_CR35","unstructured":"Macqueen, J.: Some methods for classification and analysis of multivariate observations. In: In 5-th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281\u2013297 (1967)"},{"key":"9_CR36","unstructured":"Mar\u00f3ti, G., Gerards, A.M.H., Kroon, L.G., Eindhoven, T.: Operations research models for railway rolling stock planning (2006)"},{"key":"9_CR37","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1016\/j.cor.2006.03.019","volume":"35","author":"M Peeters","year":"2008","unstructured":"Peeters, M., Kroon, L.: Circulation of railway rolling stock: a branch-and-price approach. Comput. & OR. 35, 538\u2013556 (2008)","journal-title":"Comput. & OR."},{"issue":"1","key":"9_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-021-83340-8","volume":"11","author":"G Preud\u2019homme","year":"2021","unstructured":"Preud\u2019homme, G., et al.: Head-to-head comparison of clustering methods for heterogeneous data: a simulation-driven benchmark. Sci. Rep. 11(1), 1\u201314 (2021)","journal-title":"Sci. Rep."},{"key":"9_CR39","first-page":"205","volume":"6","author":"A Schrijver","year":"1993","unstructured":"Schrijver, A.: Minimum circulation of railway stock. CWI Q. 6, 205\u2013217 (1993)","journal-title":"CWI Q."},{"key":"9_CR40","first-page":"1475","volume":"3","author":"K Srikanth","year":"2014","unstructured":"Srikanth, K., Reddy, S.R., Swathi, T.: A novel supervised machine learning algorithm for intrusion detection: K-prototype+id3. Int. J. Eng. Res. Technol. 3, 1475\u20131480 (2014)","journal-title":"Int. J. Eng. Res. Technol."},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Talbi, E.G.: A taxonomy of hybrid metaheuristics. J. Heuristics 8, 541\u2013564 (2002)","DOI":"10.1023\/A:1016540724870"}],"container-title":["Communications in Computer and Information Science","Dependable Computing \u2013 EDCC 2022 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16245-9_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T10:09:43Z","timestamp":1662631783000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16245-9_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031162442","9783031162459"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16245-9_9","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"5 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EDCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Dependable Computing Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zaragoza","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"edcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/webdiis.unizar.es\/EDCC22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}