Show simple item record

dc.contributor.authorCabrera G.
dc.contributor.authorNiklander S.
dc.contributor.authorCabrera E.
dc.contributor.authorJohnson F.
dc.date.accessioned2020-09-02T22:13:44Z
dc.date.available2020-09-02T22:13:44Z
dc.date.issued2016
dc.identifier.citation25, 1, 21-28
dc.identifier.issn12201766
dc.identifier.urihttps://hdl.handle.net/20.500.12728/3858
dc.descriptionIn 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.isoen
dc.publisherNational Institute for R and D in Informatics
dc.subjectCombinatorial optimisation
dc.subjectDistribution network design
dc.subjectEvolutionary algorithm
dc.subjectLogistics
dc.titleSolving a distribution network design problem by means of evolutionary algorithms
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record