A genetic algorithm for 1,5 dimensional assortment problems with multiple objectives

DOI10.1007/3-540-45034-3_5MaRDI QIDQ4450822zbMATH OpenFDO

Authors Tugba Saraç, Müjgan Sagir Ozdemir

Publication date 16 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2718/27180041.htm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computing methodologies and applications (68U99)

Recommendations

• A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
• Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm
• A multi-objective programming approach to 1.5-dimensional assortment problem
• A genetic algorithm solution for one-dimensional bundled stock cutting
• An algorithm for the two-dimensional assortment problem

Cited in

(8)

• A genetic algorithm solution for one-dimensional bundled stock cutting
• An exact model for a slitting problem in the steel industry
• An integrated genetic algorithm approach to 1D-cutting stock problem
• An optimization model for trim loss minimization in an automotive glass plant
• Improving Cutting-Stock Plans with Multi-objective Genetic Algorithm
• Cutting optimization with variable-sized stock and inventory status data
• A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
• A multi-objective programming approach to 1.5-dimensional assortment problem

This page was built for publication: A genetic algorithm for 1,5 dimensional assortment problems with multiple objectives

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450822)