A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
DOI10.1016/J.EJOR.2013.10.025zbMATH Open1305.90043OpenAlexW2006671471MaRDI QIDQ2256206FDOQ2256206
Ikou Kaku, Qiu-Hong Zhao, Yuchun Xu, Ren-Qian Zhang, 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
metaheuristicsvariable neighborhood search (VNS)multilevel lot-sizing (MLLS) problemADTS local search
Approximation methods and heuristics in mathematical programming (90C59) Inventory, storage, reservoirs (90B05)
Cites Work
- Variable neighbourhood search: Methods and applications
- Computational complexity of uncapacitated multi-echelon production planning problems
- Variable neighborhood search
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- 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
- Variable neighbourhood search: methods and applications
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- Minimum Concave Cost Flows in Certain Networks
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- Dynamic Lot Size Models for Multi-Stage Assembly Systems
- Single-point stochastic search algorithms for the multi-level lot-sizing problem
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
- Combining population-based and exact methods for multi-level capacitated lot-sizing problems
- Heterogeneous computing and parallel genetic algorithms.
- An evaluation of heuristic performance in multi-stage lot-sizing systems
Cited In (14)
- Predictive Search for Capacitated Multi-Item Lot Sizing Problems
- A reduced variable neighborhood search algorithm for 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
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost
- A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- A variable neighborhood search for the network design problem with relays
- A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
This page was built for publication: A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256206)