کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
496108 862850 2013 13 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A soft-computing Pareto-based meta-heuristic algorithm for a multi-objective multi-server facility location problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
پیش نمایش صفحه اول مقاله
A soft-computing Pareto-based meta-heuristic algorithm for a multi-objective multi-server facility location problem
چکیده انگلیسی

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.

Figure optionsDownload as PowerPoint slideHighlights
► A novel multi-objective facility location model within multi-server queuing framework is developed.
► Three Pareto-based meta-heuristics are proposed to solve the problem with three objectives.
► Taguchi approach is utilized to tune the parameters of the algorithms.
► A new multi-objective response metric is introduced for calibration.
► The algorithms are compared based on their computational time and number of Pareto solutions.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Soft Computing - Volume 13, Issue 4, April 2013, Pages 1728–1740
نویسندگان
, , ,