{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T17:14:39Z","timestamp":1712423679658},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,11,26]],"date-time":"2010-11-26T00:00:00Z","timestamp":1290729600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s11227-010-0517-9","type":"journal-article","created":{"date-parts":[[2010,11,25]],"date-time":"2010-11-25T13:27:16Z","timestamp":1290691636000},"page":"633-655","source":"Crossref","is-referenced-by-count":5,"title":["Parallel decomposition of combinatorial optimization problems using electro-optical vector by matrix multiplication architecture"],"prefix":"10.1007","volume":"62","author":[{"given":"Dan E.","family":"Tamir","sequence":"first","affiliation":[]},{"given":"Natan T.","family":"Shaked","sequence":"additional","affiliation":[]},{"given":"Wilhelmus J.","family":"Geerts","sequence":"additional","affiliation":[]},{"given":"Shlomi","family":"Dolev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,11,26]]},"reference":[{"key":"517_CR1","doi-asserted-by":"crossref","unstructured":"Larrinaga P, Kuijpers CMH, (1999) Murga: Genetic algorithms for the travelling salesman problem: a\u00a0review of representations and operators. Artif Intell Rev 129\u2013170","DOI":"10.1023\/A:1006529012972"},{"key":"517_CR2","doi-asserted-by":"crossref","first-page":"A11","DOI":"10.1364\/JOSAA.26.000A11","volume":"26","author":"DE Tamir","year":"2009","unstructured":"Tamir DE, Shaked NT, Wilson PJ, Dolev S (2009) High-speed and low-power electro-optical DSP coprocessor. J Opt Soc Am A 26:A11\u2013A20","journal-title":"J Opt Soc Am A"},{"key":"517_CR3","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/978-3-642-02568-6_23","volume-title":"Next generation applied intelligence","author":"D Karhi","year":"2009","unstructured":"Karhi D, Tamir DE (2009) Caching in the TSP search space. In: Next generation applied intelligence, Tainan, Taiwan, pp 221\u2013230"},{"issue":"4","key":"517_CR4","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1080\/10798587.2005.10642906","volume":"11","author":"L Wang","year":"2005","unstructured":"Wang L, Maciejewski AA, Siegel HJ, Roychowdhury VP (2005) A study of five parallel approaches to a genetic algorithm for the traveling salesman problem. Intell Autom Soft Comput 11(4):217\u2013234","journal-title":"Intell Autom Soft Comput"},{"issue":"5","key":"517_CR5","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1364\/AO.46.000711","volume":"46","author":"NT Shaked","year":"2007","unstructured":"Shaked NT, Messika S, Dolev S, Rosen J (2007) Optical solution for bounded NP-complete problems. Appl Opt 46(5):711\u2013724","journal-title":"Appl Opt"},{"key":"517_CR6","first-page":"110","volume-title":"3rd int\u2019l conf genetic algorithms","author":"P Jog","year":"1989","unstructured":"Jog P, Suh JY, Van Gucht D (1989) The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem. In: 3rd int\u2019l conf genetic algorithms, pp 110\u2013115"},{"key":"517_CR7","volume-title":"Introduction to Fourier optics","author":"GW Goodman","year":"1996","unstructured":"Goodman GW (1996) Introduction to Fourier optics. McGraw-Hill, New York"},{"key":"517_CR8","volume-title":"Optical computing: a survey for computer scientists","author":"DG Feitelson","year":"1988","unstructured":"Feitelson DG (1988) Optical computing: a survey for computer scientists. MIT Press, Cambridge"},{"key":"517_CR9","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"517_CR10","series-title":"Local Search in Combinatorial Optimization","first-page":"215","volume-title":"The traveling salesman problem: a case study in local optimization","author":"DS Johnson","year":"1997","unstructured":"Johnson DS, McGeoch LA (1997) The traveling salesman problem: a case study in local optimization. Local Search in Combinatorial Optimization. Wiley, New York, pp 215\u2013310"},{"key":"517_CR11","volume-title":"The traveling salesman problem: a computational study","author":"DL Applegate","year":"2007","unstructured":"Applegate DL, Bixby RE, Vasek C, Cook WJ (2007) The traveling salesman problem: a computational study. Princeton University Press, Princeton"},{"issue":"4","key":"517_CR12","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1007\/s00037-007-0235-8","volume":"16","author":"D Gutfreund","year":"2007","unstructured":"Gutfreund D, Shaltiel R, Ta-Shma A (2007) If NP languages are hard on the worst-case, then it is easy to find their hard instances. Comput Complex 16(4):412\u2013441","journal-title":"Comput Complex"},{"issue":"4","key":"517_CR13","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB\u2014a traveling salesman problem library. ORSA J Comput 3(4):376\u2013384; http:\/\/comopt.ifi.uni-heidelberg.de\/software\/TSPLIB95\/","journal-title":"ORSA J Comput"},{"key":"517_CR14","doi-asserted-by":"crossref","first-page":"10473","DOI":"10.1364\/OE.15.010473","volume":"15","author":"T Haist","year":"2007","unstructured":"Haist T, Osten W (2007) An optical solution for the traveling salesman problem. Opt Express 15:10473\u201310482","journal-title":"Opt Express"},{"key":"517_CR15","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M Held","year":"1970","unstructured":"Held M, Karp RM (1970) The traveling salesman problem and minimum spanning trees. Oper Res 18:1138\u20131162","journal-title":"Oper Res"},{"key":"517_CR16","unstructured":"Anonymous, Concorde TSP Solver, http:\/\/www.tsp.gatech.edu\/concorde.html"},{"key":"517_CR17","volume-title":"Heuristics: Intelligent search strategies for computer problem solving","author":"J Pearl","year":"1984","unstructured":"Pearl J (1984) Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley, Reading"},{"key":"517_CR18","volume-title":"Artificial intelligence: a modern approach","author":"SJ Russell","year":"1995","unstructured":"Russell SJ, Norvig P (1995) Artificial intelligence: a modern approach. Prentice-Hall, New York"},{"key":"517_CR19","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1145\/988672.988711","volume-title":"Proceedings of the 13th international conference on world wide web","author":"B Xi","year":"2004","unstructured":"Xi B, Liu Z, Raghavachari M, Xia C, Zhang L (2004) A smart hill-climbing algorithm for application server configuration. In: Proceedings of the 13th international conference on world wide web, pp 287\u2013296"},{"key":"517_CR20","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6229.001.0001","volume-title":"The simple genetic algorithm: foundations and theory","author":"MD Vose","year":"1999","unstructured":"Vose MD (1999) The simple genetic algorithm: foundations and theory. MIT Press, Cambridge"},{"key":"517_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Norwell"},{"key":"517_CR22","volume-title":"Swarm intelligence","author":"J Kennedy","year":"2001","unstructured":"Kennedy J, Eberhart RC (2001) Swarm intelligence. Academic Press, San Diego"},{"key":"517_CR23","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220:671\u2013680","journal-title":"Science"},{"issue":"3","key":"517_CR24","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein S (1996) Using anytime algorithms in intelligent systems. AI Mag 17(3):73\u201383","journal-title":"AI Mag"},{"issue":"1","key":"517_CR25","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.ijar.2004.04.001","volume":"38","author":"T Ramos","year":"2005","unstructured":"Ramos T, Cozman G (2005) Anytime anyspace probabilistic inference. Int J Approx Reason 38(1):53\u201380","journal-title":"Int J Approx Reason"},{"key":"517_CR26","doi-asserted-by":"crossref","DOI":"10.1515\/9780691187563","volume-title":"Local search in combinatorial optimization","author":"E Aarts","year":"2003","unstructured":"Aarts E, Lenstra J (2003) Local search in combinatorial optimization. Princeton University Press, Princeton"},{"key":"517_CR27","first-page":"291","volume-title":"Proceedings of CNMI","author":"L Ursache","year":"2007","unstructured":"Ursache L (2007) Representation models for solving TSP with genetic algorithms. In: Proceedings of CNMI, Bac\u0103u, pp 291\u2013298"},{"key":"517_CR28","unstructured":"Or I (1976) Traveling salesman types combinatorial problems and their relations to the logistics of regional blood banking. PhD thesis, Northwestern University"},{"key":"517_CR29","first-page":"1","volume-title":"Int conf on computer systems and technologies","author":"P Borovska","year":"2006","unstructured":"Borovska P (2006) Solving the travelling salesman problem in parallel by genetic algorithm on multicomputer cluster. In: Int conf on computer systems and technologies, pp 1\u20136"},{"key":"517_CR30","first-page":"620","volume-title":"Sixth international conference on parallel and distributed computing, applications and technologies","author":"P Gang","year":"2005","unstructured":"Gang P, Iimura I, Nakatsuru T, Nakayama S (2005) Efficiency of local genetic algorithm in parallel processing. In: Sixth international conference on parallel and distributed computing, applications and technologies, pp 620\u2013623"},{"key":"517_CR31","first-page":"73","volume-title":"EuroGP","author":"WB Langdon","year":"2008","unstructured":"Langdon WB, Banzhaf W (2008) A SIMD interpreter for genetic programming on GPU graphics cards. In: EuroGP, pp 73\u201385"},{"key":"517_CR32","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1109\/HPC.1997.592232","volume-title":"Proceedings of the high-performance computing on the information superhighway","author":"T Inoue","year":"1997","unstructured":"Inoue T, Sano M, Takahashi Y (1997) Design of a processing element of a SIMD computer for genetic algorithms. In: Proceedings of the high-performance computing on the information superhighway, pp 688\u2013691"},{"key":"517_CR33","first-page":"573","volume-title":"International conference workshops on parallel processing","author":"MA Vega-Rodriguez","year":"2005","unstructured":"Vega-Rodriguez MA, Gutierrez-Gil R, Avila-Roman JM, Sanchez-Perez JM, Gomez-Pulido JA (2005) Genetic algorithms using parallelism and FPGAs: the TSP as case study. In: International conference workshops on parallel processing, pp 573\u2013579"},{"key":"517_CR34","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1117\/12.147887","volume":"1806","author":"N Collings","year":"1993","unstructured":"Collings N, Sumi R, Weible KJ, Acklin B, Xue W (1993) The use of optical hardware to find good solutions of the travelling salesman problem (TSP). Proc SPIE 1806:637\u2013641","journal-title":"Proc SPIE"},{"issue":"10","key":"517_CR35","first-page":"1","volume":"46","author":"NT Shaked","year":"2007","unstructured":"Shaked NT, Tabib T, Simon G, Messika S, Dolev S, Rosen J (2007) Optical binary-matrix synthesis for solving bounded NP-complete combinatorial problems. Opt Eng 46(10):1\u201311","journal-title":"Opt Eng"},{"issue":"1","key":"517_CR36","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s11047-007-9042-z","volume":"7","author":"M Oltean","year":"2008","unstructured":"Oltean M (2008) Solving the Hamiltonian path problem with a light-based computer. Nat Comput 7(1):57\u201370","journal-title":"Nat Comput"},{"key":"517_CR37","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/978-3-540-85673-3_10","volume-title":"Proceedings of 1st international workshop on optical supercomputing","author":"M Oltean","year":"2008","unstructured":"Oltean M, Muntean O (2008) Solving NP-complete problems with delayed signals: an overview of current research directions. In: Proceedings of 1st international workshop on optical supercomputing, pp 115\u2013128"},{"issue":"2","key":"517_CR38","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"L Pitsoulis","year":"1995","unstructured":"Pitsoulis L, Resende M (1995) Greedy randomized adaptive search procedures. J Glob Optim 6(2):109\u2013133","journal-title":"J Glob Optim"},{"key":"517_CR39","first-page":"221","volume-title":"The international conference on artificial intelligence and pattern recognition","author":"D Lowell","year":"2009","unstructured":"Lowell D, El Lababedi B, Novoa C, Tamir DE (2009) The locality of reference of genetic algorithms and probabilistic reasoning. In: The international conference on artificial intelligence and pattern recognition, Florida, pp 221\u2013228"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-010-0517-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-010-0517-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-010-0517-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T08:41:06Z","timestamp":1685868066000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-010-0517-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,26]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["517"],"URL":"http:\/\/dx.doi.org\/10.1007\/s11227-010-0517-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,26]]}}}
