A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
From MaRDI portal
Publication:2256206
DOI10.1016/j.ejor.2013.10.025zbMath1305.90043MaRDI QIDQ2256206
Ikou Kaku, Yuchun Xu, Ren-Qian Zhang, Qiu Hong Zhao, Yi-Yong Xiao
Publication date: 19 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://dspace.lib.cranfield.ac.uk/handle/1826/8611
metaheuristics; variable neighborhood search (VNS); multilevel lot-sizing (MLLS) problem; ADTS local search
90C59: Approximation methods and heuristics in mathematical programming
90B05: Inventory, storage, reservoirs
Related Items
Predictive Search for Capacitated Multi-Item Lot Sizing Problems, Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry, Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems, A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem, Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, A variable neighborhood search for the network design problem with relays
Cites Work
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
- 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
- Computational complexity of uncapacitated multi-echelon production planning problems
- Variable neighborhood search
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- Heterogeneous computing and parallel genetic algorithms.
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- A Parallel Genetic Algorithm for the Multilevel Unconstrained Lot-Sizing Problem
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Combining population-based and exact methods for multi-level capacitated lot-sizing problems
- An evaluation of heuristic performance in multi-stage lot-sizing systems
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- Dynamic Lot Size Models for Multi-Stage Assembly Systems
- 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
