Evolutionary Computation in Combinatorial Optimization : 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013. Proceedings

This book constitutes the refereed proceedings of the 13th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2013, held in Vienna, Austria, in April 2013, colocated with the Evo* 2013 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. The 23 revised full paper...

Description complète

Enregistré dans:
Détails bibliographiques
Auteurs principaux : Middendorf Martin (Directeur de publication), Blum Christian (Directeur de publication), European conference on evolutionary computation in combinatorial optimization
Collectivité auteur : European conference on evolutionary computation in combinatorial optimization 13 2013 Vienne (Auteur)
Format : Livre
Langue : anglais
Titre complet : Evolutionary Computation in Combinatorial Optimization : 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013. Proceedings / edited by Martin Middendorf, Christian Blum.
Publié : Berlin, Heidelberg : Springer Berlin Heidelberg , [20..]
Cham : Springer Nature
Collection : Theoretical computer science and general issues (Online) ; 7832
Accès en ligne : Accès Nantes Université
Accès direct soit depuis les campus via le réseau ou le wifi eduroam soit à distance avec un compte @etu.univ-nantes.fr ou @univ-nantes.fr
Note sur l'URL : Accès sur la plateforme de l'éditeur
Accès sur la plateforme de l'éditeur (Springer)
Accès sur la plateforme Istex
Condition d'utilisation et de reproduction : Conditions particulières de réutilisation pour les bénéficiaires des licences nationales : https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017
Sujets :
Documents associés : Autre format: Evolutionary Computation in Combinatorial Optimization
Autre format: Evolutionary Computation in Combinatorial Optimization
LEADER 06233clm a2200685 4500
001 PPN169140067
003 http://www.sudoc.fr/169140067
005 20241001155300.0
010 |a 978-3-642-37198-1 
017 7 0 |a 10.1007/978-3-642-37198-1  |2 DOI 
035 |a (OCoLC)846890140 
035 |a Springer978-3-642-37198-1 
035 |a SPRINGER_EBOOKS_LN_PLURI_10.1007/978-3-642-37198-1 
035 |a Springer-11645-978-3-642-37198-1 
100 |a 20130507f20 u |0frey0103 ba 
101 0 |a eng  |2 639-2 
102 |a DE 
135 |a dr||||||||||| 
181 |6 z01  |c txt  |2 rdacontent 
181 1 |6 z01  |a i#  |b xxxe## 
182 |6 z01  |c c  |2 rdamedia 
182 1 |6 z01  |a b 
183 |6 z01  |a ceb  |2 RDAfrCarrier 
200 1 |a Evolutionary Computation in Combinatorial Optimization  |e 13th European Conference, EvoCOP 2013, Vienna, Austria, April 3-5, 2013. Proceedings  |f edited by Martin Middendorf, Christian Blum. 
214 0 |a Berlin, Heidelberg  |c Springer Berlin Heidelberg 
214 2 |a Cham  |c Springer Nature  |d [20..] 
225 0 |a Theoretical Computer Science and General Issues  |x 2512-2029  |v 7832 
330 |a This book constitutes the refereed proceedings of the 13th European Conference on Evolutionary Computation in Combinatorial Optimization, EvoCOP 2013, held in Vienna, Austria, in April 2013, colocated with the Evo* 2013 events EuroGP, EvoBIO, EvoMUSART, and EvoApplications. The 23 revised full papers presented were carefully reviewed and selected from 50 submissions. The papers present the latest research and discuss current developments and applications in metaheuristics - a paradigm to effectively solve difficult combinatorial optimization problems appearing in various industrial, economic, and scientific domains. Prominent examples of metaheuristics are ant colony optimization, evolutionary algorithms, greedy randomized adaptive search procedures, iterated local search, simulated annealing, tabu search, and variable neighborhood search. Applications include scheduling, timetabling, network design, transportation and distribution, vehicle routing, the travelling salesman problem, packing and cutting, satisfiability, and general mixed integer programming. 
359 1 |a A Hyper-heuristic with a Round Robin Neighbourhood -- A Multiobjective Approach Based on the Law of Gravity and Mass Interactions for Optimizing Networks -- A Multi-objective Feature Selection Approach Based on Binary PSO and Rough Set Theory -- A New Crossover for Solving Constraint Satisfaction Problems -- A Population-Based Strategic Oscillation Algorithm for Linear Ordering Problem with Cumulative Costs -- A Study of Adaptive Perturbation Strategy for Iterated Local Search -- Adaptive MOEA/D for QoS-Based Web Service Composition -- An Analysis of Local Search for the Bi-objective Bidimensional Knapsack Problem -- An Artificial Immune System Based Approach for Solving the Nurse Re-rostering Problem -- Automatic Algorithm Selection for the Quadratic Assignment Problem Using Fitness Landscape Analysis -- Balancing Bicycle Sharing Systems: A Variable Neighborhood Search Approach -- Combinatorial Neighborhood Topology Particle Swarm Optimization Algorithm for the Vehicle Routing Problem -- Dynamic Evolutionary Membrane Algorithm in Dynamic Environments -- From Sequential to Parallel Local Search for SAT -- Generalizing Hyper-heuristics via Apprenticeship Learning -- High-Order Sequence Entropies for Measuring Population Diversity in the Traveling Salesman Problem -- Investigating Monte-Carlo Methods on the Weak Schur Problem -- Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches -- Predicting Genetic Algorithm Performance on the Vehicle Routing Problem Using Information Theoretic Landscape -- Single Line Train Scheduling with ACO -- Solving Clique Covering in Very Large Sparse Random Graphs by a Technique Based on k-Fixed Coloring Tabu Search -- Solving the Virtual Network Mapping Problem with Construction Heuristics, Local Search and Variable Neighborhood Descent -- The Generate-and-Solve Framework Revisited: Generating by Simulated Annealing. 
371 0 |a Accès en ligne pour les établissements français bénéficiaires des licences nationales 
371 0 |a Accès soumis à abonnement pour tout autre établissement 
371 1 |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales  |c https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 
410 | |0 200114832  |t Theoretical computer science and general issues (Online)  |x 2512-2029  |v 7832 
452 | |t Evolutionary Computation in Combinatorial Optimization  |b Texte imprimé  |y 9783642371974 
452 | |t Evolutionary Computation in Combinatorial Optimization  |b Texte imprimé  |y 9783642371998 
610 1 |a Computer Science 
610 2 |a Numeric Computing 
610 2 |a Algorithm Analysis and Problem Complexity 
610 2 |a Computation by Abstract Devices 
610 2 |a Discrete Mathematics in Computer Science 
610 2 |a Algorithms 
610 1 |a Numerical Analysis 
610 2 |a Theory of Computation 
615 |a @Computer Science  |n 11645  |2 Springer 
676 |a 518  |v 23 
680 |a QA297-299.4 
701 1 |3 PPN069061092  |a Middendorf  |b Martin  |f 19..-....  |4 651 
701 1 |3 PPN128058390  |a Blum  |b Christian  |4 651 
710 1 2 |3 PPN26782842X  |a European conference on evolutionary computation in combinatorial optimization  |d 13  |f 2013  |e Vienne  |4 070 
801 3 |a FR  |b Abes  |c 20231126  |g AFNOR 
801 1 |a DE  |b Springer  |c 20230412  |g AACR2 
856 4 |u https://doi.org/10.1007/978-3-642-37198-1  |z Accès sur la plateforme de l'éditeur 
856 4 |u https://doi.org/10.1007/978-3-642-37198-1  |z Accès sur la plateforme de l'éditeur (Springer) 
856 4 |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-HZ20SK3Q-6  |z Accès sur la plateforme Istex 
856 4 |5 441099901:830858016  |u https://budistant.univ-nantes.fr/login?url=https://doi.org/10.1007/978-3-642-37198-1 
915 |5 441099901:830858016  |b SPRING13-00819 
930 |5 441099901:830858016  |b 441099901  |j g 
991 |5 441099901:830858016  |a Exemplaire créé en masse par ITEM le 30-09-2024 16:14 
997 |a NUM  |b SPRING13-00819  |d NUMpivo  |e EM  |s d 
998 |a 978648