Informatica Logo

INFORMATICA
International Journal

Main Page
Editorial Board
Abstracting/Indexing
Instructions to Authors
Subscription Information


Contents
Author Index
Papers in Production

INFORMATICA, 2016, Vol. 27, No. 2, 451-462
© Institute of Mathematics and Informatics,
DOI: http://dx.doi.org/10.15388/Informatica.2016.94

ISSN 0868-4952

Solution of Discrete Competitive Facility Location Problem for Firm Expansion

Algirdas LANCINSKAS1, Pascual FERNÁNDEZ, Blas PELEGRÍN, Julius ZILINSKAS

Institute of Mathematics and Informatics, Vilnius University Akademijos 4, LT-08663, Vilnius, Lithuania Department of Statistics and Operations Research, University of Murcia, Spain E-mail: algirdas.lancinskas@mii.vu.lt, julius.zilinskas@mii.vu.lt, pfdez@um.es, pelegrin@um.es

Abstract

A new heuristic algorithm for solution of bi-objective discrete competitive facility location problems is developed and experimentally investigated by solving different instances of a facility location problem for firm expansion. The proposed algorithm is based on ranking of candidate locations for the new facilities, where rank values are dynamically adjusted with respect to behaviour of the algorithm. Results of the experimental investigation show that the proposed algorithm is suitable for the latter facility location problems and provides good results in sense of accuracy of the approximation of the true Pareto front.

Keywords:

facility location, multi-objective optimization, heuristic algorithms


1Corresponding author.
To preview Lithuanian abstract see full article text

PDFTo preview full article text in PDF format click here

Get Free ReaderYou could obtain free Acrobat Reader from Adobe


TopTop Copyright © INFORMATICA, Vilnius University Institute of Mathematics and Informatics, 2010