{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T22:41:13Z","timestamp":1772318473942,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319687582","type":"print"},{"value":"9783319687599","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-68759-9_79","type":"book-chapter","created":{"date-parts":[[2017,10,12]],"date-time":"2017-10-12T22:33:42Z","timestamp":1507847622000},"page":"960-971","source":"Crossref","is-referenced-by-count":17,"title":["A New Precedence-Based Ant Colony Optimization for Permutation Problems"],"prefix":"10.1007","author":[{"given":"Marco","family":"Baioletti","sequence":"first","affiliation":[]},{"given":"Alfredo","family":"Milani","sequence":"additional","affiliation":[]},{"given":"Valentino","family":"Santucci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,14]]},"reference":[{"key":"79_CR1","doi-asserted-by":"publisher","unstructured":"Baioletti, M., Milani, A., Santucci, V.: Algebraic particle swarm optimization for the permutations search space. In: Proceedings of IEEE Congress on Evolutionary Computation CEC 2017, pp. 1587\u20131594 (2017). doi: 10.1109\/CEC.2017.7969492","DOI":"10.1109\/CEC.2017.7969492"},{"key":"79_CR2","doi-asserted-by":"publisher","unstructured":"Baioletti, M., Milani, A., Santucci, V.: Linear ordering optimization with a combinatorial differential evolution. In: Proceedings of 2015 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2015, pp. 2135\u20132140 (2015). doi: 10.1109\/SMC.2015.373","DOI":"10.1109\/SMC.2015.373"},{"key":"79_CR3","doi-asserted-by":"publisher","unstructured":"Baioletti, M., Milani, A., Santucci, V.: A discrete differential evolution algorithm for multi-objective permutation flowshop scheduling. Intelligenza Artificiale 10(2), 81\u201395 (2016). doi: 10.3233\/IA-160097","DOI":"10.3233\/IA-160097"},{"key":"79_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-319-45823-6_12","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIV","author":"M Baioletti","year":"2016","unstructured":"Baioletti, M., Milani, A., Santucci, V.: An extension of algebraic differential evolution for the linear ordering problem with cumulative costs. In: Handl, J., Hart, E., Lewis, P.R., L\u00f3pez-Ib\u00e1\u00f1ez, M., Ochoa, G., Paechter, B. (eds.) PPSN 2016. LNCS, vol. 9921, pp. 123\u2013133. Springer, Cham (2016). doi: 10.1007\/978-3-319-45823-6_12"},{"key":"79_CR5","doi-asserted-by":"crossref","unstructured":"Blum, C., Sampels, M.: Ant colony optimization for FOP shop scheduling: a case study on different pheromone representations. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, vol. 2, pp. 1558\u20131563 (2002)","DOI":"10.1109\/CEC.2002.1004474"},{"key":"79_CR6","doi-asserted-by":"crossref","unstructured":"Chira, C., Pintea, C.M., Crisan, G.C., Dumitrescu, D.: Solving the linear ordering problem using ant models. In: Proceedings of GECCO 2009, pp. 1803\u20131804 (2009)","DOI":"10.1145\/1569901.1570170"},{"issue":"4","key":"79_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M., St\u00fctzle, T.: Ant colony optimization. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"1","key":"79_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans. Evol. Comput. 1(1), 53\u201366 (1997)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"1","key":"79_CR9","first-page":"29","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. SMC, Part B 26(1), 29\u201341 (1996)","journal-title":"IEEE Trans. SMC, Part B"},{"issue":"2","key":"79_CR10","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"LM Gambardella","year":"1999","unstructured":"Gambardella, L.M., Taillard, E.D., Dorigo, M.: Ant colonies for the quadratic assignment problem. J. Oper. Res. Soc. 50(2), 167\u2013176 (1999)","journal-title":"J. Oper. Res. Soc."},{"key":"79_CR11","doi-asserted-by":"crossref","unstructured":"Gon\u00e7alves, J.F., Resende, M.G.C.: Biased random-key genetic algorithms for combinatorial optimization. J. Heuristics 17(5), 487\u2013525 (2011)","DOI":"10.1007\/s10732-010-9143-1"},{"key":"79_CR12","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1109\/TC.2013.205","volume":"64","author":"K Li","year":"2015","unstructured":"Li, K., Tang, X., Veeravalli, B., Li, K.: Scheduling precedence constrained stochastic tasks on heterogeneous cluster systems. IEEE Trans. Comput. 64, 191\u2013204 (2015)","journal-title":"IEEE Trans. Comput."},{"key":"79_CR13","doi-asserted-by":"crossref","unstructured":"L\u00f3pez-Ib\u00e1nez, M., St\u00fctzle, T., Dorigo, M.: Ant colony optimization: a component-wise overview. Techreport, IRIDIA, Universite Libre de Bruxelles (2015)","DOI":"10.1007\/978-3-319-07153-4_21-1"},{"key":"79_CR14","doi-asserted-by":"crossref","unstructured":"Mart\u00ed, R., Reinelt, G.: The Linear Ordering Problem: Exact and Heuristic Methods in Combinatorial Optimization. Springer Science & Business Media, Heidelberg (2011)","DOI":"10.1007\/978-3-642-16729-4"},{"key":"79_CR15","doi-asserted-by":"crossref","unstructured":"Montgomery, J., Randall, M., Hendtlass, T.: Solution bias in ant colony optimisation: lessons for selecting pheromone models. Comput. Oper. Res. 35 (2008)","DOI":"10.1016\/j.cor.2006.12.014"},{"key":"79_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-02319-4_45","volume-title":"Hybrid Artificial Intelligence Systems","author":"C-M Pintea","year":"2009","unstructured":"Pintea, C.-M., Crisan, G.C., Chira, C., Dumitrescu, D.: A hybrid ant-based approach to the economic triangulation problem for input-output tables. In: Corchado, E., Wu, X., Oja, E., Herrero, \u00c1., Baruque, B. (eds.) HAIS 2009. LNCS (LNAI), vol. 5572, pp. 376\u2013383. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-02319-4_45"},{"issue":"2","key":"79_CR17","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1016\/S0377-2217(02)00908-6","volume":"155","author":"C Rajendran","year":"2004","unstructured":"Rajendran, C., Ziegler, H.: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan\/total flowtime of jobs. Eur. J. Oper. Res. 155(2), 426\u2013438 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"79_CR18","doi-asserted-by":"publisher","unstructured":"Santucci, V., Baioletti, M., Milani, A.: Algebraic differential evolution algorithm for the permutation flowshop scheduling problem with total flowtime criterion. IEEE Trans. Evol. Comput. 20(5), 682\u2013694 (2016). doi: 10.1109\/TEVC.2015.2507785","DOI":"10.1109\/TEVC.2015.2507785"},{"key":"79_CR19","doi-asserted-by":"publisher","unstructured":"Santucci, V., Baioletti, M., Milani, A.: Solving permutation flowshop scheduling problems with a discrete differential evolution algorithm. AI Commun. 29(2), 269\u2013286 (2016). doi: 10.3233\/AIC-150695","DOI":"10.3233\/AIC-150695"},{"key":"79_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-10762-2_16","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"V Santucci","year":"2014","unstructured":"Santucci, V., Baioletti, M., Milani, A.: A differential evolution algorithm for the permutation flowshop scheduling problem with total flow time criterion. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 161\u2013170. Springer, Cham (2014). doi: 10.1007\/978-3-319-10762-2_16"},{"issue":"8","key":"79_CR21","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T St\u00fctzle","year":"2000","unstructured":"St\u00fctzle, T., Hoos, H.H.: Max-min ant system. Future Gen. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Future Gen. Comput. Syst."}],"container-title":["Lecture Notes in Computer Science","Simulated Evolution and Learning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-68759-9_79","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,4]],"date-time":"2019-10-04T12:19:12Z","timestamp":1570191552000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-68759-9_79"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319687582","9783319687599"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-68759-9_79","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}