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 optimization problems. In addition, generation of starting solutions by greedy heuristics should be at least considered as one of very natural possi...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sciendo
2015-11-01
|
| Series: | Logistics & Sustainable Transport |
| Subjects: | |
| Online Access: | https://doi.org/10.1515/jlst-2015-0006 |