A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
From MaRDI portal
Publication:2275813
DOI10.1016/j.ejor.2011.04.015zbMath1218.90076OpenAlexW2087845706MaRDI QIDQ2275813
Ren-Qian Zhang, Ikou Kaku, Qiu Hong Zhao, Yi-Yong Xiao
Publication date: 10 August 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.04.015
production planningmeta-heuristicsmaterial requirement planning (MRP)reduced variable neighborhood search (RVNS) algorithmuncapacitated multilevel lot-sizing (MLLS) problem
Related Items (9)
Optimizing frequent time-window selection for association rules mining in a temporal database using a variable neighbourhood search ⋮ Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems ⋮ Variable neighborhood search for metric dimension and minimal doubly resolving set problems ⋮ Minimum common string partition: on solving large‐scale problem instances ⋮ A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems ⋮ Designing a sustainable closed-loop supply chain network based on triple bottom line approach: a comparison of metaheuristics hybridization techniques ⋮ Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems ⋮ A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts ⋮ A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
Cites Work
- Single-point stochastic search algorithms for the multi-level lot-sizing problem
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- Variable neighbourhood search: methods and applications
- Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
- Variable neighbourhood search: Methods and applications
- Variable neighborhood search
- A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- An evaluation of heuristic performance in multi-stage lot-sizing systems
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Optimal Multi-Level Lot Sizing for Requirements Planning Systems
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- Dynamic Lot Size Models for Multi-Stage Assembly Systems
- Variable neighborhood search for the p-median
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- Minimum Concave Cost Flows in Certain Networks
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- Variable neighborhood search: Principles and applications
This page was built for publication: A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
