A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation-Reference-Cited by-同舟云学术

A fast and scalable bottom-left-fill algorithm to solve nesting problems using a semi-discrete representation

Published:2021-10 Issue: Volume: Page:
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Chehrazad Sahar^ORCID,Roose Dirk^ORCID,Wauters Tony

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modelling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference31 articles.

1. Semi-discrete geometric representation for nesting problems;Akunuru;International Journal of Production Research,2013

2. Dealing with nonregular shapes packing;Amaro Junior;Mathematical Problems in Engineering,2014

3. Algorithms for nesting with defects;Baldacci;Discrete Applied Mathematics,2014

4. The geometry of nesting problem: A tutorial;Bennell;European Journal of Operational Research,2008

5. Computational geometry: Algorithms and applications;de Berg,2008

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Apron layout planning–Optimal positioning of aircraft stands;Transportation Research Part B: Methodological;2024-01

2. A Fitness Functions Based Algorithm for the Two-Dimensional Irregular Strip Packing Problem;2023 19th International Asian School-Seminar on Optimization Problems of Complex Systems (OPCS);2023-08-14

3. Artificial Bee Colony Algorithm with Pareto-Based Approach for Multi-Objective Three-Dimensional Single Container Loading Problems;Applied Sciences;2023-05-29