{"entities":{"Q5931327":{"pageid":8108129,"ns":120,"title":"Item:Q5931327","lastrevid":32555031,"modified":"2024-03-19T23:16:40Z","type":"item","id":"Q5931327","labels":{"en":{"language":"en","value":"Applications of evolutionary computing. Evo Workshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18--20, 2001. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1590891"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5931327$77D63F19-EB36-4B94-AE98-4768E4508693","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"2dae0ee8e28c8f73bd8f80c7b370a3e687975240","datavalue":{"value":{"text":"Applications of evolutionary computing. Evo Workshops 2001: EvoCOP, EvoFlight, EvoIASP, EvoLearn, and EvoSTIM, Como, Italy, April 18--20, 2001. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5931327$1E53C2CF-882C-487F-B281-D9BBE77832EA","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4288303fbecc679213da4d99bdda9416eb105914","datavalue":{"value":"0960.00056","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5931327$28412DCE-D69C-4030-A016-9EA191BF331A","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"2fd1242b3b3c1cd433c1f12f39ef1e68c06b0330","datavalue":{"value":"10.1007/3-540-45365-2","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5931327$BC50679C-A9B8-4F89-98D7-E3FCAEB9FD52","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5931327$DA72117B-A5F9-4E93-A773-716AA060042E","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d92d87602b90dd5642e226e76ae8b030e9d151e1","datavalue":{"value":{"time":"+2001-04-24T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5931327$8AE80A1E-0AF4-4860-9644-8C97A5622B4C","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"e544c99a78dc4ad1e40f3926fb9cc2ce907d18aa","datavalue":{"value":"The articles of mathematical interest will be reviewed individually.  Indexed articles:  \\textit{Gaube, Thomas; Rothlauf, Franz}, The link and node biased encoding revisited: Bias and adjustment of parameters, 1-10 [Zbl 0978.68787]  \\textit{Li, Yu}, An effective implementation of a direct spanning tree representation in GAs, 11-19 [Zbl 0978.68786]  \\textit{Ljubic, Ivana; Raidl, G\u00fcnther R.}, An evolutionary algorithm with stochastic hill-climbing for the edge-biconnectivity augmentation problem, 20-29 [Zbl 0978.68789]  \\textit{Chardaire, Pierre; McKeown, Geoff P.; Maki, Jameel A.}, Application of GRASP to the multiconstraint knapsack problem, 30-39 [Zbl 0978.68569]  \\textit{Levenhagen, Jens; Bortfeldt, Andreas; Gehring, Hermann}, Path tracing in genetic algorithms applied to the multiconstrained knapsack problem, 40-49 [Zbl 0978.68790]  \\textit{Gottlieb, Jens}, On the feasibility problem of penalty-based evolutionary algorithms for knapsack problems, 50-59 [Zbl 0978.68788]  \\textit{Cordone, Roberto; Maffioli, Francesco}, Coloured Ant System and local search to design local telecommunication networks, 60-69 [Zbl 0986.68138]  \\textit{Doerner, Karl; Hartl, Richard F.; Reimann, Marc}, Cooperative ant colonies for optimizing resource allocation in transportation, 70-79 [Zbl 0986.68139]  \\textit{Maniezzo, Vittorio; Carbonaro, Antonella; Golfarelli, Matteo; Rizzi, Stefano}, An ANTS algorithm for optimizing the materialization of fragmented views in data warehouses: preliminary results, 80-89 [Zbl 0978.68727]  \\textit{Meents, Ingo}, A genetic algorithm for the group-technology problem, 90-99 [Zbl 0978.68592]  \\textit{Gregori, Stefano; Rossi, Roberto; Torelli, Guido; Liberali, Valentino}, Generation of optimal unit distance codes for rotary encoders through simulated evolution, 100-109 [Zbl 0978.68739]  \\textit{Poland, Jan; Kn\u00f6dler, Kosmas; Zell, Andreas}, On the efficient construction of rectangular grids from given data points, 110-119 [Zbl 0986.68140]  \\textit{Fotakis, Dimitris A.; Likothanassis, Spiridon D.; Stefanakos, Stamatis K.}, An evolutionary annealing approach to graph coloring, 120-129 [Zbl 0978.68568]  \\textit{Filho, Geraldo Ribeiro; Nogueira Lorena, Luiz Antonio}, A constructive evolutionary approach to school timetabling, 130-139 [Zbl 0978.68564]  \\textit{Weinberg, Benjamin; Bachelet, Vincent; Talbi, El-Ghazali}, A co-evolutionist meta-heuristic for the assignment of the frequencies in cellular networks, 140-149 [Zbl 0978.68572]  \\textit{Din, Der-Rong; Tseng, Shian-Shyong}, A simulated annealing algorithm for extended cell assignment problem in a wireless ATM network, 150-160 [Zbl 0978.90500]  \\textit{Borisovsky, Pavel A.; Eremeev, Anton V.}, On performance estimates for two evolutionary algorithms, 161-171 [Zbl 0978.68122]  \\textit{Lehn, R\u00e9mi; Kuntz, Pascale}, A contribution to the study of the fitness landscape for a graph drawing problem, 172-181 [Zbl 0978.68565]  \\textit{Pelillo, Marcello}, Evolutionary game dynamics in combinatorial optimization: An overview, 182-192 [Zbl 0978.90078]  \\textit{Baraglia, Ranieri; Hidalgo, Jos\u00e9 Ignacio; Perego, Raffaele}, A parallel hybrid heuristic for the TSP, 193-202 [Zbl 0978.68567]  \\textit{Burke, Edmund K.; Cowling, Peter I.; Keuthen, Ralf}, Effective local and guided variable neighbourhood search methods for the asymmetric travelling salesman problem, 203-212 [Zbl 0978.68574]  \\textit{Guntsch, Michael; Middendorf, Martin}, Pheromone modification strategies for ant algorithms applied to dynamic TSP, 213-222 [Zbl 0978.68571]  \\textit{Esquivel, Susana; Gatica, Claudia; Gallard, Ra\u00fal}, Conventional and multirecombinative evolutionary algorithms for the parallel task scheduling problem, 223-232 [Zbl 0978.68573]  \\textit{Smith, Robert E.; Dike, Bruce A.; Ravichandran, B.; El-Fallah, Adel; Mehra, Raman K.}, Two-sided, genetics-based learning to discover novel fighter combat maneuvers, 233-242 [Zbl 0978.68713]  \\textit{Nyongesa, Henry O.}, Generation of time-delay algorithms for anti-air missiles using genetic programming, 243-247 [Zbl 0978.68745]  \\textit{Piazza, Enrico}, Surface movement radar image correlation using genetic algorithm, 248-256 [Zbl 0978.68697]  \\textit{Grosche, Tobias; Heinzl, Armin; Rothlauf, Franz}, A conceptual approach for simultaneous flight schedule construction with genetic algorithms, 257-267 [Zbl 0978.68719]  \\textit{Ballerini, Lucia}, Genetic snakes for color images segmentation, 268-277 [Zbl 0978.68647]  \\textit{Bevilacqua, Alessandro; Campanini, Renato; Lanconelli, Nico}, A distributed genetic algorithm for parameters optimization to detect microcalcifications in digital mammograms, 278-287 [Zbl 0978.68740]  \\textit{Boumaza, Amine M.; Louchet, Jean}, Dynamic flies: Using real-time Parisian evolution in robotics, 288-297 [Zbl 0978.68626]  \\textit{Corno, Fulvio; Cumani, Gianluca; Reorda, Matteo Sonza; Squillero, Giovanni}, ARPIA: A high-level evolutionary test signal generator, 298-306 [Zbl 0978.68607]  \\textit{Ferreira da Silva, Adelino R.}, A pursuit architecture for signal analysis, 307-316 [Zbl 0978.68594]  \\textit{K\u00f6ppen, Mario; Nickolay, Bertram; Treugut, Hendrik}, Genetic algorithm based heuristic measure for pattern similarity in Kirlian photographs, 317-324 [Zbl 0978.68759]  \\textit{L\u00e9vy V\u00e9hel, Jacques; Lutton, Evelyne}, Evolutionary signal enhancement based on H\u00f6lder regularity analysis, 325-334 [Zbl 0983.94009]  \\textit{Minerva, Tommaso; Poli, Irene}, Building ARMA models with genetic algorithms, 335-342 [Zbl 0978.68610]  \\textit{O'Neill, Michael; Brabazon, Anthony; Ryan, Conor; Collins, J. J.}, Evolving market indexing trading rules using grammatical evolution, 343-352 [Zbl 0986.68884]  \\textit{Olague, Gustavo}, Autonomous photogrammetric network design using genetic algorithms, 353-363 [Zbl 0978.68608]  \\textit{Ramos, Vitorino}, The biological concept of neoteny in evolutionary color image segmentation --- simple experiments in simple non-memetic genetic algorithms, 364-373 [Zbl 0978.68744]  \\textit{Spirov, Alexander V.; Timakin, Dmitry L.; Reinitz, John; Kosman, David}, Using of evolutionary computations in image processing for quantitative atlas of drosophila genes expression, 374-383 [Zbl 0978.68722]  \\textit{Delepoulle, Samuel; Preux, Philippe; Darcheville, Jean-Claude}, Selection of behavior in social situations. Application to the development of coordinated movements, 384-393 [Zbl 0978.92500]  \\textit{Hart, Emma; Ross, Peter}, Clustering moving data with a modified immune algorithm, 394-403 [Zbl 0978.68615]  \\textit{Lamma, Evelina; Pereira, Lu\u00eds Moniz; Riguzzi, Fabrizio}, Belief revision by Lamarckian evolution, 404-413 [Zbl 0978.68570]  \\textit{Neri, Filippo}, A study on the effect of cooperative evolution on concept learning, 414-420 [Zbl 0978.68598]  \\textit{Pereira, Francisco B.; Costa, Ernesto}, The influence of learning in the evolution of busy beavers, 421-430 [Zbl 0978.68706]  \\textit{Buf\u00e9, Marc; Fischer, Tim; Gubbels, Holger; H\u00e4cker, Claudius; Hasprich, Oliver; Scheibel, Christian; Weicker, Karsten; Weicker, Nicole; Wenig, Michael; Wolfangel, Christian}, Automated solution of a highly constrained school timetabling problem -- preliminary results, 431-440 [Zbl 0982.90501]  \\textit{den Besten, Matthijs; St\u00fctzle, Thomas; Dorigo, Marco}, Design of iterated local search algorithms. An example application to the single machine total weighted tardiness problem, 441-451 [Zbl 0978.68750]  \\textit{Di Stefano, Calogero; Tettamanzi, Andrea G. B.}, An evolutionary algorithm for solving the school time-tabling problem, 452-462 [Zbl 0986.68886]  \\textit{Gr\u00f6bner, Matthias; Wilke, Peter}, Optimizing employee schedules by a hybrid genetic algorithm, 463-472 [Zbl 0978.68678]  \\textit{Lacomme, Philippe; Prins, Christian; Ramdane-Ch\u00e9rif, Wahiba}, A genetic algorithm for the capacitated arc routing problem and its extensions, 473-483 [Zbl 0978.68566]  \\textit{Merkle, Daniel; Middendorf, Martin}, A new approach to solve permutation scheduling problems with ant colony optimization, 484-494 [Zbl 0986.68889]  \\textit{Urquhart, Neil; Paechter, Ben; Chisholm, Kenneth}, Street-based routing using an evolutionary algorithm, 495-504 [Zbl 0978.68695]  \\textit{Westerberg, C. Henrik; Levine, John}, Investigation of different seeding strategies in a genetic planner, 505-514 [Zbl 0978.68657]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$DF05AA2B-B91C-4E9A-8276-0388719DD3A6","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5931327$1D92FD13-BF77-41AD-AED3-6270A89FF017","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5931327$D242F4EB-5801-4F5A-A444-D178454ECCFF","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"74f7742c6492d01030d9ed9ed64cce4ff20f326f","datavalue":{"value":"1590891","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5931327$4F0B6B4D-75A8-497E-A67C-51E3B8EFE8FE","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"57dabf47b17cff76ff2f451222b1637f8c9bc202","datavalue":{"value":"Como (Italy)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$C9A6A502-68B6-4071-9659-FBC44DBCFE1F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$005E7504-5566-4D95-917B-910DF771F906","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f7c2172f0a2ed6197400daa3f44dae0d79725b1a","datavalue":{"value":"Workshop","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$A33B4327-7695-4F18-AB04-08EF43750523","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"01b19ecf94fcc27a36f3c48a9a167b6810d5caa2","datavalue":{"value":"Evo Workshops 2001","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$06016342-6ABA-4B46-BAEB-08E3294CD7C0","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"8f35386d406b41c48a0fc19e351bd3533a661db4","datavalue":{"value":"EvoCOP","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$78A5D252-C8EA-4E5F-8C7A-7857E5A8C1D8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e21b5fe1d8bc19e448cebe79d82fd016fa96155c","datavalue":{"value":"EvoFlight","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$FA0068C8-B2F1-41C6-90DD-C693622D2CF6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"195cd87950f2c3101b1aed0b868f59feef9849eb","datavalue":{"value":"EvoIASP","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$8A70A6CE-9191-4160-8043-A03FB5953F88","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"238d1fb89bbe70983ae6be4d25552d1bfbe3b466","datavalue":{"value":"EvoLearn","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$9BC7EE27-90B6-4FB8-8A2C-1E3C2711FED6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0cde697daa4ad1f9841b33f0bb4d05f2e7bdfdda","datavalue":{"value":"EvoSTIM","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$C0EBC24E-FEE0-4191-BC45-14C5D6280EC9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"4252516d94c20860b68300a8260707f85c573845","datavalue":{"value":"Evolutionary computing","type":"string"},"datatype":"string"},"type":"statement","id":"Q5931327$0CFD9DDE-6BD2-479D-9853-E45BF3FBA261","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q5931327$67D9D1F2-D7E8-48DC-AFB7-93F6D84985C4","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"bae72dc5de529048974e5b608db130b18679fd6e","datavalue":{"value":"https://doi.org/10.1007/3-540-45365-2","type":"string"},"datatype":"url"},"type":"statement","id":"Q5931327$A298EC7C-47D1-4694-95E1-A9689CF6D3F5","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"dd8e650adca2b42dff79d93f7ad2195383256abb","datavalue":{"value":"W4302356949","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5931327$5825CFEF-5E54-4CD4-8B1C-A80D72B6CBE3","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5931327","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5931327"}}}}}