optimization of a two-echelon location lot-sizing routing problem with deterministic demand
Clicks: 160
ID: 150556
2018
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
30.0
/100
160 views
38 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #263 of 1,093 articles by views in journal of power sources
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 1,093 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
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.
| Reference Key |
kechmane2018mathematicaloptimization
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Laila Kechmane;Benayad Nsiri;Azeddine Baalal |
| Journal | journal of power sources |
| Year | 2018 |
| DOI |
10.1155/2018/2745437
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.