skip to main content
10.1145/3467707.3467761acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiccaiConference Proceedingsconference-collections
research-article

A Metaheuristic Approach for Hub Location Problem with Multiple Functions

Published: 24 September 2021 Publication History

Abstract

We study a hub location problem with multiple functions based on a real-world regional logistics network. A hub-and-spoke network is designed to serve the demand between origins and destinations. The decision maker is to determine the functions of the candidate hubs, and a function is represented by its connections with different types of nodes, such as warehouse, station and external hub. We present an MIP model that can be solved by mathematical programming solvers for small-scale instances. A construction heuristic and two customized metaheuristics methods are proposed to solve large-scale instances, namely a construction heuristic, a variable neighborhood search and a greedy randomized adaptive search procedure. The computation results show the effectiveness of our methods to solve practical instances.

References

[1]
Alumur, S., & Kara, B. Y. (2008). Network hub location problems: The state of the art. European Journal of Operational Research, 190(1), 1–21. https://doi.org/10.1016/j.ejor.2007.06.008
[2]
Campbell, J. F., & O'Kelly, M. E. (2012). Twenty-five years of hub location research. Transportation Science, 46(2), 153–169. https://doi.org/10.1287/trsc.1120.0410
[3]
Contreras, I., Cordeau, J. F., & Laporte, G. (2011). Benders decomposition for large-scale uncapacitated hub location. Operations Research, 59(6), 1477–1490. https://doi.org/10.1287/opre.1110.0965
[4]
Contreras, I., & Fernández, E. (2014). Hub location as the minimization of a supermodular set function. Operations Research, 62(3), 557–570. https://doi.org/10.1287/opre.2014.1263
[5]
Farahani, R. Z., Hekmatfar, M., Arabani, A. B., & Nikbakhsh, E. (2013, April 1). Hub location problems: A review of models, classification, solution techniques, and applications. Computers and Industrial Engineering, Vol. 64, pp. 1096–1109. https://doi.org/10.1016/j.cie.2013.01.012
[6]
Hamacher, H. W., Labbé, M., Nickel, S., & Sonneborn, T. (2004). Adapting polyhedral properties from facility to hub location problems. Discrete Applied Mathematics, 145(1), 104–116. https://doi.org/10.1016/j.dam.2003.09.011
[7]
Ilić, A., Urošević, D., Brimberg, J., & Mladenović, N. (2010). A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem. European Journal of Operational Research, 206(2), 289–300. https://doi.org/10.1016/j.ejor.2010.02.022
[8]
Labbé, M., Yaman, H., & Gourdin, E. (2005). A branch and cut algorithm for hub location problems with single assignment. Mathematical Programming, 102(2), 371–405. https://doi.org/10.1007/s10107-004-0531-x
[9]
O'kelly, M. E. (1987). A Quadratic Integer Program for the Location of Interacting Hub Facilities. European Journal of Operational Research, 32(3), 393–404. https://doi.org/10.1016/0377-2217(90)90018-7
[10]
O'Kelly, M. E. (1986a). Activity Levels at Hub Facilities in Interacting Networks. Geographical Analysis, 18(4), 343–356. https://doi.org/10.1111/j.1538-4632.1986.tb00106.x
[11]
O'Kelly, M. E. (1986b). Location of Interacting Hub Facilities. Transportation Science, 20(2), 92–106. https://doi.org/10.1287/trsc.20.2.92
[12]
Sohn, J., & Park, S. (1997). A linear program for the two-hub location problem. European Journal of Operational Research, 100(3), 617–622. https://doi.org/10.1016/S0377-2217(96)00233-0

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICCAI '21: Proceedings of the 2021 7th International Conference on Computing and Artificial Intelligence
April 2021
498 pages
ISBN:9781450389501
DOI:10.1145/3467707
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 24 September 2021

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Hub Location
  2. Hub-and-Spoke Network
  3. Metaheuristics

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

ICCAI '21

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 38
    Total Downloads
  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)0
Reflects downloads up to 28 Feb 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format.

HTML Format

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media