{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T11:18:46Z","timestamp":1774437526593,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540417453","type":"print"},{"value":"9783540447191","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44719-9_25","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T20:42:59Z","timestamp":1267476179000},"page":"359-372","source":"Crossref","is-referenced-by-count":128,"title":["Bi-Criterion Optimization with Multi Colony Ant Algorithms"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Iredi","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Merkle","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Middendorf","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,7,6]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"A. Bauer, B. Bullnheimer, R. Hartl, and C. Strauss. An ant colony optimization approach for the single machine total tardiness problem. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC99), 6-9 July Washington D.C., USA, pages 1445\u20131450, 1999.","DOI":"10.1109\/CEC.1999.782653"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1287\/ijoc.10.3.341","volume":"10","author":"H. Crauwels","year":"1998","unstructured":"H. Crauwels, C. Potts, and L. V. Wassenhove. Local search heuristics for the single machine total weighted tardiness scheduling problem. Informs Journal on Computing, 10:341\u2013350, 1998.","journal-title":"Informs Journal on Computing"},{"key":"25_CR3","unstructured":"M. den Besten, T. St\u00fctzle, and M. Dorigo. Scheduling single machines by ants. Technical Report IRIDIA\/99\u201316, IRIDIA, Universit\u00e9 Libre de Bruxelles, Belgium, 1999."},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"M. Dorigo and G. Di Caro. The ant colony optimization meta-heuristic. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 11\u201332, London, 1999. McGraw-Hill.","DOI":"10.1109\/CEC.1999.782657"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J. Du","year":"1990","unstructured":"J. Du and J.-T. Leung. Minimizing total tardiness on one machine is NP-hard. MOR: Mathematics of Operations Research, 15:483\u2013496, 1990.","journal-title":"MOR: Mathematics of Operations Research"},{"key":"25_CR6","unstructured":"C. Gagn\u00e9, M. Gravel, and W. Price. Scheduling a single machine where setup times are sequence dependent using an ant-colony heuristic. In Abstract Proceedings of ANTS\u20192000, 7.-9. September Brussels, Belgium, pages 157\u2013160, 2000."},{"key":"25_CR7","unstructured":"L. M. Gambardella, \u00c9. Taillard, and G. Agazzi. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In D. Corne, M. Dorigo, and F. Glover, editors, New Ideas in Optimization, pages 63\u201376. McGraw-Hill, London, 1999."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"E. Lawler. A \u2018pseudopolynomial\u2019 algorithm for sequencing jobs to minimize total tardiness. Annals of Discrete Mathematics, pages 331\u2013342, 1977.","DOI":"10.1016\/S0167-5060(08)70742-8"},{"key":"25_CR9","unstructured":"C. E. Mariano and E. Morales. MOAQ an ant-Q algorithm for multiple objective optimization problems. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference, volume 1, pages 894\u2013901, Orlando, Florida, USA, 13-17 July 1999. Morgan Kaufmann."},{"key":"25_CR10","series-title":"Lect Notes Comput Sci","first-page":"287","volume-title":"An ant algorithm with a new pheromone evaluation rule for total tardiness problems","author":"D. Merkle","year":"2000","unstructured":"D. Merkle and M. Middendorf. An ant algorithm with a new pheromone evaluation rule for total tardiness problems. In Proceeding of the EvoWorkshops 2000, number 1803 in Lecture Notes in Computer Science, pages 287\u2013296. Springer Verlag, 2000."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"D. Merkle, M. Middendorf, and H. Schmeck. Pheromone evaluation in ant colony optimization. IEEE Press, 2000. to appear in: Proceeding of the Third AsiaPacific Conference on Simulated Evolution and Learning (SEAL2000), Nagoya, Japan, 25-27 Oct. 2000.","DOI":"10.1109\/IECON.2000.972429"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"M. Middendorf, F. Reischle, and H. Schmeck. Information exchange in multi colony ant algorithms. In SPDP: IEEE Symposium on Parallel and Distributed Processing. ACM Special Interest Group on Computer Architecture (SIGARCH), and IEEE Computer Society, 2000.","DOI":"10.1007\/3-540-45591-4_87"},{"issue":"2","key":"25_CR13","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1162\/106365600568158","volume":"8","author":"D. A. V. Veldhuizen","year":"2000","unstructured":"D. A. V. Veldhuizen and G. B. Lamont. Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art. Evolutionary Computation, 8(2):125\u2013147, 2000.","journal-title":"Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Multi-Criterion Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44719-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T02:46:43Z","timestamp":1551062803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44719-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540417453","9783540447191"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44719-9_25","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}