Metaheuristics Book

	Preface
1	A path relinking algorithm for the generalized assignment problem	1
2	The PROBE metaheuristic for the multiconstraint knapsack problem	19
3	Lagrangian heuristics for the linear ordering problem	37
4	Enhancing MA performance by using matching-based recombination	65
5	Multi-cast ant colony system for the bus routing problem	91
6	Study of genetic algorithms with crossover based on confidence intervals as an alternative to classical least squares estimation methods for nonlinear models	127
7	Variable neighborhood search for nurse rostering problems	153
8	A Potts neural network heuristic for the class/teacher timetabling problem	173
9	Genetic algorithms for the single source capacitated location problem	187
10	An elitist genetic algorithm for multiobjective optimization	217
11	HSF: The iOpt's framework to sasily design metaheuristic methods	237
12	A distance-based selection of parents in genetic algorithms	257
13	Experimental pool design: Input, output and combination strategies for scatter search	279
14	Evolutionary proxy tuning for expensive evaluation functions: A real-case application to petroleum resevoir optimization	301
15	An analysis of solution properties of the graph coloring problem	325
16	Developing classification techniques from biological databases using simulated annealing	347
17	A new look at solving minimax problems with coevolutionary genetic algorithms	369
18	A performance analysis of tabu search for discrete-continuous scheduling problems	385
19	Elements for the description of fitness landscapes associated with local operators for layered drawings of directed graphs	405
20	Training multi layer perceptron network using a genetic algorithm as a global optimizer	421
21	Metaheuristics applied to power systems	449
22	On the behavior of ACO algorithms: Studies on simple problems	465
23	Variable neighborhood search for the k-cardinality tree	481
24	Heuristics for large strip packing problems with guillotine patterns: An empirical study	501
25	Choosing search heuristics by non-stationary reinforcement learning	523
26	GRASP for linear integer programming	545
27	Random start local search and tabu search for a discrete log-sizing and scheduling problem	575
28	New benchmark instances for the Steiner problem in graphs	601
29	A memetic algorithm for communication network design taking into consideration an existing network	615
30	A GRASP heuristic for the capacitated minimum spanning tree problem using a memory-based local search strategy	627
31	A GRASP-tabu search algorithm for school timetabling problems	659
32	A local search approach for the pattern restricted one dimensional cutting stock problem	673
33	An ant system algorithm for the mixed vehicle routing problem with backhauls	699