Skip to main content

Advertisement

SpringerLink
Log in

An improved genetic algorithm with local refinement for solving hierarchical single-allocation hub median facility location problem

  • Application of soft computing
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Hierarchical Single-Allocation Hub Median Facility Location Problem (SA-H-MP) is a well-known optimization problem having single objective function. The objective of SA-H-MP is to find a network of demand nodes, hubs and central hubs so that the service cost is minimized. In this article, we have proposed two meta-heuristic algorithms, Genetic Algorithm (GA) and its refined version and compare their performances with CPLEX (exact method), Simulated Annealing (SA) and Iterated Local Search (ILS). These approaches are validated on the well-known benchmark CAB data set. Proposed refined version of the GA is found to improve the result over other meta heuristics in more than 88% cases.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

Data Availability

The datasets analyzed during the current study are available at http://people.brunel.ac.uk/~mastjjb/jeb/orlib/files/phub4.txt.

References

  • Alumur S, Kara BY (2008) Network hub location problems: the state of the art. Eur J Oper Res 190(1):1–21

    Article  MATH  Google Scholar 

  • Alumur SA, Yaman H, Kara BY (2012) Hierarchical multimodal hub location problem with time-definite deliveries. Transport Res Part E Logist Transport Rev 48(6):1107–1120

    Article  Google Scholar 

  • Atta S, Sinha Mahapatra PR, Mukhopadhyay A (2018) Deterministic and randomized heuristic algorithms for uncapacitated facility location problem. In: Information and decision sciences, pp 205–216. Springer

  • Atta S, Mahapatra PRS, Mukhopadhyay A (2018) Solving maximal covering location problem using genetic algorithm with local refinement. Soft Comput 22(12):3891–3906

    Article  Google Scholar 

  • Campbell JF (1994) Integer programming formulations of discrete hub location problems. Eur J Oper Res 72(2):387–405

    Article  MATH  Google Scholar 

  • Davari S, Zar MHF et al (2012) The single-allocation hierarchical hub median location problem with fuzzy demands. Afr J Bus Manage 6(1):347–360

    Google Scholar 

  • Drezner Z, Hamacher HW (2001) Facility location: applications and theory. Springer, Cham

    MATH  Google Scholar 

  • Goldberg DE, Holland JH (1988) Genetic algorithms and machine learning

  • Goldman AJ (1969) Optimal locations for centers in a network. Transp Sci 3(4):352–360

    Article  Google Scholar 

  • Hamacher HW, Meyer T (2009) New developments on hub location. Comput Oper Res 36(12):3087

    Article  Google Scholar 

  • Jaramillo JH, Bhadury J, Batta R (2002) On the use of genetic algorithms to solve location problems. Comput Oper Res 29(6):761–779

    Article  MATH  Google Scholar 

  • Karakitsiou A (2015) Modeling discrete competitive facility location. Springer, Cham

    Book  MATH  Google Scholar 

  • Rand GK (1989) Facilities location: models and methods. J Oper Res Soc 40(10):941–942

    Article  Google Scholar 

  • Rezaei M, Zarandi MHF (2011) Facility location via fuzzy modeling and simulation. Appl Soft Comput 11(8):5330–5340

    Article  Google Scholar 

  • Şahin G, Süral H (2007) A review of hierarchical facility location models. Comput Oper Res 34(8):2310–2331

    Article  MATH  Google Scholar 

  • Skorin-Kapov D, Skorin-Kapov J, O’Kelly M (1996) Tight linear programming relaxations of uncapacitated p-hub median problems. Eur J Oper Res 94(3):582–593

    Article  MATH  Google Scholar 

  • Yaman H (2009) The hierarchical hub median problem with single assignment. Transport Res Part B Methodol 43(6):643–658

    Article  Google Scholar 

  • Zarandi MHF, Davari S, Sisakht SAH (2015) An empirical comparison of simulated annealing and iterated local search for the hierarchical single allocation hub median location problem. Scientia Iranica Trans E Ind Eng 22(3):1203

    Google Scholar 

  • Zarandi MHF, Davari S, Sisakht SAH (2011) The large scale maximal covering location problem. Scientia Iranica 18(6):1564–1570

    Article  MATH  Google Scholar 

Download references

Funding

A. Mukhopadhyay acknowledges the support received from DST-PURSE grant of University of Kalyani.

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, RCC Institute of Information Technology, Kolkata, West Bengal, 700015, India

    Arup Kumar Bhattacharjee

  2. Department of Computer Science and Engineering, University of Kalyani, Kalyani, West Bengal, 741235, India

    Anirban Mukhopadhyay

Authors
  1. Arup Kumar Bhattacharjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anirban Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

All authors contributed to the study conception and design. Material preparation, data collection and analysis were performed by Arup Kumar Bhattacharjee. The first draft of the manuscript was written by Arup Kumar Bhattacharjee and Anirban Mukhopadhyay. All authors read and approved the final manuscript.

Corresponding author

Correspondence to Anirban Mukhopadhyay.

Ethics declarations

Conflict of interest

The authors have no relevant financial or non-financial interests to disclose.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bhattacharjee, A.K., Mukhopadhyay, A. An improved genetic algorithm with local refinement for solving hierarchical single-allocation hub median facility location problem. Soft Comput 27, 1493–1509 (2023). https://doi.org/10.1007/s00500-022-07448-3

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-022-07448-3

Keywords

Search

Navigation