TY - JOUR

T1 - Solving a distribution network design problem by means of evolutionary algorithms

AU - CABRERA GUERRERO, GUILLERMO NICOLAS

AU - Niklander, Stefanie

AU - Cabrera, Enrique

AU - Johnson, Franklin

PY - 2016/1/1

Y1 - 2016/1/1

N2 - In this paper a simple and efficient evolutionary algorithm is implemented to solve a Distribution Network Design problem (DND). The DND problem that we address here integrates inventory policies with location/allocation decision making. This problem, also known as Inventory Location Modeling problem, is a complex combinatorial optimization problem that cannot be solved by exact methods as the number of decision variables increases. We compare our algorithm to previously implemented algorithms. Our evolutionary approach is shown to be very competitive in terms of both objective function value and execution time.

AB - In this paper a simple and efficient evolutionary algorithm is implemented to solve a Distribution Network Design problem (DND). The DND problem that we address here integrates inventory policies with location/allocation decision making. This problem, also known as Inventory Location Modeling problem, is a complex combinatorial optimization problem that cannot be solved by exact methods as the number of decision variables increases. We compare our algorithm to previously implemented algorithms. Our evolutionary approach is shown to be very competitive in terms of both objective function value and execution time.

KW - Combinatorial optimisation

KW - Distribution network design

KW - Evolutionary algorithm

KW - Logistics

UR - http://www.scopus.com/inward/record.url?scp=85012964558&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:85012964558

VL - 25

SP - 21

EP - 28

JO - Studies in Informatics and Control

JF - Studies in Informatics and Control

SN - 1220-1766

IS - 1

ER -