Optimization of a Two-Echelon Location Lot-Sizing Routing Problem with Deterministic Demand

Laila Kechmane, Benayad Nsiri and Azeddine Baalal

Mathematical Problems in Engineering, 2018, vol. 2018, 1-12

Abstract:

This paper aims to solve a multiperiod location lot-sizing routing problem with deterministic demand in a two-echelon network composed of a single factory, a set of potential depots, and a set of customers. Solving this problem involves making strategic decisions such as location of depots as well as operational and tactical decisions which include customers’ assignment to the open depots, vehicle routing organization, and inventory management. A mathematical model is presented to describe the problem and a genetic algorithm combined with a local search procedure is proposed to solve it and is tested over three sets of instances.

Date: 2018
References: Add references at CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2018/2745437.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2018/2745437.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:2745437

DOI: 10.1155/2018/2745437

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().