679 KB33 KB201420202015Žerovnik, Janezletnik:6številka:nr. 1str. 1-10DOI:10.1515/jlst-2015-0006COBISSID_HOST:14386203ISSN:1854-3332URN:URN:NBN:SI:doc-WOW3NQ1RenEvropsko združenje za logistiko in transportLogistics and sustainable transportgreedy constructionkonstrukcijska hevristikalocal searchlokalno iskanjemetaheuristicsmetahevristikaoptimizacijaoptimizationpožrešna metodaproblem trgovskega potnikatraveling salesman problemHeuristics 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 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 capacityTEXTznanstveno časopisjejournalsSlovenian National E-content AggregatorNational and University Library of SloveniaUniverza v Mariboru, Fakulteta za logistiko