A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
From MaRDI portal
Publication:2256206
Recommendations
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
- A variable neighborhood search for multi-family capacitated lot-sizing problem
Cites work
- A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
- A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- A parallel genetic algorithm for the multilevel unconstrained lot-sizing problem
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- An evaluation of heuristic performance in multi-stage lot-sizing systems
- Combining population-based and exact methods for multi-level capacitated lot-sizing problems
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- Computational complexity of uncapacitated multi-echelon production planning problems
- Computationally Efficient Optimal Solutions to the Lot-Sizing Problem in Multistage Assembly Systems
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
- Dynamic Lot Size Models for Multi-Stage Assembly Systems
- Fix-and-optimize heuristics for capacitated lot-sizing with sequence-dependent setups and substitutions
- Heterogeneous computing and parallel genetic algorithms.
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- Minimum Concave Cost Flows in Certain Networks
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- Optimal Lot-Sizing Algorithms for Complex Product Structures
- Single-point stochastic search algorithms for the multi-level lot-sizing problem
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
- The team orienteering problem with time windows: an LP-based granular variable neighborhood search
- Variable neighborhood search
- Variable neighborhood search for metric dimension and minimal doubly resolving set problems
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: Methods and applications
- Variable neighbourhood search: methods and applications
Cited in
(20)- General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain
- A variable neighborhood search for multi-family capacitated lot-sizing problem
- Multilayer variable neighborhood search for two-level uncapacitated facility location problems with single assignment
- 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
- Neighbourhood search meta-heuristics for capacitated lot-sizing with sequence-dependent setups
- Comparison among three algorithms to solve unconstrained MLLS problems
- 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
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems
- Variable neighborhood search for multiple level warehouse layout problem
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- Modeling and solving the constrained multi-items lot-sizing problem with time-varying setup cost
- Local search intensified: very large-scale variable neighborhood search for the multi-resource generalized assignment problem
- Predictive search for capacitated multi-item lot sizing problems
- Variable neighborhood formulation search approach for the multi-item capacitated lot-sizing problem with time windows and setup times
- 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
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)
