{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:50:31Z","timestamp":1729641031104,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,12]]},"DOI":"10.1109\/cira.2009.5423222","type":"proceedings-article","created":{"date-parts":[[2010,3,3]],"date-time":"2010-03-03T10:41:53Z","timestamp":1267612913000},"page":"120-125","source":"Crossref","is-referenced-by-count":0,"title":["DEM: A discrete electromagnetism-like mechanism for solving discrete problems"],"prefix":"10.1109","author":[{"given":"Omid","family":"AghaLatifi","sequence":"first","affiliation":[]},{"given":"Mohammad Reza","family":"Bonyadi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"year":"1990","author":"martello","journal-title":"Knapsack Problems Algorithms and Computer Implementations","key":"ref10"},{"year":"1979","author":"garey","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","key":"ref11"},{"key":"ref12","first-page":"188","article-title":"The zero\/one Multidimensional knapsack problem and genetic algorithms","author":"khuri","year":"1994","journal-title":"ACM Symposium on Applied Computing"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/978-3-7091-6492-1_55"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1016\/j.cor.2006.02.008"},{"key":"ref15","article-title":"Evolutionary algorithm for multidimensional knapsack problem","author":"fidanova","year":"2002","journal-title":"PPSNVII-Workshop"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.cor.2006.12.029"},{"key":"ref17","first-page":"63","article-title":"Ant algorithm for the multidimensional knapsack problem","author":"alaya","year":"2004","journal-title":"Biomag 2004"},{"key":"ref18","first-page":"1140","article-title":"Application of the particle swarm optimization to the multidimensional knapsack problem","author":"kong","year":"2006","journal-title":"ICAISC 2006 8th International Conference Proceedings"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1016\/j.cor.2004.04.020"},{"year":"2001","author":"kennedy","journal-title":"Swarm Intelligence","key":"ref4"},{"key":"ref3","article-title":"Positive feedback as a search strategy","author":"dorigo","year":"1991","journal-title":"Technical Report No 91–016"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1108\/17563780810874717","article-title":"Intelligent Water Drops Algorithm: A New Optimization Method for Solving the Multiple Knapsack Problem","volume":"1","author":"hamed","year":"2008","journal-title":"International Journal of Intelligent Computing and Cybernetics"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1023\/A:1022452626305"},{"key":"ref8","first-page":"259","article-title":"The Electromagnetism Meta-heuristic Applied to the Resource-Constrained Project Scheduling Problem","author":"debels","year":"2006","journal-title":"LNCS"},{"key":"ref7","article-title":"A Revised EM-like Algorithm + K-OPT Method for Solving the Traveling Salesman Problem","author":"wu","year":"2006","journal-title":"Proceedings of the First international Conference on innovative Computing information and Control"},{"year":"1973","author":"rechenberg","journal-title":"Optimierung technischer Systeme nach Prinzipien der biologischen Information","key":"ref2"},{"key":"ref9","first-page":"359","article-title":"An Electromagnetic Meta-Heuristic for the Nurse Scheduling Problem","author":"maenhout","year":"2005","journal-title":"Journal of Heuristics"},{"year":"1975","author":"holland","journal-title":"Adaptation in Natural and Artificial Systems","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1287\/mnsc.13.9.736"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1287\/opre.15.1.83"},{"key":"ref21","first-page":"196b","article-title":"An approach to linear programming with 0–1 variables","volume":"15","author":"senyu","year":"1967","journal-title":"Management Science"},{"key":"ref24","first-page":"255","article-title":"Heuristics for Multiple Knapsack Problem","author":"fidanova","year":"2005","journal-title":"IADIS"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1038\/sj\/jors\/0411109"},{"key":"ref25","first-page":"1","article-title":"Population Based Optimization Algorithms for Solving the Travelling Salesman Problem, Chapter Book","author":"bonyadi","year":"2008","journal-title":"Travelling Salesman Problem"}],"event":{"name":"2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation - (CIRA 2009)","start":{"date-parts":[[2009,12,15]]},"location":"Daejeon, Korea (South)","end":{"date-parts":[[2009,12,18]]}},"container-title":["2009 IEEE International Symposium on Computational Intelligence in Robotics and Automation - (CIRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5418381\/5423149\/05423222.pdf?arnumber=5423222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T01:46:21Z","timestamp":1497836781000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5423222\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/cira.2009.5423222","relation":{},"subject":[],"published":{"date-parts":[[2009,12]]}}}