du.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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
A computational comparison of different algorithms for very large p-median problems
Dalarna University, School of Technology and Business Studies, Computer Engineering.ORCID iD: 0000-0003-1015-8015
2015 (English)In: Evolutionary Computation in Combinatorial Optimization: 15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015, Proceedings / [ed] Gabriela Ochoa, Francisco Chicano, Springer, 2015, Vol. 9026, 13-24 p.Conference paper, (Refereed)
Abstract [en]

In this paper, we propose a new method for solving large scale p-median problem instances based on real data. We compare different approaches in terms of runtime, memory footprint and quality of solutions obtained. In order to test the different methods on real data, we introduce a new benchmark for the p-median problem based on real Swedish data. Because of the size of the problem addressed, up to 1938 candidate nodes, a number of algorithms, both exact and heuristic, are considered. We also propose an improved hybrid version of a genetic algorithm called impGA. Experiments show that impGA behaves as well as other methods for the standard set of medium-size problems taken from Beasley’s benchmark, but produces comparatively good results in terms of quality, runtime and memory footprint on our specific benchmark based on real Swedish data.

Place, publisher, year, edition, pages
Springer, 2015. Vol. 9026, 13-24 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 ; 9026
National Category
Computer Science
Research subject
Complex Systems – Microdata Analysis
Identifiers
URN: urn:nbn:se:du-19289DOI: 10.1007/978-3-319-16468-7_2ISI: 000361701400002ISBN: 978-3-319-16468-7 (print)ISBN: 978-3-319-16467-0 (print)OAI: oai:DiVA.org:du-19289DiVA: diva2:853060
Conference
15th European Conference, EvoCOP 2015, Copenhagen, Denmark, April 8-10, 2015
Available from: 2015-09-11 Created: 2015-09-11 Last updated: 2017-03-30Bibliographically approved

Open Access in DiVA

fulltext(1225 kB)74 downloads
File information
File name FULLTEXT01.pdfFile size 1225 kBChecksum SHA-512
3f7cdd045f30bd66900b753bddcddf688c62121541c03ba8dc518a5f2fef1f58da83a62db9c047148a6b5cb5693fa0cb1d695d7dcd98798c0d5d432ec0fe638a
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Search in DiVA

By author/editor
Rebreyend, Pascal
By organisation
Computer Engineering
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 74 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 473 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • 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