Differential evolution to solve the lot size problem in stochastic supply chain management systems

DOI10.1007/s10479-014-1778-0zbMath1350.90010OpenAlexW2040308678MaRDI QIDQ324304

Kris Lieckens, Nico J. Vandaele

Publication date: 11 October 2016

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/123456789/483221

zbMATH Keywords

production planningqueueing networklot sizingdifferential evolutionevolutionary optimization

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Economic models of real-world systems (e.g., electricity markets, etc.) (91B74)

Related Items (5)

Evolutionary algorithms for supply chain management ⋮ Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost ⋮ A multi-objective invasive weed optimization algorithm for robust aggregate production planning under uncertain seasonal demand ⋮ State-of-charge estimation based on theory of evidence and interval analysis with differential evolution optimization ⋮ Private labels and retail assortment planning: a differential evolution approach

Uses Software

• JADE

Cites Work

• Two-stage stochastic lot-sizing problem under cost uncertainty
• Buffer sizing in multi-product multi-reactor batch processes: Impact of allocation and campaign sizing policies
• Multi-item batching heuristics for minimization of queueing delays
• Design of manufacturing systems using queueing models
• Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
• Optimal grouping for a nuclear magnetic resonance scanner by means of an open queueing model.
• Expected time in system analysis of a single-machine multi-item processing center.
• Production planning with load dependent lead times: An update of research
• ACLIPS: A Capacity and Lead Time Integrated Procedure for Scheduling
• Lot Sizes, Lead Times and In-Process Inventories
• Multiproduct Queueing Networks with Deterministic Routing: Decomposition Approach and the Notion of Interference
• Approximations for the time spent in a dynamic job shop with applications to due-date assignment
• A Proof for the Queuing Formula: L = λW

This page was built for publication: Differential evolution to solve the lot size problem in stochastic supply chain management systems