Abstract is missing.
- Mutation Multiplicity in a Panmictic Two-Strategy Genetic AlgorithmAdnan Acan. 1-10 [doi]
- Solving the Vehicle Routing Problem by Using Cellular Genetic AlgorithmsEnrique Alba, Bernabé Dorronsoro. 11-20 [doi]
- Landscape Regularity and Random Walks for the Job-Shop Scheduling ProblemChristian Bierwirth, Dirk C. Mattfeld, Jean-Paul Watson. 21-30 [doi]
- A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman ProblemWouter Boomsma. 31-40 [doi]
- AntPacking - An Ant Colony Optimization Approach for the One-Dimensional Bin Packing ProblemBoris Brugger, Karl Doerner, Richard F. Hartl, Marc Reimann. 41-50 [doi]
- Scatter Search and Memetic Approaches to the Error Correcting Code ProblemCarlos Cotta. 51-61 [doi]
- A Hybrid Evolutionary Algorithm for Solving the Register Allocation ProblemBetül Demiröz, Haluk Topcuoglu, Mahmut T. Kandemir. 62-71 [doi]
- Parallel Ant Systems for the Capacitated Vehicle Routing ProblemKarl Doerner, Richard F. Hartl, Guenter Kiechle, Mária Lucká, Marc Reimann. 72-83 [doi]
- A Hierarchical Social Metaheuristic for the Max-Cut ProblemAbraham Duarte, Felipe Fernández, Ángel Sánchez, Antonio Sanz. 84-94 [doi]
- On the Structure of Sequential Search: Beyond No Free Lunch Thomas M. English. 95-103 [doi]
- Dealing with Solution Diversity in an EA for Multiple Objective Decision Support - A Case StudyAlvaro Gomes, Carlos Henggeler Antunes, Antonio Gomes Martins. 104-113 [doi]
- A Study into Ant Colony Optimisation, Evolutionary Computation and Constraint Programming on Binary Constraint Satisfaction ProblemsJano I. van Hemert, Christine Solnon. 114-123 [doi]
- Binary Merge Model Representation of the Graph Colouring ProblemIstván Juhos, Attila Tóth, Jano I. van Hemert. 124-134 [doi]
- Hardness Prediction for the University Course Timetabling ProblemPhilipp Kostuch, Krzysztof Socha. 135-144 [doi]
- Hybrid Estimation of Distribution Algorithm for Multiobjective Knapsack ProblemHui Li, Qingfu Zhang, Edward P. K. Tsang, John A. Ford. 145-154 [doi]
- On the Use of Path Relinking for the rho-Hub Median ProblemMelquíades Pérez Pérez, Francisco Almeida, J. Marcos Moreno-Vega. 155-164 [doi]
- Solving a Real-World Glass Cutting ProblemJakob Puchinger, Günther R. Raidl, Gabriele Koller. 165-176 [doi]
- Designing Reliable Communication Networks with a Genetic Algorithm Using a Repair HeuristicDirk Reichelt, Franz Rothlauf, Peter Gmilkowsky. 177-187 [doi]
- Improving Vehicle Routing Using a Customer Waiting Time ColonySamer Sa adah, Peter Ross, Ben Paechter. 188-198 [doi]
- New Benchmark Instances for the QAP and the Experimental Analysis of AlgorithmsThomas Stützle, Susana Fernandes. 199-209 [doi]
- Improving Edge Recombination through Alternate Inheritance and Greedy MannerChuan-Kang Ting. 210-219 [doi]
- Clustering Nominal and Numerical Data: A New Distance Concept for a Hybrid Genetic AlgorithmLaetitia Vermeulen-Jourdan, Clarisse Dhaenens, El-Ghazali Talbi. 220-229 [doi]
- On Search Space Symmetry in Partitioning ProblemsBenjamin Weinberg, El-Ghazali Talbi. 230-240 [doi]