{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:27:16Z","timestamp":1778300836951,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,12,1]],"date-time":"2002-12-01T00:00:00Z","timestamp":1038700800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Genetic Programming and Evolvable Machines"],"published-print":{"date-parts":[[2002,12]]},"DOI":"10.1023\/a:1020936909085","type":"journal-article","created":{"date-parts":[[2003,3,20]],"date-time":"2003-03-20T19:19:47Z","timestamp":1048187987000},"page":"345-361","source":"Crossref","is-referenced-by-count":25,"title":["Fast Ant Colony Optimization on Runtime Reconfigurable Processor Arrays"],"prefix":"10.1007","volume":"3","author":[{"given":"Daniel","family":"Merkle","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5103873_CR1","first-page":"125","volume":"8","author":"A. Bauer","year":"2000","unstructured":"A. Bauer, B. Bullnheimer, R. F. Hartl, and C. Strauss, \u201cMinimizing total tardiness on a single machine using ant colony optimization,\u201d Central European Journal of Operations Research, vol. 8, pp. 125\u2013141, 2000.","journal-title":"Central European Journal of Operations Research"},{"key":"5103873_CR2","first-page":"611","volume-title":"Ant colony optimization for the total weighted tardiness problem","author":"M. L. den Besten","year":"2000","unstructured":"M. L den Besten, T. St\u00fctzle, and M. Dorigo, \u201cAnt colony optimization for the total weighted tardiness problem,\u201d in Parallel Problem Solving from Nature: 6th International Conference, M. Schoenauer et al. (eds.), Springer: Berlin, LNCS, vol. 1917, pp. 611\u2013620, 2000."},{"key":"5103873_CR3","volume-title":"Proc. Recon-figurable Architectures Workshop","author":"K. Bondalapati","year":"1997","unstructured":"K. Bondalapati and V. K. Prasanna, \u201cReconfigurable meshes: Theory and practice,\u201d in Proc. Recon-figurable Architectures Workshop, R. W. Hartenstein and Viktor K. Prasanna (eds.), April 1, 1997, Geneva, Switzerland, ITpress Verlag: Bruchsal."},{"key":"5103873_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/978-1-4613-3279-4_6","volume-title":"High Performance Algorithms and Software in Nonlinear Optimization","author":"B. Bullnheimer","year":"1998","unstructured":"B. Bullnheimer, G. Kotsis, and C. Strauss, \u201cParallelization strategies for the ant system,\u201d in High Performance Algorithms and Software in Nonlinear Optimization, R. De Leone, A. Murli, P. Pardalos, and G. Toraldo (eds.), Series: Applied Optimization, Kluwer: Dordrecht, vol. 24, pp. 87\u2013100, 1998."},{"key":"5103873_CR5","volume-title":"An iterated dynasearch algorithm for the singlemachine total weighted tardiness scheduling problem","author":"R. K. Congram","year":"1998","unstructured":"R. K. Congram, C. N. Potts, and S. L. van de Velde, \u201cAn iterated dynasearch algorithm for the singlemachine total weighted tardiness scheduling problem,\u201d Working Paper, University of Southampton, UK, 1998."},{"key":"5103873_CR6","first-page":"11","volume-title":"New Ideas in Optimization","author":"M. Dorigo","year":"1999","unstructured":"M. Dorigo and G. Di Caro, \u201cThe ant colony optimization meta-heuristic,\u201d in New Ideas in Optimization, D. Corne, M. Dorigo, F. Glover (eds.), McGraw-Hill: London, pp. 11\u201332, 1999."},{"key":"5103873_CR7","series-title":"Technical Report","volume-title":"Ant colonies for the QAP","author":"M. Dorigo","year":"1997","unstructured":"M. Dorigo and L. M. Gambardella, \u201cAnt colonies for the QAP,\u201d Technical Report IDSIA-4-97, IDSIA, Lugano, 1997."},{"key":"5103873_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"M. Dorigo and L. M. Gambardella, \u201cAnt colony system: A cooperative learning approach to the traveling salesman problem,\u201d IEEE Transactions on Evolutionary Computation, vol. 1, pp. 53\u201366, 1997.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"5103873_CR9","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1057\/palgrave.jors.2600676","volume":"50","author":"L. M. Gambardella","year":"1999","unstructured":"L. M. Gambardella, E. Taillard, and M. Dorigo, \u201cAnt colonies for the quadratic assignment problem,\u201d Journal of the Operational Research Society, vol. 50, pp. 167\u2013176, 1999.","journal-title":"Journal of the Operational Research Society"},{"key":"5103873_CR10","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(99)00485-3","volume":"127","author":"S. Hartmann","year":"2000","unstructured":"S. Hartmann, and R. Kolisch, \u201cExperimental evaluation of state-of-the-art heuristics for the resource-constrained project scheduling problem,\u201d European Journal of Operational Research, vol. 127, pp. 394\u2013407, 2000.","journal-title":"European Journal of Operational Research"},{"key":"5103873_CR11","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"V. Maniezzo, \u201cExact and approximate nondeterministic tree-search procedures for the quadratic assignment problem,\u201d INFORMS Journal on Computing, vol. 11, pp. 358\u2013368, 1999.","journal-title":"INFORMS Journal on Computing"},{"key":"5103873_CR12","series-title":"Tech. Rep. IRIDIA","volume-title":"The ant system applied to the quadratic assignment problem","author":"V. Maniezzo","year":"1994","unstructured":"V. Maniezzo, A. Colorni, and M. Dorigo, \u201cThe ant system applied to the quadratic assignment problem,\u201d Tech. Rep. IRIDIA\/94-28, Universit\u00e9 Libre de Bruxelles, Belgium, 1994."},{"key":"5103873_CR13","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/69.806935","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"V. Maniezzo and A. Colorni, \u201cThe ant system applied to the quadratic assignment problem,\u201d IEEE Transactions on Knowledge and Data Engineering, vol. 11, pp. 769\u2013778, 1999.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"5103873_CR14","unstructured":"D. Merkle and M. Middendorf, \u201cAn ant algorithm with global pheromone evaluation for scheduling a single machine,\u201d Applied Intelligence, to appear."},{"key":"5103873_CR15","unstructured":"D. Merkle, M. Middendorf, and H. Schmeck, \u201cAnt colony optimization for resource-constrained project scheduling,\u201d in Proc. of the Genetic and Evolutionary Computation Conference (GECCO-2000), D. Whitley et al. (eds.), Morgan Kaufmann, pp. 893\u2013900, 2000."},{"key":"5103873_CR16","series-title":"Tech. Rep.","volume-title":"Ant Colony Optimization and Stochastic Gradient Descent","author":"N. Meuleau","year":"2000","unstructured":"N. Meuleau and M. Dorigo, \u201cAnt Colony Optimization and Stochastic Gradient Descent,\u201d Tech. Rep. IRIDIA\/2000-36, Universit\u00e9 Libre de Bruxelles, Belgium, 2000."},{"key":"5103873_CR17","unstructured":"R. Michels and M. Middendorf, \u201cAn ant system for the shortest common supersequence problem,\u201d in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover (eds.) McGraw-Hill, pp. 51\u201361, 1999."},{"key":"5103873_CR18","first-page":"625","volume-title":"Parallel and Distributed Computing","author":"M. Middendorf","year":"1999","unstructured":"M. Middendorf, \u201cBit-summation on the reconfigurable mesh,\u201d in Parallel and Distributed Computing, Proc. of the 11 IPPS\/SPDP'99 Workshops, 6th Reconfigurable Architectures Workshop RAW-99, J. Rolim et al. (eds.), Springer: Berlin, LNCS, vol. 1586, pp. 625\u2013633, 1999."},{"key":"5103873_CR19","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1015057701750","volume":"8","author":"M. Middendorf","year":"2002","unstructured":"M. Middendorf, F. Reischle, and H. Schmeck, \u201cMulti colony ant algorithms,\u201d Journal of Heuristics, vol. 8, pp. 305\u2013320, 2002.","journal-title":"Journal of Heuristics"},{"key":"5103873_CR20","doi-asserted-by":"crossref","first-page":"678","DOI":"10.1109\/12.277290","volume":"42","author":"R. Miller","year":"1993","unstructured":"R. Miller, V. K. Prasanna-Kumar, D. I. Reisis, and Q. F. Stout, \u201cParallel computations on reconfigurable meshes,\u201d IEEE Trans. Comput., vol. 42, pp. 678\u2013692, 1993.","journal-title":"IEEE Trans. Comput."},{"key":"5103873_CR21","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0304-3975(97)00007-8","volume":"197","author":"K. Nakano","year":"1998","unstructured":"K. Nakano and K. Wada, \u201cInteger summing algorithms on reconfigurable meshes,\u201d Theoret. Comput. Sci., vol. 197, pp. 57\u201377, 1998.","journal-title":"Theoret. Comput. Sci."},{"key":"5103873_CR22","first-page":"1560","volume-title":"Proc. 6th European Congress on Intelligent Techniques & Soft Computing (EUFIT '98)","author":"T. St\u00fctzle","year":"1998","unstructured":"T. St\u00fctzle, \u201cAn ant approach for the flow shop problem,\u201d in Proc. 6th European Congress on Intelligent Techniques & Soft Computing (EUFIT '98), Verlag Mainz: Aachen, vol. 3, pp. 1560\u20131564, 1998."},{"key":"5103873_CR23","unstructured":"T. St\u00fctzle and M. Dorigo, \u201cACO algorithms for the quadratic assignment problem,\u201d in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover (eds.), McGraw-Hill, pp. 33\u201350, 1999."},{"key":"5103873_CR24","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T. St\u00fctzle","year":"2000","unstructured":"T. St\u00fctzle and H. H. Hoos, \u201cThe MAX-MIN ant system,\u201d Future Generation Computer Systems, vol. 16, pp. 889\u2013914, 2000.","journal-title":"Future Generation Computer Systems"},{"key":"5103873_CR25","unstructured":"http:\/\/mscmga.ms.ic.ac.uk\/jeb\/orlib\/wtinfo.html."},{"key":"5103873_CR26","unstructured":"http:\/\/www.bwl.uni-kiel.de \/Prod\/psplib\/index.html."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020936909085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1020936909085\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1020936909085.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T21:04:27Z","timestamp":1754427867000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1020936909085"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,12]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,12]]}},"alternative-id":["5103873"],"URL":"https:\/\/doi.org\/10.1023\/a:1020936909085","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,12]]}}}