{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T08:31:34Z","timestamp":1744187494664},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/iceee.2017.8108889","type":"proceedings-article","created":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T16:40:37Z","timestamp":1511887237000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["A simple but effective memetic algorithm for the multidimensional assignment problem"],"prefix":"10.1109","author":[{"given":"Carlos E.","family":"Valencia","sequence":"first","affiliation":[]},{"given":"Francisco Javier","family":"Zaragoza Martinez","sequence":"additional","affiliation":[]},{"given":"Sergio Luis Perez","family":"Perez","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800020109"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2009.05.001"},{"key":"ref12","article-title":"A new local search heuristic for the multidimensional assignment problem","author":"perez perez","year":"2016","journal-title":"Studies in Computational Intelligence 731 pages 185–206 2017 NEO 2016 Results of the Numerical and Evolutionary Optimization Workshop NEO 2016 and the NEO Cities 2016 Workshop"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011285402433"},{"journal-title":"Matchings in bipartite graphs and assignment problems","year":"2017","author":"vargas","key":"ref14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/11970125_17"},{"key":"ref3","first-page":"154","article-title":"Alleleslociand the traveling salesman problem","author":"goldberg","year":"1985","journal-title":"Proceedings of the 1st International Conference on Genetic Algorithms"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-010-9133-3"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.09.042"},{"key":"ref8","first-page":"107","article-title":"Empirical evaluation of construction heuristics for the multidimensional assignment problem","author":"karapetyan","year":"2009","journal-title":"London Algorithmics 2008 Theory and Practice ser Texts in Algorithmics"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1162\/EVCO_a_00026"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.1.150"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1030.0059"},{"key":"ref9","first-page":"85","author":"karp","year":"1972","journal-title":"Reducibility Among Combinatorial Problems"}],"event":{"name":"2017 14th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)","start":{"date-parts":[[2017,10,20]]},"location":"Mexico City","end":{"date-parts":[[2017,10,22]]}},"container-title":["2017 14th International Conference on Electrical Engineering, Computing Science and Automatic Control (CCE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8098636\/8108823\/08108889.pdf?arnumber=8108889","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,27]],"date-time":"2020-03-27T11:29:08Z","timestamp":1585308548000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8108889\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/iceee.2017.8108889","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}