Abstract is missing.
- A Hyper-heuristic with a Round Robin Neighbourhood SelectionAhmed Kheiri, Ender Özcan. 1-12 [doi]
- A Multiobjective Approach Based on the Law of Gravity and Mass Interactions for Optimizing NetworksAlvaro Rubio-Largo, Miguel A. Vega-Rodríguez. 13-24 [doi]
- A Multi-objective Feature Selection Approach Based on Binary PSO and Rough Set TheoryLiam Cervante, Bing Xue, Lin Shang, Mengjie Zhang. 25-36 [doi]
- A New Crossover for Solving Constraint Satisfaction ProblemsReza Abbasian, Malek Mouhoub. 37-48 [doi]
- A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative CostsWei Xiao, Wenqing Chu, Zhipeng Lü, Tao Ye, Guang Liu, Shanshan Cui. 49-60 [doi]
- A Study of Adaptive Perturbation Strategy for Iterated Local SearchUna Benlic, Jin-Kao Hao. 61-72 [doi]
- Adaptive MOEA/D for QoS-Based Web Service CompositionMihai Alexandru Suciu, Denis Pallez, Marcel Cremene, Dumitru Dumitrescu. 73-84 [doi]
- An Analysis of Local Search for the Bi-objective Bidimensional Knapsack ProblemLeonardo C. T. Bezerra, Manuel López-Ibáñez, Thomas Stützle. 85-96 [doi]
- An Artificial Immune System Based Approach for Solving the Nurse Re-rostering ProblemBroos Maenhout, Mario Vanhoucke. 97-108 [doi]
- Automatic Algorithm Selection for the Quadratic Assignment Problem Using Fitness Landscape AnalysisErik Pitzer, Andreas Beham, Michael Affenzeller. 109-120 [doi]
- Balancing Bicycle Sharing Systems: A Variable Neighborhood Search ApproachMarian Rainer-Harbach, Petrina Papazek, Bin Hu, Günther R. Raidl. 121-132 [doi]
- Combinatorial Neighborhood Topology Particle Swarm Optimization Algorithm for the Vehicle Routing ProblemYannis Marinakis, Magdalene Marinaki. 133-144 [doi]
- Dynamic Evolutionary Membrane Algorithm in Dynamic EnvironmentsChuang Liu, Min Han. 145-156 [doi]
- From Sequential to Parallel Local Search for SATAlejandro Arbelaez, Philippe Codognet. 157-168 [doi]
- Generalizing Hyper-heuristics via Apprenticeship LearningShahriar Asta, Ender Özcan, Andrew J. Parkes, A. Sima Etaner-Uyar. 169-178 [doi]
- High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman ProblemYuichi Nagata, Isao Ono. 179-190 [doi]
- Investigating Monte-Carlo Methods on the Weak Schur ProblemShalom Eliahou, Cyril Fonlupt, Jean Fromentin, Virginie Marion-Poty, Denis Robilliard, Fabien Teytaud. 191-201 [doi]
- Multi-objective AI Planning: Comparing Aggregation and Pareto ApproachesMostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant. 202-213 [doi]
- Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape MeasuresMario Ventresca, Beatrice M. Ombuki-Berman, Andrew Runka. 214-225 [doi]
- Single Line Train Scheduling with ACOMarc Reimann, José Eugênio Leal. 226-237 [doi]
- Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu SearchDavid Chalupa. 238-249 [doi]
- Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood DescentJohannes Inführ, Günther R. Raidl. 250-261 [doi]
- The Generate-and-Solve Framework Revisited: Generating by Simulated AnnealingRommel Dias Saraiva, Napoleão Nepomuceno, Plácido Rogério Pinheiro. 262-273 [doi]