EvoCOP 2008: Naples, Italy

• Isabelle Devarenne, Hakim Mabed, Alexandre Caminada:
  Adaptive Tabu Tenure Computation in Local Search. 1-12
  
• Bart G. W. Craenen, Ben Paechter:
  A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems. 13-24
  
• Ammar W. Mohemmed, Mengjie Zhang, Nirod Chandra Sahoo:
  Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem. 25-35
  
• Bin Hu, Günther R. Raidl:
  Effective Neighborhood Structures for the Generalized Traveling Salesman Problem. 36-47
  
• Yuichi Nagata, Olli Bräysy:
  Efficient Local Search Limitation Strategies for Vehicle Routing Problems. 48-60
  
• Steffen Wolf, Peter Merz:
  Evolutionary Local Search for the Minimum Energy Broadcast Problem. 61-72
  
• Celso Y. Ishida, Andre B. de Carvalho, Aurora Trinidad Ramirez Pozo, Elizabeth Ferreira Gouvea Goldbarg, Marco César Goldbarg:
  Exploring Multi-objective PSO and GRASP-PR for Rule Induction. 73-84
  
• Christian Blum, Joaquín Bautista, Jordi Pereira:
  An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem. 85-96
  
• István Juhos, Jano I. van Hemert:
  Graph Colouring Heuristics Guided by Higher Order Graph Properties. 97-109
  
• Geraldo R. Mauri, Alexandre C. M. Oliveira, Luiz Antonio Nogueira Lorena:
  A Hybrid Column Generation Approach for the Berth Allocation Problem. 110-122
  
• Antonio Augusto Chaves, Luiz Antonio Nogueira Lorena:
  Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem. 123-134
  
• Anand Subramanian, Lucídio dos Anjos Formiga Cabral:
  An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit. 135-146
  
• Rui Zhang, Cheng Wu:
  An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem. 147-157
  
• Kerstin Bauer, Thomas Fischer, Sven Oliver Krumke, Katharina Gerhardt, Stephan Westphal, Peter Merz:
  Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem. 158-169
  
• Keshav P. Dahal, Stephen Remde, Peter I. Cowling, Nic Colledge:
  Improving Metaheuristic Performance by Evolving a Variable Fitness Function. 170-181
  
• Lourdes Araujo, José R. Pérez-Agüera:
  Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach. 182-193
  
• Mohamed Bahy Bader-El-Den, Riccardo Poli:
  Inc*: An Incremental Approach for Improving Local Search Heuristics. 194-205
  
• Arnaud Liefooghe, Laetitia Jourdan, Matthieu Basseur, El-Ghazali Talbi, Edmund K. Burke:
  Metaheuristics for the Bi-objective Ring Star Problem. 206-217
  
• Jirí Kubalík, Richard Mordinyi, Stefan Biffl:
  Multiobjective Prototype Optimization with Evolved Improvement Steps. 218-229
  
• Laura Diosan, Alexandrina Rogozan, Jean-Pierre Pécuchet:
  Optimising Multiple Kernels for SVM by Genetic Programming. 230-241
  
• Luigi Troiano, Cosimo Birtolo, Roberto Armenise, Gennaro Cirillo:
  Optimization of Menu Layouts by Means of Genetic Algorithms. 242-253
  
• Hideki Hashimoto, Mutsunori Yagiura:
  A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows. 254-265
  
• Renaud Lenne, Christine Solnon, Thomas Stützle, Eric Tannier, Mauro Birattari:
  Reactive Stochastic Local Search Algorithms for the Genomic Median Problem. 266-276
  
• Noureddine Bouhmala, Ole-Christoffer Granmo:
  Solving Graph Coloring Problems Using Learning Automata. 277-288
  

Last update Fri May 25 05:59:56 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page