Overview

Editors:

Thomas Bartz-Beielstein

View editor publications

You can also search for this editor in PubMed Google Scholar
María José Blesa Aguilera

View editor publications

You can also search for this editor in PubMed Google Scholar
Christian Blum

View editor publications

You can also search for this editor in PubMed Google Scholar
Boris Naujoks

View editor publications

You can also search for this editor in PubMed Google Scholar
Andrea Roli

View editor publications

You can also search for this editor in PubMed Google Scholar
Günter Rudolph

View editor publications

You can also search for this editor in PubMed Google Scholar
Michael Sampels

View editor publications

You can also search for this editor in PubMed Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 4771)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

HM: International Workshop on Hybrid Metaheuristics

Conference proceedings info: HM 2007.

12k Accesses
1 Altmetric

This is a preview of subscription content, log in via an institution to check access.

Access this book

Softcover Book USD 54.99

Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Keywords

Table of contents (14 papers)

Front Matter

Download chapter PDF
Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem
- Steffen Wolf, Peter Merz
Pages 1-15
An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem
- Mourad Boudia, Christian Prins, Mohamed Reghioui
Pages 16-30
Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems
- Tonc̆i Carić, Juraj Fosin, Ante Galić, Hrvoje Gold, Andreas Reinholz
Pages 31-44
Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP
- Marc Reimann
Pages 45-56
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
- Igor Pesek, Andrea Schaerf, Janez Žerovnik
Pages 57-68
Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop
- Geraldo Ribeiro Filho, Marcelo Seido Nagano, Luiz Antonio Nogueira Lorena
Pages 69-81
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
- Alexandre R. Duarte, Celso C. Ribeiro, Sebastián Urrutia
Pages 82-95
On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case
- Rhydian Lewis
Pages 96-107
Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement
- Prasanna Balaprakash, Mauro Birattari, Thomas Stützle
Pages 108-122
Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge
- Christian Blum, Monaldo Mastrolilli
Pages 123-139
Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric
- Michael Emmerich, André Deutz, Nicola Beume
Pages 140-156
A Hybrid VNS for Connected Facility Location
- Ivana Ljubić
Pages 157-169
A Memetic Algorithm for the Optimum Communication Spanning Tree Problem
- Thomas Fischer, Peter Merz
Pages 170-184
Hybrid Numerical Optimization for Combinatorial Network Problems
- Markus Chimani, Maria Kandyba, Mike Preuss
Pages 185-200
Back Matter

Download chapter PDF

Other volumes

Hybrid Metaheuristics

Bibliographic Information

Book Title: Hybrid Metaheuristics
Book Subtitle: 4th International Workshop,HM 2007, Dortmund, Germany, October 8-9, 2007, Proceedings
Editors: Thomas Bartz-Beielstein, María José Blesa Aguilera, Christian Blum, Boris Naujoks, Andrea Roli, Günter Rudolph, Michael Sampels
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/978-3-540-75514-2
Publisher: Springer Berlin, Heidelberg
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: Springer-Verlag Berlin Heidelberg 2007
Softcover ISBN: 978-3-540-75513-5Published: 28 September 2007
eBook ISBN: 978-3-540-75514-2Published: 20 September 2007
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 201
Topics: Artificial Intelligence, Algorithm Analysis and Problem Complexity, Computation by Abstract Devices, Numeric Computing, Pattern Recognition

Publish with us

Policies and ethics

Hybrid Metaheuristics

Overview

Access this book

Other ways to access

Keywords

Table of contents (14 papers)

Front Matter

Evolutionary Local Search for the Super-Peer Selection Problem and the p-Hub Median Problem

An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem

Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems

Guiding ACO by Problem Relaxation: A Case Study on the Symmetric TSP

Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem

Evolutionary Clustering Search for Flowtime Minimization in Permutation Flow Shop

A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy

On the Combination of Constraint Programming and Stochastic Search: The Sudoku Case

Improvement Strategies for the F-Race Algorithm: Sampling Design and Iterative Refinement

Using Branch & Bound Concepts in Construction-Based Metaheuristics: Exploiting the Dual Problem Knowledge

Gradient-Based/Evolutionary Relay Hybrid for Computing Pareto Front Approximations Maximizing the S-Metric

A Hybrid VNS for Connected Facility Location

A Memetic Algorithm for the Optimum Communication Spanning Tree Problem

Hybrid Numerical Optimization for Combinatorial Network Problems

Back Matter

Other volumes

Hybrid Metaheuristics

Bibliographic Information

Publish with us

Navigation

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.