A stochastic search optimization algorithm is developed and applied to solve a bi-objective competitive facility location problem for firm expansion. Parallel versions of the developed algorithm for shared- and distributed-memory parallel computing systems are proposed and experimentally investigated by approximating the Pareto front of the competitive facility location problem of different scope. It is shown that the developed algorithm has advantages against its precursor in the sense of the precision of approximation. It is also shown that the proposed parallel versions of the algorithm have almost linear speed-up when solving competitive facility location problems of different scope reasonable for practical applications.
Lančinskas, A., Ortigosa, P. M., & Žilinskas, J. (2015). Parallel Optimization Algorithm for Competitive Facility Location. Mathematical Modelling and Analysis, 20(5), 619-640. https://doi.org/10.3846/13926292.2015.1088903
Authors who publish with this journal agree to the following terms
that this article contains no violation of any existing copyright or other third party right or any material of a libelous, confidential, or otherwise unlawful nature, and that I will indemnify and keep indemnified the Editor and THE PUBLISHER against all claims and expenses (including legal costs and expenses) arising from any breach of this warranty and the other warranties on my behalf in this agreement;
that I have obtained permission for and acknowledged the source of any illustrations, diagrams or other material included in the article of which I am not the copyright owner.
on behalf of any co-authors, I agree to this work being published in the above named journal, Open Access, and licenced under a Creative Commons Licence, 4.0 https://creativecommons.org/licenses/by/4.0/legalcode. This licence allows for the fullest distribution and re-use of the work for the benefit of scholarly information.
For authors that are not copyright owners in the work (for example government employees), please contact VILNIUS TECHto make alternative agreements.