Solving a novel multi-objective inventory location problem by means of a local search algorithm

Carolina Lagos, Jorge Vega, Guillermo Guerrero, Jose Miguel Rubio

Producción científica: Contribución a una revistaArtículorevisión exhaustiva

6 Citas (Scopus)


Problems in operations research are usually modelled as single objective ones even though there exist several goals that should be attained. Multiple reasons of why inherently multi-objective problems are modelled as single objective can be identified: better understanding of the problem features, simplification of the mathematical formulation of the problem, among others. However, summarising (usually conflicting) objectives into one objective function can be a sign of over-simplification in the problem modelling process. In this paper we extend a single objective inventory location problem formulation to a multi-objective one. We consider two conflicting objectives, namely, location cost and inventory cost. As a result, we obtain a complex multi-objective non-linear integer programming problem. Like its single objective formulation, this multi-objective problem cannot be solved by exact methods as the number of decision variables increases. Thus, a simple yet effective multi-objective local search algorithm is implemented in this paper.

Idioma originalInglés
Páginas (desde-hasta)189-194
Número de páginas6
PublicaciónStudies in Informatics and Control
EstadoPublicada - 2016


Profundice en los temas de investigación de 'Solving a novel multi-objective inventory location problem by means of a local search algorithm'. En conjunto forman una huella única.

Citar esto