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 versatile adaptive aggregation framework for spatially large discrete location-allocation problems
KTH, School of Architecture and the Built Environment (ABE), Transport Science, Transport Planning, Economics and Engineering.ORCID iD: 0000-0002-8499-0843
2017 (English)In: Computers & industrial engineering, ISSN 0360-8352, E-ISSN 1879-0550, Vol. 111, 364-380 p.Article in journal (Refereed) Published
Abstract [en]

We propose a versatile concept of the adaptive aggregation framework for the facility location problems that keeps the problem size in reasonable limits. Most location-allocation problems are known to be NP-hard. Thus, if a problem reaches the critical size, the computation exceeds reasonable time limits, or all computer memory is consumed. Aggregation is a tool that allows for transforming problems into smaller sizes. Usually, it is used only in the data preparation phase, and it leads to the loss of optimality due to aggregation errors. This is particularly remarkable when solving problems with a large number of demand points. The proposed framework embeds the aggregation into the solving process and it iteratively adjusts the aggregation level to the high quality solutions. To explore its versatility, we apply it to the p-median and to the lexicographic minimax problems that lead to structurally different patterns of located facilities. To evaluate the optimality errors, we use benchmarks which can be computed exactly, and to explore the limits of our approach, we study benchmarks reaching 670,000 demand points. Numerical experiments reveal that the adaptive aggregation framework performs well across a large range of problem sizes and is able to provide solutions of higher quality than the state-of-the-art exact methods when applied to the aggregated problem.

Place, publisher, year, edition, pages
Elsevier, 2017. Vol. 111, 364-380 p.
Keyword [en]
Adaptive aggregation, Data aggregation, Framework, Heuristics, Location analysis
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-212254DOI: 10.1016/j.cie.2017.07.022ISI: 000410468600030Scopus ID: 2-s2.0-85026747111OAI: oai:DiVA.org:kth-212254DiVA: diva2:1133948
Note

QC 20170817

Available from: 2017-08-17 Created: 2017-08-17 Last updated: 2017-10-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Cebecauer, Matej
By organisation
Transport Planning, Economics and Engineering
In the same journal
Computers & industrial engineering
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 28 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