{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T20:40:08Z","timestamp":1743972008674,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306648"},{"type":"electronic","value":"9783642306655"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-30665-5_15","type":"book-chapter","created":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T08:06:27Z","timestamp":1344672387000},"page":"341-369","source":"Crossref","is-referenced-by-count":0,"title":["Insect Swarm Algorithms for Dynamic MAX-SAT Problems"],"prefix":"10.1007","author":[{"given":"Pedro C.","family":"Pinto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas A.","family":"Runkler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jo\u00e3o M. C.","family":"Sousa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Battiti, R., Protasi, M.: Reactive search, a history-based heuristic for MAX-SAT. ACM Journal of Experimental Algorithmics\u00a02 (1997)","DOI":"10.1145\/264216.264220"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1109\/TSMCB.2003.821450","volume":"34","author":"C. Blum","year":"2004","unstructured":"Blum, C., Dorigo, M.: The hyper-cube framework for ant colony optimization. IEEE Transactions on Systems, Man, and Cybernetics-Part B\u00a034(2), 1161\u20131172 (2004)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-642-18965-4_9","volume-title":"Advances in Evolutionary Computing: Theory and Applications","author":"J. Branke","year":"2003","unstructured":"Branke, J., Schmeck, H.: Designing evolutionary algorithms for dynamic optimization problems. In: Advances in Evolutionary Computing: Theory and Applications, pp. 239\u2013262. Springer-Verlag New York, Inc., New York (2003)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Cadoli, M., Schaerf, A.: Compiling problem specifications into SAT. In: Programming Languages and Systems, pp. 387\u2013401 (2001)","DOI":"10.1007\/3-540-45309-1_26"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1002\/bs.3830190604","volume":"19","author":"I.D. Chase","year":"1974","unstructured":"Chase, I.D.: Models of hierarchy formation in animal societies. Behavioral Sciences\u00a019, 374\u2013382 (1974)","journal-title":"Behavioral Sciences"},{"key":"15_CR6","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sidney, Australia, pp. 331\u2013337 (1991)"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Cicirello, V.A., Smith, S.F.: Ant colony for autonomous decentralized shop floor routing. In: Proceedings of the 5th International Symposium on Autonomous Decentralized Systems, pp. 383\u2013390 (2001)","DOI":"10.1109\/ISADS.2001.917443"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Cicirello, V.A., Smith, S.F.: Wasp nests for self-configurable factories. In: Agents 2001, Proceedings of the 5th International Conference on Autonomous Agents, pp. 473\u2013480. ACM Press (2001)","DOI":"10.1145\/375735.376420"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/B:AGNT.0000018807.12771.60","volume":"8","author":"V.A. Cicirello","year":"2004","unstructured":"Cicirello, V.A., Smith, S.F.: Wasp-like agents for distributed factory coordination. Autonomous Agents and Multi-agent systems\u00a08, 237\u2013266 (2004)","journal-title":"Autonomous Agents and Multi-agent systems"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proceedings of the Third Annual ACM Symposium on Theory of Computing","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing, pp. 151\u2013158. ACM, New York (1971)"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B\u00a026(1), 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Dorigo, M., St\u00fctzle, T.: Ant Colony Optimization. MIT Press (2004)","DOI":"10.7551\/mitpress\/1290.001.0001"},{"key":"15_CR13","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of $\\mathcal{NP}$-Completeness. WH Freeman Publishers (1979)"},{"key":"15_CR14","volume-title":"Tabu search","author":"F. Glover","year":"1993","unstructured":"Glover, F., Laguna, M.: Tabu search. John Wiley & Sons, Insc., New York (1993)"},{"key":"15_CR15","unstructured":"Goodrich, M.T., Tamassia, R.: Algorithm Design - Foundations, Analysis, and Internet Examples. John Wiley & Sons, Inc. (2001)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02223791","volume":"6","author":"P. Grasse","year":"1959","unstructured":"Grasse, P.: La reconstruction du nid et les coordinations inter-individuelles chez bellicositermes natalensis et cubitermes sp. la theorie de la stigmergie: Essai d\u2019interpretation du comportement des termites constructeurs. Insectes Sociaux\u00a06, 41\u201381 (1959)","journal-title":"Insectes Sociaux"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Hartmann, S.A., Runkler, T.A.: Online optimization of a color sorting assembly buffer using ant colony optimization. In: Proceedings of the Operations Research Conference, pp. 415\u2013420 (2007)","DOI":"10.1007\/978-3-540-77903-2_64"},{"key":"15_CR18","unstructured":"Hoos, H.H., O\u2019Neill, K.: Stochastic local search methods for dynamic SAT - an initial investigation. In: Leveraging Probability and Uncertainty in Computation, Austin, Texas, pp. 22\u201326. AAAI Press (2000)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Hoos, H.H., St\u00fctzle, T.: Local search algorithms for SAT: an empirical evaluation. In: Journal of Automated Reasoning, special Issue \u201d SAT 2000\u201d, pp. 421\u2013481 (1999)","DOI":"10.1023\/A:1006350622830"},{"issue":"4598","key":"15_CR20","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"1","key":"15_CR21","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TSMCB.2005.852980","volume":"36","author":"J. Liu","year":"2006","unstructured":"Liu, J., Zhong, W., Jiao, L.: A multiagent evolutionary algorithm for constraint satisfaction problems. IEEE Transactions on Systems, Man, and Cybernetics-Part B\u00a036(1), 54\u201373 (2006)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"McGill, R., Tukey, J.W., Larsen, W.A.: Variations of Boxplots. In: The American Statistician, pp. 12\u201316. American Statistical Association (1978)","DOI":"10.1080\/00031305.1978.10479236"},{"issue":"1-2","key":"15_CR23","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1023\/A:1006343127545","volume":"24","author":"P. Mills","year":"2000","unstructured":"Mills, P., Tsang, E.: Guided local search for solving SAT and weighted MAX-SAT problems. Journal Automated Reasoning\u00a024(1-2), 205\u2013223 (2000)","journal-title":"Journal Automated Reasoning"},{"key":"15_CR24","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: 10th National Conference on Artificial Intelligence, San Jose, CA, pp. 459\u2013465 (1992)"},{"key":"15_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/11889205_42","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"N. Tamura","year":"2006","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling Finite Linear CSP into SAT. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 590\u2013603. Springer, Heidelberg (2006)"},{"key":"15_CR26","unstructured":"Pimont, S., Solnon, C.: A generic ant algorithm for solving constraint satisfaction problems. In: 2th International Workshop on Ant Algorithms, Brussels, Belgium, pp. 100\u2013108 (2000)"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Pinto, P., Runkler, T.A., Sousa, J.M.C.: Wasp swarm optimization of logistic systems. In: Ribeiro, et al. (eds.) Adaptive and Natural Computing Algorithms, 7th International Conference on Adaptive and Natural Computing Algorithms, Coimbra, Portugal, pp. 264\u2013267. Springer, NewYork (2005)","DOI":"10.1007\/3-211-27389-1_63"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Pinto, P., Runkler, T.A., Sousa, J.M.C.: Ant colony optimization and its application to regular and dynamic MAX-SAT problems. In: Advances in Biologically Inspired Information Systems: Models, Methods, and Tools, pp. 283\u2013302 (2007)","DOI":"10.1007\/978-3-540-72693-7_15"},{"key":"15_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-540-71618-1_39","volume-title":"Adaptive and Natural Computing Algorithms","author":"P.C. Pinto","year":"2007","unstructured":"Pinto, P.C., Runkler, T.A., Sousa, J.M.C.: Wasp Swarm Algorithm for Dynamic MAX-SAT Problems. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds.) ICANNGA 2007. LNCS, vol.\u00a04431, pp. 350\u2013357. Springer, Heidelberg (2007)"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Resende, M.G.C., Pitsoulis, L.S., Pardalos, P.M.: Approximate solution of weighted MAX-SAT problems using GRASP. In: Satisfiability Problem: Theory and Applications. DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol.\u00a035, pp. 393\u2013405. American Mathematical Society (1997)","DOI":"10.1090\/dimacs\/035\/11"},{"key":"15_CR31","unstructured":"Roli, A., Blum, C., Dorigo, M.: ACO for maximal constraint satisfaction problems. In: Metaheuristics International Conference, pp. 187\u2013192 (2001)"},{"issue":"2","key":"15_CR32","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/j.ejor.2008.11.021","volume":"199","author":"C.A. Silva","year":"2009","unstructured":"Silva, C.A., Runkler, T.A., Sousa, J.M.C., S\u00e1 da Costa, J.M.G.: Distributed supply chain management using ant colony optimization. European Journal of Operational Research\u00a0199(2), 349\u2013358 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"15_CR33","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1080\/00207720600784452","volume":"37","author":"C.A. Silva","year":"2006","unstructured":"Silva, C.A., Sousa, J.M.C., Runkler, T.A., S\u00e1 da Costa, J.: Distributed optimization of logistic systems and its suppliers using ant colony optimization. International Journal of Systems Science\u00a037(8), 503\u2013512 (2006)","journal-title":"International Journal of Systems Science"},{"key":"15_CR34","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-44886-1_12","volume-title":"Advances in Artificial Intelligence","author":"K. Smyth","year":"2003","unstructured":"Smyth, K., Hoos, H., St\u00fctzle, T.: Iterated Robust Tabu Search for MAX-SAT. In: Xiang, Y., Chaib-draa, B. (eds.) Canadian AI 2003. LNCS (LNAI), vol.\u00a02671, pp. 129\u2013144. Springer, Heidelberg (2003)"},{"key":"15_CR35","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/TEVC.2002.802449","volume":"6","author":"C. Solnon","year":"2002","unstructured":"Solnon, C.: Ants can solve constraint satisfaction problems. IEEE Transactions on Evolutionary Computation\u00a06, 347\u2013357 (2002)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"15_CR36","unstructured":"St\u00fctzle, T., Hoos, H.H.: The max-min ant system and local search for the traveling salesman problem. In: Proceedings of the 4th International Conference on Evolutionary Computation, vol.\u00a08, pp. 308\u2013313. IEEE Press (1997)"},{"key":"15_CR37","doi-asserted-by":"crossref","unstructured":"St\u00fctzle, T., L\u00f3pez-Ib\u00e1nez, M., Dorigo, M.: A Concise Overview of Applications of Ant Colony Optimization. In: Wiley Encyclopedia of Operations Research and Management Science. John Wiley & Sons (2011)","DOI":"10.1002\/9780470400531.eorms0001"},{"key":"15_CR38","doi-asserted-by":"crossref","unstructured":"Theraulaz, G., Goss, S., Gervet, J., Deneubourg, J.L.: Task differentiation in polistes wasps colonies: A model for self-organizing groups of robots. In: From Animals to Animats: Proceedings of the 1st International Conference on Simulation of Adaptive Behavior, pp. 346\u2013355. MIT Press (1991)","DOI":"10.7551\/mitpress\/3115.003.0047"},{"key":"15_CR39","unstructured":"St\u00fctzle, T., Hoos, H., Roli, A.: A review of the literature on local search algorithms for MAX-SAT. Technical report aida-01-02. Technical report, Technische Universit\u00e4t Darmstadt (2006)"},{"issue":"6","key":"15_CR40","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1109\/TSMCB.2009.2015281","volume":"39","author":"H. Wang","year":"2009","unstructured":"Wang, H., Yang, S., Ip, W., Wang, D.: IEEE Transactions on Systems, Man, and Cybernetics-Part B\u00a039(6), 1348\u20131361 (2009)","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics-Part B"},{"key":"15_CR41","unstructured":"Wilson, E.O.: The insect societies. Harvard University Press (1971)"},{"key":"15_CR42","unstructured":"Winston, W., Goldberg, J.: Operations Research: Applications and Algorithms. Cengage Learning, 4th edn. (2003)"},{"key":"15_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/3-540-45578-7_11","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"W. Zhang","year":"2001","unstructured":"Zhang, W.: Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 153\u2013167. Springer, Heidelberg (2001)"}],"container-title":["Studies in Computational Intelligence","Metaheuristics for Dynamic Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30665-5_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T20:08:50Z","timestamp":1743970130000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30665-5_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642306648","9783642306655"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30665-5_15","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}