Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques
Hub location problems have been studied by many researchers for almost 30 years, and, accordingly, various solution methods have been proposed. In this paper, we implement and evaluate several widely used methods for solving five standard hub location problems. To assess the scalability and solution...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2017/9387302 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832564120366350336 |
|---|---|
| author | Xiaoqian Sun Weibin Dai Yu Zhang Sebastian Wandelt |
| author_facet | Xiaoqian Sun Weibin Dai Yu Zhang Sebastian Wandelt |
| author_sort | Xiaoqian Sun |
| collection | DOAJ |
| description | Hub location problems have been studied by many researchers for almost 30 years, and, accordingly, various solution methods have been proposed. In this paper, we implement and evaluate several widely used methods for solving five standard hub location problems. To assess the scalability and solution qualities of these methods, three well-known datasets are used as case studies: Turkish Postal System, Australia Post, and Civil Aeronautics Board. Classical problems in small networks can be solved efficiently using CPLEX because of their low complexity. Genetic algorithms perform well for solving three types of single allocation problems, since the problem formulations can be neatly encoded with chromosomes of reasonable size. Lagrangian relaxation is the only technique that solves reliable multiple allocation problems in large networks. We believe that our work helps other researchers to get an overview on the best solution techniques for the problems investigated in our study and also stipulates further interest on cross-comparing solution techniques for more expressive problem formulations. |
| format | Article |
| id | doaj-art-45cd537551884a7193badd96ecc86ac6 |
| institution | Kabale University |
| issn | 0197-6729 2042-3195 |
| language | English |
| publishDate | 2017-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Journal of Advanced Transportation |
| spelling | doaj-art-45cd537551884a7193badd96ecc86ac62025-02-03T01:11:48ZengWileyJournal of Advanced Transportation0197-67292042-31952017-01-01201710.1155/2017/93873029387302Finding p-Hub Median Locations: An Empirical Study on Problems and Solution TechniquesXiaoqian Sun0Weibin Dai1Yu Zhang2Sebastian Wandelt3School of Electronic and Information Engineering, Beihang University, Beijing 100191, ChinaSchool of Electronic and Information Engineering, Beihang University, Beijing 100191, ChinaDepartment of Civil and Environmental Engineering, University of South Florida, Tampa, FL 33620, USASchool of Electronic and Information Engineering, Beihang University, Beijing 100191, ChinaHub location problems have been studied by many researchers for almost 30 years, and, accordingly, various solution methods have been proposed. In this paper, we implement and evaluate several widely used methods for solving five standard hub location problems. To assess the scalability and solution qualities of these methods, three well-known datasets are used as case studies: Turkish Postal System, Australia Post, and Civil Aeronautics Board. Classical problems in small networks can be solved efficiently using CPLEX because of their low complexity. Genetic algorithms perform well for solving three types of single allocation problems, since the problem formulations can be neatly encoded with chromosomes of reasonable size. Lagrangian relaxation is the only technique that solves reliable multiple allocation problems in large networks. We believe that our work helps other researchers to get an overview on the best solution techniques for the problems investigated in our study and also stipulates further interest on cross-comparing solution techniques for more expressive problem formulations.http://dx.doi.org/10.1155/2017/9387302 |
| spellingShingle | Xiaoqian Sun Weibin Dai Yu Zhang Sebastian Wandelt Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques Journal of Advanced Transportation |
| title | Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques |
| title_full | Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques |
| title_fullStr | Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques |
| title_full_unstemmed | Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques |
| title_short | Finding p-Hub Median Locations: An Empirical Study on Problems and Solution Techniques |
| title_sort | finding p hub median locations an empirical study on problems and solution techniques |
| url | http://dx.doi.org/10.1155/2017/9387302 |
| work_keys_str_mv | AT xiaoqiansun findingphubmedianlocationsanempiricalstudyonproblemsandsolutiontechniques AT weibindai findingphubmedianlocationsanempiricalstudyonproblemsandsolutiontechniques AT yuzhang findingphubmedianlocationsanempiricalstudyonproblemsandsolutiontechniques AT sebastianwandelt findingphubmedianlocationsanempiricalstudyonproblemsandsolutiontechniques |