A MAX-MIN ant system for unconstrained multi-level lot-sizing problems

DOI10.1016/j.cor.2005.09.022zbMath1141.90576OpenAlexW2057585911WikidataQ59389731 ScholiaQ59389731MaRDI QIDQ875398

Rapeepan Pitakaso, Christian Almeder, Karl 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

zbMATH Keywords

ant colony optimizationmaterial requirements planningmulti-level lot-sizingWagner--Whitin algorithm

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Inventory, storage, reservoirs (90B05)

Related Items

A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes ⋮ An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes ⋮ The stochastic lot-sizing problem with quantity discounts ⋮ Predictive Search for Capacitated Multi-Item Lot Sizing Problems ⋮ Reliability-based topology optimization of double layer grids using a two-stage optimization method ⋮ Incorporating a database approach into the large-scale multi-level lot sizing problem ⋮ Distance and matching-induced search algorithm for the multi-level lot-sizing problem with substitutable bill of materials ⋮ A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems ⋮ Neighborhood search techniques for solving uncapacitated multilevel lot-sizing problems ⋮ Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight ⋮ A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems ⋮ Decentralized multi-level uncapacitated lot-sizing by automated negotiation ⋮ A hybrid optimization approach for multi-level capacitated lot-sizing problems ⋮ Solving lot-sizing problem with quantity discount and transportation cost

Uses Software

• Mlclsp

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Multi-level lot-sizing problem: Evaluation of a simulated-annealing heuristic
• A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures
• Randomized multi-level lot-sizing heuristics for general product structures.
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• Dynamic Version of the Economic Lot Size Model
• Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction
• Improved Heuristics for Multi-Stage Requirements Planning Systems
• Solving large unconstrained multilevel lot-sizing problems using a hybrid genetic algorithm
• A GENERALIZED CONVERGENCE RESULT FOR THE GRAPH-BASED ANT SYSTEM METAHEURISTIC

This page was built for publication: A MAX-MIN ant system for unconstrained multi-level lot-sizing problems