{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:56:10Z","timestamp":1725486970862},"publisher-location":"Berlin, Heidelberg","reference-count":40,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540726920"},{"type":"electronic","value":"9783540726937"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72693-7_15","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T08:33:29Z","timestamp":1183365209000},"page":"283-302","source":"Crossref","is-referenced-by-count":4,"title":["Ant Colony Optimization and its Application to Regular and Dynamic MAX-SAT Problems"],"prefix":"10.1007","author":[{"given":"Pedro C.","family":"Pinto","sequence":"first","affiliation":[]},{"given":"Thomas A.","family":"Runkler","sequence":"additional","affiliation":[]},{"given":"Jo\u00e3o M. C.","family":"Sousa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1_15","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_CR2_15","unstructured":"Garey, M.R., Johson, D.S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman Publishers (1979)"},{"key":"15_CR3_15","unstructured":"Roli, A., Blum, C., Dorigo, M.: ACO for maximal constraint satisfaction problems. MIC\u20192001 - Metaheuristics International Conference, Porto, Portugal (2001) 187-192"},{"key":"15_CR4_15","unstructured":"Kennedy, J., Eberhart, R.: Swarm intelligence. Morgan Kaufmann Publishers (2001)"},{"key":"15_CR5_15","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/BF02125421","volume":"63","author":"I Osman","year":"1996","unstructured":"Osman, I., Laporte, G.: Metaheuristics: A bibliography. Annals of Operations Research (63)(1996)513-628,","journal-title":"Annals of Operations Research"},{"issue":"3","key":"15_CR6_15","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: \u00a0Metaheuristics in combinatorial optimization: Overview and concep-tual comparison. ACM Compututational Survey 35(3) (2003) 268-308","journal-title":"ACM Compututational Survey"},{"key":"15_CR7_15","first-page":"91","volume-title":"Simulated annealing. In: Local Search in Combinatorial Optimization","author":"EHL Aarts","year":"1997","unstructured":"Aarts, E.H.L., Korst, J.H.M., Laarhoven, P.J.M.V.: \u00a0Simulated annealing. In: Local Search in Combinatorial Optimization. Wiley-Interscience Eds, Chichester, England (1997) 91-120"},{"key":"15_CR8_15","unstructured":"Glover, F., Laguna, M.: Tabu search. (1993) 70-150"},{"key":"15_CR9_15","doi-asserted-by":"crossref","unstructured":"Ramalhinho-Louren\u00e7o, H., Martin, O.C., St\u00fctzle, T.: Iterated local search. (513) (2000)","DOI":"10.2139\/ssrn.273397"},{"key":"15_CR10_15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T Feo","year":"1995","unstructured":"Feo, T., Resende, M.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6 (1995) 109-133","journal-title":"Journal of Global Optimization"},{"key":"15_CR11_15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/B:AGNT.0000018807.12771.60","volume":"8","author":"VA Cicirello","year":"2004","unstructured":"Cicirello, V.A., Smith, S.F.: Wasp-like agents for distributed factory coordination. Autonomous Agents and Multi-agent systems 8 (2004) 237-266","journal-title":"Autonomous Agents and Multi-agent systems"},{"key":"15_CR12_15","unstructured":"Pinto, P., Runkler, T.A., Sousa, J.M.C.: Agent based optimization of the MAX -SAT problem using wasp swarms. Controlo 2006, 7th Portuguese Conference on Automatic Control (2006)"},{"key":"15_CR13_15","doi-asserted-by":"crossref","unstructured":"Pinto, P., Runkler, T.A., Sousa, J.M.C.: Wasp swarm algorithm for dynamic MAX -SAT problems. ICANNGA 2007, 8th International Conference on Adaptive and Natural Com-puting Algorithms (2007)","DOI":"10.1007\/978-3-540-71618-1_39"},{"key":"15_CR14_15","unstructured":"Abbass, H.: An agent based approach to 3-SAT using marriage in honey-bees optimization. International Journal of Knowledge-Based Intelligent Engineering Systems (2002) 1-8"},{"key":"15_CR15_15","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF02223791","volume":"6","author":"PP Grasse","year":"1959","unstructured":"Grasse., P.P.: La reconstruction du nid et les coordinations inter-individuelles chez belli-cositermes natalensis et cubitermes sp. la theorie de la stigmergie: Essai d\u2019interpretation du comportement des termites constructeurs. Insectes Sociaux 6 (1959) 41-81","journal-title":"Insectes Sociaux"},{"key":"15_CR16_15","first-page":"100","volume-title":"A generic ant algorithm for solving constraint satisfaction prob-lems","author":"S Pimont","year":"2000","unstructured":"Pimont, S., Solnon, C.: A generic ant algorithm for solving constraint satisfaction prob-lems. 2nd International Workshop on Ant Algorithms (ANTS 2000), Brussels, Belgium (2000)100-108"},{"key":"15_CR17_15","doi-asserted-by":"crossref","unstructured":"Cicirello, V.A., Smith, S.F.: Ant colony for autonomous decentralized shop floor routing. In: Proceedings of ISADS-2001, Fifth International symposium on autonomous decen-tralized systems. (2001)","DOI":"10.1109\/ISADS.2001.917443"},{"key":"15_CR18_15","first-page":"9","volume-title":"Lecture Notes on Artificial Intelligence 2902, Progress in Artificial Intelligence, 11th Portuguese Conference on Artificial Intelligence","author":"CA Silva","year":"2003","unstructured":"Silva, C.A., Runkler, T.A., Sousa, J.M.C., da Costa, J.M.S.: \u00a0Optimization of logistic processes in supply-chains using meta-heuristics. In Pires, F.M., Abreu, S., eds.: Lecture Notes on Artificial Intelligence 2902, Progress in Artificial Intelligence, 11th Portuguese Conference on Artificial Intelligence. Springer Verlag, Beja, Portugal (2003) 9-23"},{"key":"15_CR19_15","first-page":"76","volume-title":"Ant Algorithms, International Workshop ANTS 2002, Brussels, Belgium. Lecture Notes in Computer Science LNCS 2463","author":"CA Silva","year":"2002","unstructured":"Silva, C.A., Runkler, T.A., Sousa, J.M.C., Palm, R.: Ant colonies as logistic process optimizers. In Dorigo, M., Caro, G.D., Sampels, M., eds.: Ant Algorithms, International Workshop ANTS 2002, Brussels, Belgium. Lecture Notes in Computer Science LNCS 2463, Heidelberg, Springer (2002) 76-87"},{"key":"15_CR20_15","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press (2007)"},{"key":"15_CR21_15","unstructured":"Tsang, E.: Foundations of Constraint Satisfaction. Academic Press (1993)"},{"key":"15_CR22_15","unstructured":"Gennari, R.: Temporal reasoning and constraint programming: A survey (1998)"},{"key":"15_CR23_15","unstructured":"Frei, C., Faltings, B.: Resource allocation and constraint satisfaction techniques. In: CP \u201999: Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming, London, UK, Springer-Verlag (1999) 204-218"},{"key":"15_CR24_15","unstructured":"Cesta, A., Cortellessa, G., Oddi, A., Policella, N., Susi, A.: A constraint-based archi-tecture for flexible support to activity scheduling. In: AI*IA 01: Proceedings of the 7th Congress of the Italian Association for Artificial Intelligence on Advances in Artificial Intelligence, London, UK, Springer-Verlag (2001) 369-381"},{"key":"15_CR25_15","unstructured":"Abril, M., Salido, M.A., Barber, F., Ingolotti, L.: Distributed constraint satisfaction prob-lems to model railway scheduling problems. ICAPS 2006 Workshop on Constraint Satis-faction Techniques for Planning and Scheduling Problems, Cumbria (England) (2006)"},{"key":"15_CR26_15","unstructured":"Rasconi, R., Policella, N., Cesta, A.: Fix the schedule or solve again - comparing constraint-based approaches to schedule execution. In: Proceedings of the ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems. (2006)"},{"key":"15_CR27_15","unstructured":"Goodrich, M.T., Tamassia, R.: Algorithm Design - Foundations, Analysis, and Internet Examples. John Wiley & Sons, Inc. (2001)"},{"key":"15_CR28_15","unstructured":"Zhang, W.: Phase transitions and backbones of 3-SAT and maximum 3-SAT. In: Princi-ples and Practice of Constraint Programming. (2001) 153-167"},{"key":"15_CR29_15","unstructured":"Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Pro-ceedings of the Twelfth International Joint Conference on Artificial Intelligence, IJCAI-91, Sidney, Australia. (1991) 331-337"},{"key":"15_CR30_15","first-page":"459","volume-title":"Hard and easy distributions of SAT problems","author":"D Mitchell","year":"1992","unstructured":"Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In: 10-th National Conf. on Artificial Intelligence (AAAI-92), San Jose, CA (1992) 459-465"},{"key":"15_CR31_15","doi-asserted-by":"crossref","unstructured":"Mertens, K., Holvoet, T., Berbers, Y.: The dynCOAA algorithm for dynamic constraint optimization problems. In Weiss, G., Stone, Peter, e., eds.: Proceedings of the Fifth International Joint Conference on Autonomous Agents and MultiAgent Systems. (2006) 1421-1423","DOI":"10.1145\/1160633.1160898"},{"key":"15_CR32_15","unstructured":"Mertens, K., Holvoet, T., Berbers, Y.: Which dynamic constraint problems can be solved by ants. In Sutcliffe, G., Goebel, Randy, E., eds.: Proceedings of The 19th International FLAIRS Conference. (2006) 439-444"},{"key":"15_CR33_15","doi-asserted-by":"publisher","first-page":"1049","DOI":"10.1145\/1082473.1082632","volume-title":"AAMAS \u201905: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems","author":"R Mailler","year":"2005","unstructured":"Mailler, R.: Comparing two approaches to dynamic, distributed constraint satisfaction. In: AAMAS \u201905: Proceedings of the Fourth International Joint Conference on Autonomous Agents and Multiagent Systems, New York, NY, USA, ACM Press (2005) 1049-1056"},{"key":"15_CR34_15","first-page":"22","volume-title":"Stochastic local search methods for dynamic SAT - an initial investigation","author":"HH Hoos","year":"2000","unstructured":"Hoos, H.H., O\u2019Neill, K.: Stochastic local search methods for dynamic SAT - an initial investigation. AAAI-2000 Workshop \u201cLeveraging Probability and Uncertainty in Com-putation\u201d, Austin, Texas (2000) 22-26"},{"key":"15_CR35_15","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 Evo-lutionary Computation 6 (2002) 347-357","journal-title":"IEEE Transactions on Evo-lutionary Computation"},{"key":"15_CR36_15","doi-asserted-by":"crossref","unstructured":"Battiti, R., Protasi, M.: Reactive search, a history-based heuristic for MAX -SAT. ACM Journal of Experimental Algorithmics 2 (1997)","DOI":"10.1145\/264216.264220"},{"key":"15_CR37_15","doi-asserted-by":"crossref","unstructured":"Johnson, D., Trick, M.: Cliques, coloring, and satisfiability: Second DIMACS implemen-tation challenge. DIMACS Series in Discrete Mathematics and Theoretical Computer Science (1996)","DOI":"10.1090\/dimacs\/026"},{"key":"15_CR38_15","unstructured":"Hoos, H.H., St\u00fctzle, T.: SATLIB: An online resource for research on SAT. SAT 2000 (2000)283-292"},{"key":"15_CR39_15","unstructured":"Hoos, H.H., St\u00fctzle, T.: Local search algorithms for SAT: an empirical evaluation. Journal of Automated Reasoning, special Issue \u201cSAT 2000\u201d (1999) 421-481"},{"key":"15_CR40_15","first-page":"279","volume":"44","author":"K Smyth","year":"2003","unstructured":"Smyth, K., Hoos, H.H., St\u00fctzle, T.: Iterated robust tabu search for MAX -SAT. Lecture Notes in Computer Science, Springer Verlag 44 (2003) 279-303","journal-title":"Lecture Notes in Computer Science, Springer Verlag"}],"container-title":["Studies in Computational Intelligence","Advances in Biologically Inspired Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72693-7_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:45:38Z","timestamp":1619516738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72693-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540726920","9783540726937"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72693-7_15","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2007]]}}}