Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
Optimization of a Two-Echelon Location Lot-Sizing Routing Problem with Deterministic Demand
Ist Teil von
Mathematical problems in engineering, 2018-01, Vol.2018 (2018), p.1-12
Ort / Verlag
Cairo, Egypt: Hindawi Publishing Corporation
Erscheinungsjahr
2018
Quelle
Alma/SFX Local Collection
Beschreibungen/Notizen
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.