Loading...

A multi-objective harmony search algorithm to optimize multi-server location-allocation problem in congested systems

Hajipour, V ; Sharif University of Technology

969 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.cie.2014.03.018
  3. Abstract:
  4. A novel bi-objective multi-server location-allocation (LA) model is developed in this paper, in which the facilities are modeled as an M/M/m queuing system. Further, capacity and budget limitations are provided to make the LA problem more realistic. The two objective functions include (1) minimizing aggregate waiting times and (2) minimizing the maximum idle time of all facilities. Since the proposed model is NP-hard, a meta-heuristic algorithm called multi-objective harmony search algorithm (MOHA) is developed to solve it. In this algorithm, a new presentation scheme that satisfies most of the model constraints is proposed. Since there is no benchmark available in the literature to validate the results obtained, the performance of MOHA is statistically compared with the ones of two other common meta-heuristics called multi-objective genetic algorithm (MOGA) and multi-objective simulated annealing (MOSA). The parameters of all algorithms are first calibrated by means of the Taguchi method using a novel metric. The comparison results based on different problem sizes are in favor of MOHA
  5. Keywords:
  6. Multi-objective harmony search algorithm ; Multi-objective location-allocation problem ; Multi-server ; Benchmarking ; Heuristic algorithms ; Queueing networks ; Simulated annealing ; Taguchi methods ; Harmony search algorithms ; Location allocation problem ; Location-allocation ; Meta heuristic algorithm ; Multi-objective genetic algorithm ; Multi-server ; Objective functions ; Queuing systems ; Learning algorithms
  7. Source: Computers and Industrial Engineering ; Vol. 72, Issue. 1 , 2014 , pp. 187-197 ; ISSN: 03608352
  8. URL: http://www.sciencedirect.com/science/article/pii/S0360835214000916