A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
From MaRDI portal
Publication:1988631
DOI10.1016/j.apm.2019.07.010zbMath1443.90292OpenAlexW2953857490WikidataQ127537240 ScholiaQ127537240MaRDI QIDQ1988631
Publication date: 24 April 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2019.07.010
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
- Adaptive weighted sum method for multiobjective optimization: a new method for Pareto front generation
- A new search procedure for the two-dimensional orthogonal packing problem
- Hardness of approximation for orthogonal rectangle packing and covering problems
- On genetic algorithms for the packing of polygons
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A conic scalarization method in multi-objective optimization
- A new constraint programming approach for the orthogonal packing problem
- An improved typology of cutting and packing problems
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- A new exact method for the two-dimensional orthogonal packing problem
- A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
- Optimisation of a multi-objective two-dimensional strip packing problem based on evolutionary algorithms
- Orthogonal Packings in Two Dimensions
- A New Scalarization Technique and New Algorithms to Generate Pareto Fronts
- Conic Scalarization Method in Multiobjective Optimization and Relations with Other Scalarization Methods
This page was built for publication: A multi-objective genetic algorithm for a special type of 2D orthogonal packing problems
