Evolutionary Computation in Combinatorial Optimization
Editat de Jano van Hemert, Carlos Cottaen Limba Engleză Paperback – 14 mar 2008
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 321.39 lei 6-8 săpt. | |
| Springer – 14 mar 2008 | 321.39 lei 6-8 săpt. | |
| Paperback (1) | 318.00 lei 6-8 săpt. | |
| Springer Berlin, Heidelberg – 30 mar 2007 | 318.00 lei 6-8 săpt. |
Preț: 321.39 lei
Preț vechi: 401.73 lei
-20%
Puncte Express: 482
Preț estimativ în valută:
56.92€ • 66.47$ • 49.44£
56.92€ • 66.47$ • 49.44£
Carte tipărită la comandă
Livrare economică 21 februarie-07 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540786030
ISBN-10: 3540786031
Pagini: 304
Ilustrații: XII, 292 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540786031
Pagini: 304
Ilustrații: XII, 292 p.
Dimensiuni: 155 x 235 x 17 mm
Greutate: 0.46 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Adaptive Tabu Tenure Computation in Local Search.- A Conflict Tabu Search Evolutionary Algorithm for Solving Constraint Satisfaction Problems.- Cooperative Particle Swarm Optimization for the Delay Constrained Least Cost Path Problem.- Effective Neighborhood Structures for the Generalized Traveling Salesman Problem.- Efficient Local Search Limitation Strategies for Vehicle Routing Problems.- Evolutionary Local Search for the Minimum Energy Broadcast Problem.- Exploring Multi-objective PSO and GRASP-PR for Rule Induction.- An Extended Beam-ACO Approach to the Time and Space Constrained Simple Assembly Line Balancing Problem.- Graph Colouring Heuristics Guided by Higher Order Graph Properties.- A Hybrid Column Generation Approach for the Berth Allocation Problem.- Hybrid Metaheuristic for the Prize Collecting Travelling Salesman Problem.- An ILS Based Heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Time Limit.- An Immune Genetic Algorithm Based on Bottleneck Jobs for the Job Shop Scheduling Problem.- Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem.- Improving Metaheuristic Performance by Evolving a Variable Fitness Function.- Improving Query Expansion with Stemming Terms: A New Genetic Algorithm Approach.- Inc*: An Incremental Approach for Improving Local Search Heuristics.- Metaheuristics for the Bi-objective Ring Star Problem.- Multiobjective Prototype Optimization with Evolved Improvement Steps.- Optimising Multiple Kernels for SVM by Genetic Programming.- Optimization of Menu Layouts by Means of Genetic Algorithms.- A Path Relinking Approach with an Adaptive Mechanism to Control Parameters for the Vehicle Routing Problem with Time Windows.- Reactive Stochastic LocalSearch Algorithms for the Genomic Median Problem.- Solving Graph Coloring Problems Using Learning Automata.