Acheter 10 livres pour 10 € ici !
Bookbot

Thomas G. Stützle

    Local search algorithms for combinatorial problems
    Learning and intelligent optimization
    Ant colony optimization
    Engineering stochastic local search algorithms
    • Stochastic local search (SLS) algorithms are widely recognized for their effectiveness in solving complex decision and optimization problems across computer science, operations research, and engineering. Their popularity stems from the conceptual simplicity of many SLS methods and their strong performance on a diverse array of problems, from abstract academic challenges to specific real-world applications. SLS methods include straightforward construction procedures and iterative improvement algorithms, as well as more complex general-purpose schemes known as metaheuristics, such as ant colony optimization, evolutionary computation, iterated local search, memetic algorithms, simulated annealing, tabu search, and variable neighborhood search. Historically, the development of effective SLS algorithms has relied heavily on experience and intuition, resembling an art form. However, recent insights reveal that this development is a complex engineering process that integrates algorithm design, empirical analysis, and problem-specific knowledge across various disciplines, including computer science, operations research, artificial intelligence, and statistics. This process necessitates a robust methodology to address challenges in algorithm design, implementation, tuning, and experimental evaluation.

      Engineering stochastic local search algorithms
    • LION 3, the Third International Conference on Learning and Intelligent Op- mizatioN, was held during January 14–18 in Trento, Italy. The LION series of conferences provides a platform for researchers who are interested in the int- section of e? cient optimization techniques and learning. It is aimed at exploring the boundaries and uncharted territories between machine learning, arti? cial intelligence, mathematical programming and algorithms for hard optimization problems. The considerable interest in the topics covered by LION was re? ected by the overwhelming number of 86 submissions, which almost doubled the 48 subm- sions received for LION’s second edition in December 2007. As in the ? rst two editions, the submissions to LION 3 could be in three formats: (a) original novel and unpublished work for publication in the post-conference proceedings, (b) extended abstracts of work-in-progressor a position statement, and (c) recently submitted or published journal articles for oral presentations. The 86 subm- sions received include 72, ten, and four articles for categories (a), (b), and (c), respectively.

      Learning and intelligent optimization