Solving a distribution network design problem by means of evolutionary algorithms

Cabrera G.; Niklander S.; Cabrera E.; Johnson F.

dc.contributor.author	Cabrera G.
dc.contributor.author	Niklander S.
dc.contributor.author	Cabrera E.
dc.contributor.author	Johnson F.
dc.date.accessioned	2020-09-02T22:13:44Z
dc.date.available	2020-09-02T22:13:44Z
dc.date.issued	2016
dc.identifier.citation	25, 1, 21-28
dc.identifier.issn	12201766
dc.identifier.uri	https://hdl.handle.net/20.500.12728/3858
dc.description	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. © 2017, All Rights Reserved.
dc.language.iso	en
dc.publisher	National Institute for R and D in Informatics
dc.subject	Combinatorial optimisation
dc.subject	Distribution network design
dc.subject	Evolutionary algorithm
dc.subject	Logistics
dc.title	Solving a distribution network design problem by means of evolutionary algorithms
dc.type	Article