Evolutionary computation in combinatorial optimization. 4th European conference, EvoCOP 2004, Coimbra, Portugal, April 5--7, 2004. Proceedings. (Q1888944)

The articles of this volume will be reviewed individually. Indexed articles: \textit{Acan, Adnan}, Mutation multiplicity in a panmictic two-strategy genetic algorithm, 1-10 [Zbl 1177.68180] \textit{Alba, Enrique; Dorronsoro, Bernabé}, Solving the vehicle routing problem by using cellular genetic algorithms, 11-20 [Zbl 1177.90331] \textit{Bierwirth, Christian; Mattfeld, Dirk Christian; Watson, Jean-Paul}, Landscape regularity and random walks for the job-shop scheduling problem, 21-30 [Zbl 1177.90144] \textit{Boomsma, Wouter}, A comparison of adaptive operator scheduling methods on the traveling salesman problem, 31-40 [Zbl 1177.90145] \textit{Brugger, Boris; Doerner, Karl F.; Hartl, Richard F.; Reimann, Marc}, Antpacking -- an ant colony optimization approach for the one-dimensional bin packing problem, 41-50 [Zbl 1177.90414] \textit{Cotta, Carlos}, Scatter search and memetic approaches to the error correcting code problem, 51-61 [Zbl 1177.90337] \textit{Demiroz, Betul; Topcuoglu, Haluk; Kandemir, Mahmut}, A hybrid evolutionary algorithm for solving the register allocation problem, 62-71 [Zbl 1177.90416] \textit{Doerner, Karl F.; Hartl, Richard F.; Kiechle, Guenter; Lucka, Maria; Reimann, Marc}, Parallel ant systems for the capacitated vehicle routing problem, 72-83 [Zbl 1177.90338] \textit{Duarte, Abraham; Fernández, Felipe; Sánchez, Ángel; Sanz, Antonio}, A hierarchical social metaheuristic for the max-cut problem, 84-94 [Zbl 1177.90417] \textit{English, Thomas}, On the structure of sequential search: beyond ``no free lunch'', 95-103 [Zbl 1177.68183] \textit{Gomes, Alvaro; Antunes, Carlos Henggeler; Martins, Antonio Gomes}, Dealing with solution diversity in an EA for multiple objective decision support -- a case study, 104-113 [Zbl 1177.68185] \textit{van Hemert, Jano I.; Solnon, Christine}, A study into ant colony optimisation, evolutionary computation and constraint programming on binary constraint satisfaction problems, 114-123 [Zbl 1177.90428] \textit{Juhos, István; Tóth, Attila; van Hemert, Jano I.}, Binary merge model representation of the graph colouring problem, 124-134 [Zbl 1177.68189] \textit{Kostuch, Philipp; Socha, Krzysztof}, Hardness prediction for the university course timetabling problem, 135-144 [Zbl 1177.68191] \textit{Li, Hui; Zhang, Qingfu; Tsang, Edward; Ford, John A.}, Hybrid estimation of distribution algorithm for multiobjective knapsack problem, 145-154 [Zbl 1177.90420] \textit{Pérez, Melquíades Pérez; Rodríguez, Francisco Almeida; Moreno Vega, J. Marcos}, On the use of path relinking for the \(\rho\)-hub median problem, 155-164 [Zbl 1177.90251] \textit{Puchinger, Jakob; Raidl, Günther R.; Koller, Gabriele}, Solving a real-world glass cutting problem, 165-176 [Zbl 1177.90439] \textit{Reichelt, Dirk; Rothlauf, Franz; Gmilkowsky, Peter}, Designing reliable communication networks with a genetic algorithm using a repair heuristic, 177-187 [Zbl 1177.90073] \textit{Sa'adah, Samer; Ross, Peter; Paechter, Ben}, Improving vehicle routing using a customer waiting time colony, 188-198 [Zbl 1177.90422] \textit{Stützle, Thomas; Fernandes, Susana}, New benchmark instances for the QAP and the experimental analysis of algorithms, 199-209 [Zbl 1177.90424] \textit{Ting, Chuan-Kang}, Improving edge recombination through alternate inheritance and greedy manner, 210-219 [Zbl 1177.90426] \textit{Vermeulen-Jourdan, Laetitia; Dhaenens, Clarisse; Talbi, El-Ghazali}, Clustering nominal and numerical data: a new distance concept for a hybrid genetic algorithm, 220-229 [Zbl 1177.90427] \textit{Weinberg, Benjamin; Talbi, El-Ghazali}, On search space symmetry in partitioning problems, 230-240 [Zbl 1177.68195]