{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:27:36Z","timestamp":1729628856062,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1109\/icnc.2010.5583056","type":"proceedings-article","created":{"date-parts":[[2010,9,29]],"date-time":"2010-09-29T14:03:07Z","timestamp":1285768987000},"page":"2614-2618","source":"Crossref","is-referenced-by-count":1,"title":["Discrete particle swarm optimization with greedy randomized adaptive search procedure for linear order problem"],"prefix":"10.1109","author":[{"given":"Enxiu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Yi","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Zhenliang","family":"Pan","sequence":"additional","affiliation":[]},{"given":"Xiyu","family":"Liu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-007-9049-5"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1109\/SIS.2003.1202274","article-title":"Using Neighborhoods with the Guaranteed Convergence PSO","author":"peer","year":"2003","journal-title":"Proc of the IEEE Swarm Intelligence Symposium"},{"key":"ref10","first-page":"1583","article-title":"Particle swarm optimization for traveling salesman problem","author":"wang","year":"2003","journal-title":"Proc Int Conf Machine Learning and Cybernetics"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0337-8","author":"laguna","year":"2003","journal-title":"Scatter Search Methodology and Implementation"},{"key":"ref11","first-page":"340","article-title":"Solving linear ordering problems","volume":"33","author":"mitchell","year":"2000","journal-title":"High Performance Optimization Applied Optimization"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-007-9050-z"},{"key":"ref12","article-title":"The KISS generator","author":"marsaglia","year":"1993","journal-title":"Florida USA Department of Statistics Florida State University Tallahassee"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012793906010"},{"key":"ref7","article-title":"Greedy Randomized Adaptive Search Procedures: Advances and Applications","author":"resende","year":"2008","journal-title":"AT&T Labs Research Technical Report"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICNN.1995.488968"},{"journal-title":"The Linear Ordering Problem Algorithms and Applications","year":"1985","author":"reinelt","key":"ref1"},{"journal-title":"Discrete Particle Swarm Optimization Illustrated by the Traveling Salesman Problem","year":"2000","author":"clerc","key":"ref9"}],"event":{"name":"2010 Sixth International Conference on Natural Computation (ICNC)","start":{"date-parts":[[2010,8,10]]},"location":"Yantai, China","end":{"date-parts":[[2010,8,12]]}},"container-title":["2010 Sixth International Conference on Natural Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5564900\/5582346\/05583056.pdf?arnumber=5583056","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,5]],"date-time":"2019-06-05T00:22:21Z","timestamp":1559694141000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5583056\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/icnc.2010.5583056","relation":{},"subject":[],"published":{"date-parts":[[2010,8]]}}}