Optimization of a two-echelon location lot-sizing routing problem with deterministic demand (Q1720647)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Optimization of a two-echelon location lot-sizing routing problem with deterministic demand |
scientific article; zbMATH DE number 7018698
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Optimization of a two-echelon location lot-sizing routing problem with deterministic demand |
scientific article; zbMATH DE number 7018698 |
Statements
Optimization of a two-echelon location lot-sizing routing problem with deterministic demand (English)
0 references
8 February 2019
0 references
Summary: 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.
0 references
0 references
0 references
0.762944221496582
0 references
0.7607781291007996
0 references
0.7597864270210266
0 references
0.7559689283370972
0 references
