arrow
Return

A soft-computing Pareto-based meta-heuristic algorithm for a multi-objective multi-server facility location problem

delete2013-04-01
delete101
PRE
AI
S
Seyed Habib A. Rahmati
V
Vahid Hajipour
S
Seyed Taghi Akhavan Niaki *
DOI:10.1016/j.asoc.2012.12.016delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
In this paper, a novel multi-objective location model within multi-server queuing framework is proposed, in which facilities behave as M/M/m queues. In the developed model of the problem, the constraints of selecting the nearest-facility along with the service level restriction are considered to bring the model closer to reality. Three objective functions are also considered including minimizing (I) sum of the aggregate travel and waiting times, (II) maximum idle time of all facilities, and (III) the budget required to cover the costs of establishing the selected facilities plus server staffing costs. Since the developed model of the problem is of an NP-hard type and inexact solutions are more probable to be obtained, soft computing techniques, specifically evolutionary computations, are generally used to cope with the lack of precision. From different terms of evolutionary computations, this paper proposes a Pareto-based meta-heuristic algorithm called multi-objective harmony search (MOHS) to solve the problem. To validate the results obtained, two popular algorithms including non-dominated sorting genetic algorithm (NSGA-II) and non-dominated ranking genetic algorithm (NRGA) are utilized as well. In order to demonstrate the proposed methodology and to compare the performances in terms of Pareto-based solution measures, the Taguchi approach is first utilized to tune the parameters of the proposed algorithms, where a new response metric named multi-objective coefficient of variation (MOCV) is introduced. Then, the results of implementing the algorithms on some test problems show that the proposed MOHS outperforms the other two algorithms in terms of computational time. (C) 2012 Elsevier B. V. All rights reserved.
Keywords:
Multi-objective facility location problem
Queuing system
Soft computing
Multi-objective harmony search
NSGA-II
NRGA
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Applied Soft Computing cover
Applied Soft Computing
IF:
6.6
Papers:
1.4W
Citations:
4.8W

Organization

S
Sharif University of Technology
Scholars:
1.1W
Papers: 1.1W
Citations: 9.5K
I
Islamic Azad University
Scholars:
4.0W
Papers: 3.3W
Citations: 9.8K