| Title: | Heuristics for NP-hard optimization problems : simpler is better !? |
|---|
| Authors: | ID Žerovnik, Janez (Author) |
|---|
| Files: |  Logistics_&_Sustainable_Transport_2015_Zerovnik_Heuristics_for_NP-hard_optimization_problems_-_simpler_is_better!.pdf (709,68 KB)
MD5: D10EA8529D9E1704550778D0FB866D06
PID: 20.500.12556/dkum/2a973926-ea95-404f-8839-62a29155ee31
 https://www.degruyter.com/view/j/jlst.2015.6.issue-1/jlst-2015-0006/jlst-2015-0006.xml
|
|---|
| Language: | English |
|---|
| Work type: | Scientific work |
|---|
| Typology: | 1.01 - Original Scientific Article |
|---|
| Organization: | FL - Faculty of Logistic
|
|---|
| 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 |
|---|
| Publication status: | Published |
|---|
| Publication version: | Version of Record |
|---|
| Year of publishing: | 2015 |
|---|
| Number of pages: | str. 1-10 |
|---|
| Numbering: | Letn. 6, št. 1 |
|---|
| PID: | 20.500.12556/DKUM-69004  |
|---|
| ISSN: | 1854-3332 |
|---|
| UDC: | 658.788(045) |
|---|
| ISSN on article: | 1854-3332 |
|---|
| COBISS.SI-ID: | 14386203 |
|---|
| DOI: | 10.1515/jlst-2015-0006 |
|---|
| NUK URN: | URN:SI:UM:DK:BOBIACLN |
|---|
| Publication date in DKUM: | 17.11.2017 |
|---|
| Views: | 2016 |
|---|
| Downloads: | 474 |
|---|
| Metadata: |    |
|---|
| Categories: | Misc.
|
|---|
|
:
|
Copy citation |
|---|
| | | | Average score: | (0 votes) |
|---|
| Your score: | Voting is allowed only for logged in users. |
|---|
| Share: |  |
|---|
Hover the mouse pointer over a document title to show the abstract or click
on the title to get all document metadata. |
