Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Éric D. Taillard"'
Autor:
Éric D. Taillard
Publikováno v:
European Journal of Operational Research. 297:442-450
A linearithmic ( n l o g n ) randomized method based on POPMUSIC (Partial Optimization Metaheuristic Under Special Intensification Conditions) is proposed for generating reasonably good solutions to the travelling salesman problem. The method improve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6c794e4f039b4ce9212bea90f0be00d6
https://doi.org/10.1016/j.ejor.2021.05.034
https://doi.org/10.1016/j.ejor.2021.05.034
Autor:
Thé Van Luong, Éric D. Taillard
Publikováno v:
Metaheuristics ISBN: 9783031265037
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5b4f487f5c9742176cc158d997a52151
https://doi.org/10.1007/978-3-031-26504-4_9
https://doi.org/10.1007/978-3-031-26504-4_9
Autor:
Éric D. Taillard
Publikováno v:
Graduate Texts in Operations Research ISBN: 9783031137136
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8827a5b7c71c74a6fd0d8ae6be27f3f3
https://doi.org/10.1007/978-3-031-13714-3
https://doi.org/10.1007/978-3-031-13714-3
Autor:
Éric D. Taillard
Publikováno v:
Design of Heuristic Algorithms for Hard Optimization ISBN: 9783031137136
After having generated several solutions, we can seek to learn how to combine them. This chapter review techniques for generating new solution from existing ones and for managing a population of solution. The most popular method in this field is undo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c9b74d442c89fc8b6edd81b225ff40f2
https://doi.org/10.1007/978-3-031-13714-3_10
https://doi.org/10.1007/978-3-031-13714-3_10
Autor:
Éric D. Taillard
Publikováno v:
Design of Heuristic Algorithms for Hard Optimization ISBN: 9783031137136
This chapter recalls some elements and definitions in graph theory and complexity theory. On the one hand, basic algorithmic courses very often include graph algorithms. Some of these algorithms have simply been transposed to solve difficult optimiza
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d68ef1f0d44636f45f8c402661fc10ff
https://doi.org/10.1007/978-3-031-13714-3_1
https://doi.org/10.1007/978-3-031-13714-3_1
Autor:
Éric D. Taillard
Publikováno v:
Design of Heuristic Algorithms for Hard Optimization ISBN: 9783031137136
Improvement methods constitute the backbone of most metaheuristics. These methods repeatedly perform slight, local modifications on a current solution to the problem. Hence, for any solution, a set of neighbor solutions must be defined. Clearly, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c490703edaa4b23de22f9c25ff90dc33
https://doi.org/10.1007/978-3-031-13714-3_5
https://doi.org/10.1007/978-3-031-13714-3_5
Autor:
Éric D. Taillard
Publikováno v:
Design of Heuristic Algorithms for Hard Optimization ISBN: 9783031137136
The chapter first recalls few properties of recursive algorithms. Next, it introduces a general recursive constructive method. Finally, it presents the large neighborhood search and the POPMUSIC metaheuristics.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f85af0e118d8cc1cca3500885c7322ef
https://doi.org/10.1007/978-3-031-13714-3_6
https://doi.org/10.1007/978-3-031-13714-3_6
Autor:
Éric D. Taillard
Publikováno v:
Design of Heuristic Algorithms for Hard Optimization ISBN: 9783031137136
The first basic ingredient of heuristics is to build a solution. So, a first metaheuristic approach is to improve the process of building solutions. This chapter presents construction learning mechanisms. A typical example is artificial ants systems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e8cf45035b41465ef7902f4dffd44cd8
https://doi.org/10.1007/978-3-031-13714-3_8
https://doi.org/10.1007/978-3-031-13714-3_8
Autor:
Éric D. Taillard
Publikováno v:
Design of Heuristic Algorithms for Hard Optimization ISBN: 9783031137136
This chapter presents methods for constructing solutions. It starts with the branch and bound methods, widely used for the design of exact algorithms. Then two basic methods are presented, random and greedy constructions. The latter sequentially sele
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b69848733eacd2413c20fbada425e5c5
https://doi.org/10.1007/978-3-031-13714-3_4
https://doi.org/10.1007/978-3-031-13714-3_4
Autor:
Éric D. Taillard
Publikováno v:
Design of Heuristic Algorithms for Hard Optimization ISBN: 9783031137136
This chapter is devoted to random and memory-free methods that repeatedly construct solutions or modify them. Among the most popular techniques, there are simulated annealing, threshold accepting, great deluge and demon algorithms, noising methods, l
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a91334e05a44fb2e37c067357d9b7f5
https://doi.org/10.1007/978-3-031-13714-3_7
https://doi.org/10.1007/978-3-031-13714-3_7