Meta-heuristics: The State of the Art Local Search for Planning and Scheduling
S. Voß. Local Search for Planning and Scheduling, volume 2148 of Lecture Notes in Computer Science, chapter 1, Springer Berlin / Heidelberg, Berlin, Heidelberg, (Oct 29, 2001)
DOI: 10.1007/3-540-45612-0\_1
Abstract
Meta-heuristics support managers in decision-making with robust tools that provide high-quality solutions to important applications in business, engineering, economics and science in reasonable time horizons. In this paper we give some insight into the state of the art of meta-heuristics. This primarily focuses on the significant progress which general frames within the meta-heuristics field have implied for solving combinatorial optimization problems, mainly those for planning and scheduling.
%0 Book Section
%1 citeulike:5780643
%A Voß, Stefan
%B Local Search for Planning and Scheduling
%C Berlin, Heidelberg
%D 2001
%E Nareyek, Alexander
%I Springer Berlin / Heidelberg
%J Local Search for Planning and Scheduling
%K imported
%P 1--23
%R 10.1007/3-540-45612-0\_1
%T Meta-heuristics: The State of the Art Local Search for Planning and Scheduling
%U http://dx.doi.org/10.1007/3-540-45612-0\_1
%V 2148
%X Meta-heuristics support managers in decision-making with robust tools that provide high-quality solutions to important applications in business, engineering, economics and science in reasonable time horizons. In this paper we give some insight into the state of the art of meta-heuristics. This primarily focuses on the significant progress which general frames within the meta-heuristics field have implied for solving combinatorial optimization problems, mainly those for planning and scheduling.
%& 1
%@ 978-3-540-42898-5
@incollection{citeulike:5780643,
abstract = {{Meta-heuristics support managers in decision-making with robust tools that provide high-quality solutions to important applications in business, engineering, economics and science in reasonable time horizons. In this paper we give some insight into the state of the art of meta-heuristics. This primarily focuses on the significant progress which general frames within the meta-heuristics field have implied for solving combinatorial optimization problems, mainly those for planning and scheduling.}},
added-at = {2012-03-02T03:39:18.000+0100},
address = {Berlin, Heidelberg},
author = {Vo{\ss}, Stefan},
biburl = {https://www.bibsonomy.org/bibtex/2f136649702500fcc567949b464882c6c/baby9992006},
booktitle = {Local Search for Planning and Scheduling},
chapter = 1,
citeulike-article-id = {5780643},
citeulike-linkout-0 = {http://dx.doi.org/10.1007/3-540-45612-0\_1},
citeulike-linkout-1 = {http://www.springerlink.com/content/9bjrbhfwckjy75jr},
day = 29,
doi = {10.1007/3-540-45612-0\_1},
editor = {Nareyek, Alexander},
interhash = {c71f97e872bcde99ed1694993a8664ed},
intrahash = {f136649702500fcc567949b464882c6c},
isbn = {978-3-540-42898-5},
journal = {Local Search for Planning and Scheduling},
keywords = {imported},
month = oct,
pages = {1--23},
posted-at = {2012-02-14 03:50:36},
priority = {2},
publisher = {Springer Berlin / Heidelberg},
series = {Lecture Notes in Computer Science},
timestamp = {2012-03-02T03:39:23.000+0100},
title = {{Meta-heuristics: The State of the Art Local Search for Planning and Scheduling}},
url = {http://dx.doi.org/10.1007/3-540-45612-0\_1},
volume = 2148,
year = 2001
}