Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm

Mahdi Bashiri, Mohammad Rezanezhad, Reza Tavakkoli-Moghaddam, Hamid Hasanzadeh

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

In this study, a new mobile p-hub location problem in a dynamic environment is proposed, where there are mobile facilities inside hub nodes that can be transferred to other nodes in the next period. Mobile facilities have a mobility feature and can be transferred to other nodes in order to meet demand. Using such facilities will save extra hub establishment and closing costs in networks. This approach can be used in some real-world applications with rapidly changing demand, such as mobile post offices or emergency medical service centers, because designing immobile hub networks may be less efficient. In addition, designing dynamic hub networks entails establishing and closing costs in different periods. The model also considers a mobility infrastructure of hub facilities. The numerical examples confirm that a mobile hub network is more efficient than an immobile hub network in a dynamic environment. The effect of different parameters on the model is analyzed to consider its applicability conditions. A genetic algorithm, along with tuned parameters and a simulated annealing algorithm, are proposed to solve the model in large instances. Proposing of a model considering mobility feature in the hub location networks, proving its efficiency and finally proposing a proper solution algorithm are main contributions of this study. The model and solutions algorithms were analyzed by more numerical instances using Australia post (AP) dataset.

Original languageEnglish
Pages (from-to)151-169
Number of pages19
JournalApplied Mathematical Modelling
Volume54
Early online date23 Sep 2017
DOIs
Publication statusPublished - 1 Feb 2018
Externally publishedYes

Fingerprint

Hub Location
Location Problem
Dynamic Environment
Mathematical Modeling
Genetic algorithms
Genetic Algorithm
Post offices
Vertex of a graph
Mobility Model
Simulated annealing
Simulated Annealing Algorithm
Costs
Real-world Applications
Wireless networks
Emergency
Model
Infrastructure
Numerical Examples

Keywords

  • Dynamic environment
  • Genetic algorithm
  • Greedy local search
  • Mobile hub location
  • Mobility infrastructure

ASJC Scopus subject areas

  • Modelling and Simulation
  • Applied Mathematics

Cite this

Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm. / Bashiri, Mahdi; Rezanezhad, Mohammad; Tavakkoli-Moghaddam, Reza; Hasanzadeh, Hamid.

In: Applied Mathematical Modelling, Vol. 54, 01.02.2018, p. 151-169.

Research output: Contribution to journalArticle

Bashiri, Mahdi ; Rezanezhad, Mohammad ; Tavakkoli-Moghaddam, Reza ; Hasanzadeh, Hamid. / Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm. In: Applied Mathematical Modelling. 2018 ; Vol. 54. pp. 151-169.
@article{6f5ccba503c140ec8a1246d3b1be7d62,
title = "Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm",
abstract = "In this study, a new mobile p-hub location problem in a dynamic environment is proposed, where there are mobile facilities inside hub nodes that can be transferred to other nodes in the next period. Mobile facilities have a mobility feature and can be transferred to other nodes in order to meet demand. Using such facilities will save extra hub establishment and closing costs in networks. This approach can be used in some real-world applications with rapidly changing demand, such as mobile post offices or emergency medical service centers, because designing immobile hub networks may be less efficient. In addition, designing dynamic hub networks entails establishing and closing costs in different periods. The model also considers a mobility infrastructure of hub facilities. The numerical examples confirm that a mobile hub network is more efficient than an immobile hub network in a dynamic environment. The effect of different parameters on the model is analyzed to consider its applicability conditions. A genetic algorithm, along with tuned parameters and a simulated annealing algorithm, are proposed to solve the model in large instances. Proposing of a model considering mobility feature in the hub location networks, proving its efficiency and finally proposing a proper solution algorithm are main contributions of this study. The model and solutions algorithms were analyzed by more numerical instances using Australia post (AP) dataset.",
keywords = "Dynamic environment, Genetic algorithm, Greedy local search, Mobile hub location, Mobility infrastructure",
author = "Mahdi Bashiri and Mohammad Rezanezhad and Reza Tavakkoli-Moghaddam and Hamid Hasanzadeh",
year = "2018",
month = "2",
day = "1",
doi = "10.1016/j.apm.2017.09.032",
language = "English",
volume = "54",
pages = "151--169",
journal = "Applied Mathematical Modelling",
issn = "0307-904X",
publisher = "Elsevier",

}

TY - JOUR

T1 - Mathematical modeling for a p-mobile hub location problem in a dynamic environment by a genetic algorithm

AU - Bashiri, Mahdi

AU - Rezanezhad, Mohammad

AU - Tavakkoli-Moghaddam, Reza

AU - Hasanzadeh, Hamid

PY - 2018/2/1

Y1 - 2018/2/1

N2 - In this study, a new mobile p-hub location problem in a dynamic environment is proposed, where there are mobile facilities inside hub nodes that can be transferred to other nodes in the next period. Mobile facilities have a mobility feature and can be transferred to other nodes in order to meet demand. Using such facilities will save extra hub establishment and closing costs in networks. This approach can be used in some real-world applications with rapidly changing demand, such as mobile post offices or emergency medical service centers, because designing immobile hub networks may be less efficient. In addition, designing dynamic hub networks entails establishing and closing costs in different periods. The model also considers a mobility infrastructure of hub facilities. The numerical examples confirm that a mobile hub network is more efficient than an immobile hub network in a dynamic environment. The effect of different parameters on the model is analyzed to consider its applicability conditions. A genetic algorithm, along with tuned parameters and a simulated annealing algorithm, are proposed to solve the model in large instances. Proposing of a model considering mobility feature in the hub location networks, proving its efficiency and finally proposing a proper solution algorithm are main contributions of this study. The model and solutions algorithms were analyzed by more numerical instances using Australia post (AP) dataset.

AB - In this study, a new mobile p-hub location problem in a dynamic environment is proposed, where there are mobile facilities inside hub nodes that can be transferred to other nodes in the next period. Mobile facilities have a mobility feature and can be transferred to other nodes in order to meet demand. Using such facilities will save extra hub establishment and closing costs in networks. This approach can be used in some real-world applications with rapidly changing demand, such as mobile post offices or emergency medical service centers, because designing immobile hub networks may be less efficient. In addition, designing dynamic hub networks entails establishing and closing costs in different periods. The model also considers a mobility infrastructure of hub facilities. The numerical examples confirm that a mobile hub network is more efficient than an immobile hub network in a dynamic environment. The effect of different parameters on the model is analyzed to consider its applicability conditions. A genetic algorithm, along with tuned parameters and a simulated annealing algorithm, are proposed to solve the model in large instances. Proposing of a model considering mobility feature in the hub location networks, proving its efficiency and finally proposing a proper solution algorithm are main contributions of this study. The model and solutions algorithms were analyzed by more numerical instances using Australia post (AP) dataset.

KW - Dynamic environment

KW - Genetic algorithm

KW - Greedy local search

KW - Mobile hub location

KW - Mobility infrastructure

UR - http://www.scopus.com/inward/record.url?scp=85038211700&partnerID=8YFLogxK

U2 - 10.1016/j.apm.2017.09.032

DO - 10.1016/j.apm.2017.09.032

M3 - Article

VL - 54

SP - 151

EP - 169

JO - Applied Mathematical Modelling

JF - Applied Mathematical Modelling

SN - 0307-904X

ER -