<abstract xmlns="http://www.w3.org/1999/xhtml"><p> We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.</p></abstract>

We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possibilities. In this critical survey, selected examples discussed include the traveling salesman, the resource-constrained project scheduling, the channel assignment, and computation of bounds for the Shannon capacity.

Heuristics for NP-hard optimization problems - simpler is better!?

Logistics, Supply Chain, Sustainability and Global Challenges

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

{"article-title":"Heuristics for NP-hard optimization problems - simpler is better!?"}

We provide several examples showing that local search, the most basic metaheuristics, may be a very competitive choice for solving computationally hard...

Heuristics for NP-hard optimization problems - simpler is better!?

Online veröffentlicht: 09. Dez. 2015

Seitenbereich: 1 - 10

DOI: https://doi.org/10.1515/jlst-2015-0006

Schlüsselwörter
> Optimization, metaheuristics, local search, greedy construction, traveling salesman problem

© 2015

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Heuristics for NP-hard optimization problems - simpler is better!?

Online veröffentlicht: 09. Dez. 2015

Seitenbereich: 1 - 10

DOI: https://doi.org/10.1515/jlst-2015-0006

Schlüsselwörter> Optimization, metaheuristics, local search, greedy construction, traveling salesman problem

© 2015

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Schlüsselwörter
> Optimization, metaheuristics, local search, greedy construction, traveling salesman problem