Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem

10Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

This study proposes a novel methodology towards using ant colony optimization (ACO) with stochastic demand. In particular, an optimization- simulation-optimization approach is used to solve the Stochastic uncapacitated location-allocation problem with an unknown number of facilities, and an ob- jective of minimizing the fixed and transportation costs. ACO is modeled using discrete event simulation to capture the randomness of customers' demand, and its objective is to optimize the costs. On the other hand, the simulated ACO's parameters are also optimized to guarantee superior solutions. This approach's performance is evaluated by comparing its solutions to the ones obtained us- ing deterministic data. The results show that simulation was able to identify better facility allocations where the deterministic solutions would have been inadequate due to the real randomness of customers' demands.

Cite

CITATION STYLE

APA

Arnaout, J. P., Arnaout, G., & El Khoury, J. (2016). Simulation and optimization of ant colony optimization algorithm for the stochastic uncapacitated location-allocation problem. Journal of Industrial and Management Optimization, 12(4), 1215–1225. https://doi.org/10.3934/jimo.2016.12.1215

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free