A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming

Hamid Hasanzadeh, Mahdi Bashiri, Amirhossein Amiri

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Hub locations are NP-hard problems used in transportation systems. In this paper, we focus on a single-allocation hub covering location problem considering a queue model in which the number of servers is a decision variable. We propose a model enhanced with a queue estimation component to determine the number and location of hubs and the number of servers in each hub, and to allocate non-hub to hub nodes according to network costs, including fixed costs for establishing each hub and server, transportation costs, and waiting costs. Moreover, we consider the capacity for a queuing system in any hub node. In addition, we present a metaheuristic algorithm based on particle swarm optimization as a solution method. To evaluate the quality of the results obtained by the proposed algorithm, we establish a tight lower bound for the proposed model. Genetic programming is used for lower bound calculation in the proposed method. The results showed better performance of the proposed lower bound compared to a lower bound obtained by a relaxed model. Finally, the computational results confirm that the proposed solution algorithm performs well in optimizing the model with a minimum gap from the calculated lower bound.

Original languageEnglish
Pages (from-to)949-961
Number of pages13
JournalSoft Computing
Volume22
Issue number3
DOIs
Publication statusPublished - 19 Oct 2016
Externally publishedYes

Keywords

  • Genetic algorithm
  • Genetic programming
  • Hub location problem
  • Particle swarm optimization
  • Queuing theory

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Geometry and Topology

Fingerprint Dive into the research topics of 'A new approach to optimize a hub covering location problem with a queue estimation component using genetic programming'. Together they form a unique fingerprint.

  • Cite this