Combining population-based and exact methods for multi-level capacitated lot-sizing problems

References

• Berretta , R and Rodrigues , LF . 2004 . A memetic algorithm for a multistage capacitated lot-sizing problem . Int. J. Prod. Econ. , 87 : 67 – 81 .
   Web of Science ®Google Scholar
• Berretta , R , Franca , PM and Armentano , VA . 2005 . Metaheuristic approaches for the multilevel resource-constraint lot-sizing problem with setup and lead times . Asia–Pacif. J. oper. Res , 22 : 261 – 286 .
   Web of Science ®Google Scholar
• Blackburn , JD and Millen , RA . 1982 . Improved heuristic performance in multi-stage lot sizing systems . Mgmt. Sci. , 28 : 44 – 56 .
   Web of Science ®Google Scholar
• Colorni , A , Dorigo , M and Maniezzo , V . 1992 . Distributed optimization by ant colonies. In Toward a Practice of Autonomous Systems: Proceedings of The First European Conference on Artificial Life . 1992 . Cambridge, MA : MIT Press .
   Google Scholar
• Dellaert , NP and Jeunet , J . 2003 . Randomized multi-level lot sizing heuristics for general product structures . Eur. J. oper. Res. , 148 : 211 – 228 .
   Web of Science ®Google Scholar
• Dongarra , JJ . 2005 . Performance of various computers using standard linear equations software (Linpack Benchmark Report) . University of Tennessee Computer Science Technical Report, CS-89-85 . 2005 .
   Google Scholar
• Dorigo , M and Stützle , T . 2004 . Ant Colony Optimization , Cambridge, MA : MIT Press .
   Google Scholar
• Franca , PM , Armentano , VA , Berretta , RE and Clark , AR . 1994 . A heuristic method for lot sizing in multi-stage systems . Comput. Oper. Res. , 24 : 861 – 874 .
   Web of Science ®Google Scholar
• Gutjahr , WJ . 2003 . A generalized convergence result for the graph-based ant system metaheuristic . Prob. Engng inf. Sci. , 17 : 545 – 569 .
   Web of Science ®Google Scholar
• Kirca , O and Kökten , M . 1994 . A new heuristic approach for the multi-item dynamic lot sizing problem . Eur. J. oper. Res. , 75 : 332 – 341 .
   Web of Science ®Google Scholar
• Maes , J and McClain , JO . 1991 . Multilevel capacitated lot sizing complexity and LP-based heuristics . Eur. J. oper. Res. , 53 : 131 – 148 .
   Web of Science ®Google Scholar
• Merkle , D and Middendorf , M . 2000 . “ An ant algorithm with a new pheromone evaluation rule for total tardiness problems ” . In In LNCS: Real-World Applications of Evolutionary Computing , Edited by: Cagnoni , S , Poli , R , Smith , GD , Corne , D , Oates , M , Hart , E , Lanzi , PL , Wollen , EJ , Li , Y , Paechter , B and Fogarty , TC . 287 – 296 . Berlin : Springer .
   Google Scholar
• Merkle , D , Middendorf , M and Schmeck , H . 2002 . Ant Colony optimization for resource constrained project scheduling . IEEE Trans. Evol. Comput. , 6 : 333 – 346 .
   Web of Science ®Google Scholar
• Özdamar , L and Barbarosoglu , G . 2000 . An integrated Lagrangean relaxation–simulated annealing approach to the multi-level multi-item capacitated lot sizing problem. . Int. J. Prod. Econ. , 68 : 319 – 331 .
   Web of Science ®Google Scholar
• Pitakaso , R , Almeder , C , Doerner , K and Hartl , RF . 2006 . A MAX–MIN ant system for the uncapacitated multi-level lot sizing problem . Comput. Oper. Res. , (in press)
   Web of Science ®Google Scholar
• Stadtler , H . 1996 . Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing . Eur. J. oper. Res. , 94 : 561 – 581 .
   Web of Science ®Google Scholar
• Stadtler , H . 2003 . Multilevel lot sizing with set up times and multiple constrained resources: internally rolling schedules with lot-sizing windows . Oper. Res. , 51 : 487 – 502 .
   Web of Science ®Google Scholar
• Stützle , T . 1998 . An ant approach to the flow shop problem . Proceedings of EUFIT'98 . 1998 . pp. 1560 – 1564 .
   Google Scholar
• Stützle , T and Hoos , H . 1997 . The MAX–MIN ant system and local search for the traveling salesman problem . Proceedings of ICEC'97—1997 IEEE 4th International Conference on Evolutionary Computation . 1997 . pp. 308 – 313 .
   Google Scholar
• Stützle , T and Hoos , H . 2000 . MAX–MIN ant system . Fut. Gener. Comput. Syst. , 16 : 889 – 914 .
   Web of Science ®Google Scholar
• Stützle , T and Dorigo , M . 2002 . A short convergence proof for a class of ACO algorithms . IEEE Trans. evol. Comput. , 6 : 358 – 365 .
   Web of Science ®Google Scholar
• Tempelmeier , H and Derstroff , M . 1996 . A lagrangean-based heuristic for dynamic multilevel multi-item constrained lotsizing with setup times . Mgmt. Sci. , 42 : 738 – 757 .
   Web of Science ®Google Scholar
• Tempelmeier , H and Helber , S . 1994 . A heuristic for dynamic multi-item multi-level capacitated lotsizing for general product structures . Eur. J. oper. Res. , 75 : 296 – 311 .
   Web of Science ®Google Scholar
• Trigeiro , W , Thomas , LJ and McClain , JO . 1989 . Capacitated lot sizing with set-up times . Mgmt. Sci. , 35 : 738 – 757 .
   Web of Science ®Google Scholar
• Xie , J and Dong , J . 2002 . Heuristic genetic algorithms for general capacitated lot-sizing problems . Comput. Math. Applic. , 44 : 263 – 276 .
   Web of Science ®Google Scholar