Naslov: | Heuristics for NP-hard optimization problems : simpler is better !? |
---|
Avtorji: | ID Žerovnik, Janez (Avtor) |
Datoteke: | Logistics_&_Sustainable_Transport_2015_Zerovnik_Heuristics_for_NP-hard_optimization_problems_-_simpler_is_better!.pdf (709,68 KB) MD5: D10EA8529D9E1704550778D0FB866D06
https://www.degruyter.com/view/j/jlst.2015.6.issue-1/jlst-2015-0006/jlst-2015-0006.xml
|
---|
Jezik: | Angleški jezik |
---|
Vrsta gradiva: | Znanstveno delo (r2) |
---|
Tipologija: | 1.01 - Izvirni znanstveni članek |
---|
Organizacija: | FL - Fakulteta za logistiko
|
---|
Opis: | 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. |
---|
Ključne besede: | optimization, metaheuristics, local search, greedy construction, traveling salesman problem |
---|
Leto izida: | 2015 |
---|
Status objave pri reviji: | Objavljeno |
---|
Verzija članka: | Založnikova različica članka |
---|
Št. strani: | str. 1-10 |
---|
Številčenje: | Letn. 6, št. 1 |
---|
ISSN: | 1854-3332 |
---|
UDK: | 658.788(045) |
---|
COBISS.SI-ID: | 14386203  |
---|
DOI: | 10.1515/jlst-2015-0006  |
---|
ISSN pri članku: | 1854-3332 |
---|
NUK URN: | URN:SI:UM:DK:BOBIACLN |
---|
Datum objave v DKUM: | 17.11.2017 |
---|
Število ogledov: | 961 |
---|
Število prenosov: | 174 |
---|
Metapodatki: |  |
---|
Področja: | Ostalo
|
---|
:
|
|
---|
| | | Skupna ocena: | (0 glasov) |
---|
Vaša ocena: | Ocenjevanje je dovoljeno samo prijavljenim uporabnikom. |
---|
Objavi na: |  |
|
Postavite miškin kazalec na naslov za izpis povzetka. Klik na naslov izpiše
podrobnosti ali sproži prenos. |