Optimization of a Two-Echelon Location Lot-Sizing Routing Problem with Deterministic Demand
Joint Authors
Kechmane, Laila
Nsiri, Benayad
Baalal, Azeddine
Source
Mathematical Problems in Engineering
Issue
Vol. 2018, Issue 2018 (31 Dec. 2018), pp.1-12, 12 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2018-06-14
Country of Publication
Egypt
No. of Pages
12
Main Subjects
Abstract EN
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.
American Psychological Association (APA)
Kechmane, Laila& Nsiri, Benayad& Baalal, Azeddine. 2018. Optimization of a Two-Echelon Location Lot-Sizing Routing Problem with Deterministic Demand. Mathematical Problems in Engineering،Vol. 2018, no. 2018, pp.1-12.
https://search.emarefa.net/detail/BIM-1206440
Modern Language Association (MLA)
Kechmane, Laila…[et al.]. Optimization of a Two-Echelon Location Lot-Sizing Routing Problem with Deterministic Demand. Mathematical Problems in Engineering No. 2018 (2018), pp.1-12.
https://search.emarefa.net/detail/BIM-1206440
American Medical Association (AMA)
Kechmane, Laila& Nsiri, Benayad& Baalal, Azeddine. Optimization of a Two-Echelon Location Lot-Sizing Routing Problem with Deterministic Demand. Mathematical Problems in Engineering. 2018. Vol. 2018, no. 2018, pp.1-12.
https://search.emarefa.net/detail/BIM-1206440
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1206440