A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
From MaRDI portal
Publication:875398
DOI10.1016/J.COR.2005.09.022zbMATH Open1141.90576DBLPjournals/cor/PitakasoADH07OpenAlexW2057585911WikidataQ59389731 ScholiaQ59389731MaRDI QIDQ875398FDOQ875398
Authors: Rapeepan Pitakaso, Christian Almeder, K. F. Doerner, Richard F. Hartl 
Publication date: 13 April 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.09.022
Recommendations
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- Combining population-based and exact methods for multi-level capacitated lot-sizing problems
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- Comparison among three algorithms to solve unconstrained MLLS problems
Cites Work
- Ant colony optimization.
- Dynamic version of the economic lot size model
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- Title not available (Why is that?)
- Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
- Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
- A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC
- Improved Heuristics for Multi-Stage Requirements Planning Systems
- Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
- Randomized multi-level lot-sizing heuristics for general product structures.
- A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
- Multi-level multi-item lot size planning with limited resources and general manufacturing structure.
- Single-point stochastic search algorithms for the multi-level lot-sizing problem
Cited In (18)
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials
- Decentralized multi-level uncapacitated lot-sizing by automated negotiation
- Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes
- Title not available (Why is that?)
- Predictive search for capacitated multi-item lot sizing problems
- Comparison among three algorithms to solve unconstrained MLLS problems
- Incorporating a database approach into the large-scale multi-level lot sizing problem
- An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes
- A hybrid optimization approach for multi-level capacitated lot-sizing problems
- The stochastic lot-sizing problem with quantity discounts
- A decision support system based on an artificial multiple intelligence system for vegetable crop land allocation problem
- Solving lot-sizing problem with quantity discount and transportation cost
- Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems
- Reliability-based topology optimization of double layer grids using a two-stage optimization method
- Title not available (Why is that?)
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
Uses Software
This page was built for publication: A MAX-MIN ant system for unconstrained multi-level lot-sizing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875398)
