{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:04:46Z","timestamp":1743012286614,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031024610"},{"type":"electronic","value":"9783031024627"}],"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-02462-7_10","type":"book-chapter","created":{"date-parts":[[2022,4,14]],"date-time":"2022-04-14T23:02:49Z","timestamp":1649977369000},"page":"141-156","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On the Difficulty of Evolving Permutation Codes"],"prefix":"10.1007","author":[{"given":"Luca","family":"Mariot","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marko","family":"Djurasevic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alberto","family":"Leporati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,15]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00203625","volume":"64","author":"W Banzhaf","year":"1990","unstructured":"Banzhaf, W.: The \u201cmolecular\u2019\u2019 traveling salesman. Biol. Cybern. 64(1), 7\u201314 (1990)","journal-title":"Biol. Cybern."},{"issue":"1\u20133","key":"10_CR2","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/B:DESI.0000029212.52214.71","volume":"32","author":"W Chu","year":"2004","unstructured":"Chu, W., Colbourn, C.J., Dukes, P.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32(1\u20133), 51\u201364 (2004)","journal-title":"Des. Codes Cryptogr."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., Dinitz, J.H.: Combinatorial designs. In: Rosen, K.H., Michaels, J.G., Gross, J.L., Grossman, J.W., Shier, D.R. (eds.) Handbook of Discrete and Combinatorial Mathematics. CRC Press (1999)","DOI":"10.1201\/9781439832905.ch12"},{"issue":"6","key":"10_CR4","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2004.828150","volume":"50","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn, C.J., Kl\u00f8ve, T., Ling, A.C.H.: Permutation arrays for powerline communication and mutually orthogonal Latin squares. IEEE Trans. Inf. Theory 50(6), 1289\u20131291 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"Conway, J.H., Sloane, N.J.A.: Sphere Packings, Lattices and Groups, Grundlehren der mathematischen Wissenschaften, vol. 290. Springer (1988). https:\/\/doi.org\/10.1007\/978-1-4757-6568-7","DOI":"10.1007\/978-1-4757-6568-7"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Daemen, J., Rijmen, V.: The Design of Rijndael - The Advanced Encryption Standard. AES), Second Edition. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-662-04722-4","DOI":"10.1007\/978-3-662-04722-4"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Ferreira, H.C., Vinck, A.H.: Interference cancellation with permutation trellis codes. In: IEEE 52nd Vehicular Technology Conference Fall 2000, vol. 5, pp. 2401\u20132407. IEEE (2000)","DOI":"10.1109\/VETECF.2000.883295"},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1080\/01969729308961697","volume":"24","author":"DB Fogel","year":"1993","unstructured":"Fogel, D.B.: Applying evolutionary programming to selected traveling salesman problems. Cybern. Syst. 24(1), 27\u201336 (1993)","journal-title":"Cybern. Syst."},{"key":"10_CR9","unstructured":"Goldberg, D.E., Jr., R.L.: Alleles, loci and the traveling salesman problem. In: Grefenstette, J.J. (ed.) Proceedings of the 1st International Conference on Genetic Algorithms, Pittsburgh, PA, USA, July 1985, pp. 154\u2013159. Lawrence Erlbaum Associates (1985)"},{"issue":"1","key":"10_CR10","first-page":"45","volume":"54","author":"A Han Vinck","year":"2000","unstructured":"Han Vinck, A.: Coded modulation for powerline communications. AEU Int. J. Eletron. Commun. 54(1), 45\u201349 (2000)","journal-title":"AEU Int. J. Eletron. Commun."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Jiang, A., Mateescu, R., Schwartz, M., Bruck, J.: Rank modulation for flash memories. In: Kschischang, F.R., Yang, E. (eds.) 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 6\u201311 July 2008, pp. 1731\u20131735. IEEE (2008)","DOI":"10.1109\/ISIT.2008.4595284"},{"key":"10_CR12","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of a symposium on the complexity of computer computations, held 20\u201322 March 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA, pp. 85\u2013103. The IBM Research Symposia Series, Plenum Press, New York (1972)"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","DOI":"10.1126\/science.220.4598.671"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Knezevic, K., Picek, S., Mariot, L., Jakobovic, D., Leporati, A.: The design of (almost) disjunct matrices by evolutionary algorithms. In: Fagan, D., Mart\u00edn-Vide, C., O\u2019Neill, M., Vega-Rodr\u00edguez, M.A. (eds.) Theory and Practice of Natural Computing - 7th International Conference, TPNC 2018, Dublin, Ireland, December 12-14, 2018, Proceedings. Lecture Notes in Computer Science, vol. 11324, pp. 152\u2013163. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-04070-3_12","DOI":"10.1007\/978-3-030-04070-3_12"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Liu, M., Sim, S.M.: Lightweight MDS generalized circulant matrices. In: Peyrin, T. (ed.) Fast Software Encryption - 23rd International Conference, FSE 2016, Bochum, Germany, 20\u201323 March 2016, Revised Selected Papers. Lecture Notes in Computer Science, vol.\u00a09783, pp. 101\u2013120. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-52993-5_6","DOI":"10.1007\/978-3-662-52993-5_6"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Leporati, A.: Evolutionary algorithms for the design of orthogonal Latin squares based on cellular automata. In: Bosman, P.A.N. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2017, Berlin, Germany, 15\u201319 July 2017, pp. 306\u2013313. ACM (2017)","DOI":"10.1145\/3071178.3071284"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Mariot, L., Picek, S., Jakobovic, D., Leporati, A.: Evolutionary search of binary orthogonal arrays. In: Auger, A., Fonseca, C.M., Louren\u00e7o, N., Machado, P., Paquete, L., Whitley, L.D. (eds.) Parallel Problem Solving from Nature - PPSN XV - 15th International Conference, Coimbra, Portugal, 8\u201312 September 2018, Proceedings, Part I. Lecture Notes in Computer Science, vol. 11101, pp. 121\u2013133. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-99253-2_10","DOI":"10.1007\/978-3-319-99253-2_10"},{"key":"10_CR18","doi-asserted-by":"publisher","unstructured":"Montemanni, R., Barta, J., Smith, D.H.: Graph colouring and branch and bound approaches for permutation code algorithms. In: Rocha, \u00c1., Correia, A.M.R., Adeli, H., Reis, L.P., Teixeira, M.M. (eds.) New Advances in Information Systems and Technologies - Volume 1 [WorldCIST\u201916, Recife, Pernambuco, Brazil, March 22\u201324, 2016]. Advances in Intelligent Systems and Computing, vol. 444, pp. 223\u2013232. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-31232-3_21","DOI":"10.1007\/978-3-319-31232-3_21"},{"key":"10_CR19","unstructured":"Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the traveling salesman problem. In: Grefenstette, J.J. (ed.) Proceedings of the 2nd International Conference on Genetic Algorithms, Cambridge, MA, USA, July 1987, pp. 224\u2013230. Lawrence Erlbaum Associates (1987)"},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10623-011-9551-8","volume":"63","author":"DH Smith","year":"2012","unstructured":"Smith, D.H., Montemanni, R.: A new table of permutation codes. Des. Codes Cryptogr. 63(2), 241\u2013253 (2012)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10623-012-9623-4","volume":"69","author":"DH Smith","year":"2013","unstructured":"Smith, D.H., Montemanni, R.: Permutation codes with specified packing radius. Des. Codes Cryptogr. 69(1), 95\u2013106 (2013)","journal-title":"Des. Codes Cryptogr."},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Stinson, D.R.: Combinatorial designs - constructions and analysis. Springer (2004). https:\/\/doi.org\/10.1007\/b97564","DOI":"10.1007\/b97564"},{"key":"10_CR23","unstructured":"Syswerda, G., Palmucci, J.: The application of genetic algorithms to resource scheduling. In: Belew, R.K., Booker, L.B. (eds.) Proceedings of the 4th International Conference on Genetic Algorithms, San Diego, CA, USA, July 1991, pp. 502\u2013508. Morgan Kaufmann (1991)"},{"key":"10_CR24","unstructured":"De la Torre, D., Colbourn, C., Ling, A.: An application of permutation arrays to block ciphers. Congressus Numerantium, pp. 5\u20138 (2000)"},{"key":"10_CR25","doi-asserted-by":"publisher","unstructured":"Vaudenay, S.: On the need for multipermutations: cryptanalysis of MD4 and SAFER. In: Preneel, B. (ed.) Fast Software Encryption: Second International Workshop. Leuven, Belgium, 14\u201316 December 1994, Proceedings. Lecture Notes in Computer Science, vol. 1008, pp. 286\u2013297. Springer (1994). https:\/\/doi.org\/10.1007\/3-540-60590-8_22","DOI":"10.1007\/3-540-60590-8_22"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-02462-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,22]],"date-time":"2024-09-22T08:02:54Z","timestamp":1726992174000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-02462-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031024610","9783031024627"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-02462-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"15 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","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":"20 April 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 April 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.56","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}