Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem

DOI10.1016/0377-0427(95)00009-7zbMath0864.65037OpenAlexW1981861951MaRDI QIDQ1917905

C. Antoniadis, Marc Pirlot, Jacques jun. Teghem

Publication date: 22 June 1997

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-0427(95)00009-7

zbMATH Keywords

linear programmingcombinatorial optimizationsimulated annealingheuristic searchnonlinear mixed integer programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Linear programming (90C05) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (21)

A branch-and-price-and-cut algorithm for the pattern minimization problem ⋮ A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots ⋮ Genetic algorithms to solve the cover printing problem ⋮ Minimizing setups and waste when printing labels of consumer goods ⋮ Two heuristics for the label printing problem ⋮ A linear programming embedded genetic algorithm for an integrated cell formation and lot sizing considering product quality ⋮ Ad hoc heuristic for the cover printing problem ⋮ A two-phase heuristic algorithm for the label printing problem ⋮ A hybrid simulated annealing/linear programming approach for the cover printing problem ⋮ Simultaneous lotsizing and scheduling by combining local search with dual reoptimization ⋮ Lot sizing and furnace scheduling in small foundries ⋮ Optimal job splitting on a multi-slot machine with applications in the printing industry ⋮ Integrating supplier selection in optimal product family design ⋮ An efficient modified boosting method for solving classification problems ⋮ A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound ⋮ Grouping operations in cellular manufacturing considering alternative routings and the impact of run length on product quality ⋮ Grouping operations in cellular manufacturing considering alternative routings and the impact of run length on product quality ⋮ General local search methods ⋮ New lower bounds based on column generation and constraint programming for the pattern minimization problem ⋮ Using a greedy random adaptative search procedure to solve the cover printing problem ⋮ Towards an efficient resolution of printing problems

Cites Work

• Unnamed Item
• Unnamed Item

This page was built for publication: Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem