Solving a stochastic multi-objective and multi-period hub location problem considering economic aspects by meta-heuristics: application in public transportation
by Mahdi Hamid; Mahdi Bastan; Mojtaba Hamid; Farrokh Sheikhahmadi
International Journal of Computer Applications in Technology (IJCAT), Vol. 60, No. 3, 2019

Abstract: In this paper, a multi-objective scenario based mathematical model is presented for the capacitated hub location problem in public transportation considering economic and investment aspects. Three objective functions are regarded in the presented mathematical model. The first one aims to minimise the total costs considering the possibility of investing the unused budget at each period. The second one aims to minimise the total processing time in the hub network at each period. The last one aims to minimise the maximum distance between each pair of origin-destination nodes in the network. To solve the model, three multi-objective meta-heuristic algorithms are developed, namely S metric selection evolutionary multi-objective optimisation algorithm (SMS-EMOA), multi-objective imperialist competitive algorithm (MOICA) and non-dominated sorting genetic algorithm (NSGA-II). Finally, developed algorithms are compared to each other based on several comparison measures using a relatively novel statistical approach.

Online publication date: Mon, 24-Jun-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com