Solving a distribution network design problem by means of evolutionary algorithms

GUILLERMO NICOLAS CABRERA GUERRERO, Stefanie Niklander, Enrique Cabrera, Franklin Johnson

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

Abstract

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.

Original languageEnglish
Pages (from-to)21-28
Number of pages8
JournalStudies in Informatics and Control
Volume25
Issue number1
StatePublished - 1 Jan 2016

Keywords

  • Combinatorial optimisation
  • Distribution network design
  • Evolutionary algorithm
  • Logistics

Fingerprint Dive into the research topics of 'Solving a distribution network design problem by means of evolutionary algorithms'. Together they form a unique fingerprint.

Cite this