du.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
GRASP and Statistical Bounds for Heuristic Solutions to Combinatorial Problems
Dalarna University, School of Technology and Business Studies, Microdata Analysis.ORCID iD: 0000-0003-4212-8582
Dalarna University, School of Technology and Business Studies, Microdata Analysis.ORCID iD: 0000-0003-2317-9157
2019 (English)In: International Journal of Management and Applied Science, ISSN 2394-7926, Vol. 5, no 8, p. 113-119Article in journal (Refereed) Published
Abstract [en]

The quality of a heuristic solution to a NP-hard combinatorial problem is hard to assess. A few studies have advocated and tested statistical bounds as a method for assessment. These studies indicate that statistical bounds are superior to the more widely known and used deterministic bounds. However, the previous studies have been limited to a few heuristics and combinatorial problems and, hence, the general performance of statistical bounds in combinatorial optimization remains an open question. This work complements the existing literature on statistical bounds by testing them on the metaheuristic Greedy Randomized Adaptive Search Procedures (GRASP) and four combinatorial problems. Our findings confirm previous results that statistical bounds are reliable for the p-median problem, while we note that they also seem reliable for the set covering problem. For the quadratic assignment problem, the statistical bounds have previously been found reliable when obtained from the Genetic algorithm whereas in this work they have been found less reliable. Finally, we provide statistical bounds to four 2-path network design problem instances for which the optimum is currently unknown.

Place, publisher, year, edition, pages
Institute of Research and Journals (IRAJ) , 2019. Vol. 5, no 8, p. 113-119
Keywords [en]
Combinatorial Problems, GRASP, Statistical Bounds, Statistical Optimum Estimation Techniques
National Category
Other Computer and Information Science
Research subject
Complex Systems – Microdata Analysis, General Microdata Analysis - methods
Identifiers
URN: urn:nbn:se:du-31077OAI: oai:DiVA.org:du-31077DiVA, id: diva2:1368074
Available from: 2019-11-05 Created: 2019-11-05 Last updated: 2019-11-08Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

http://ijmas.iraj.in/paper_detail.php?paper_id=16017&name=GRASP_and_Statistical_Bounds_for_Heuristic_Solutions_to_Combinatorial_Problems

Authority records BETA

Han, MengjieCarling, Kenneth

Search in DiVA

By author/editor
Han, MengjieCarling, Kenneth
By organisation
Microdata Analysis
Other Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar

urn-nbn

Altmetric score

urn-nbn
Total: 25 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • chicago-author-date
  • chicago-note-bibliography
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf