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

Žerovnik Janez ()
Additional contact information
Žerovnik Janez: FME, University of Ljubljana , Slovenia

Logistics, Supply Chain, Sustainability and Global Challenges, 2015, vol. 6, issue 1, 1-10

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.

Keywords: > Optimization; metaheuristics; local search; greedy construction; traveling salesman problem (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1515/jlst-2015-0006 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:vrs:losutr:v:6:y:2015:i:1:p:1-10:n:1

DOI: 10.1515/jlst-2015-0006

Access Statistics for this article

Logistics, Supply Chain, Sustainability and Global Challenges is currently edited by Maja Fošner

More articles in Logistics, Supply Chain, Sustainability and Global Challenges from Sciendo
Bibliographic data for series maintained by Peter Golla ().