Genetic Algorithm

Population-based metaheuristic searching over encoded solutions.

Also called: Genetic Algorithm · GA · 진화 알고리즘

A population-based metaheuristic that evolves candidate solutions via selection, crossover, and mutation. Applied to nesting, the genome usually encodes piece order and orientation; a constructive placement rule (e.g. bottom-left-fill) decodes it into a concrete layout that is then scored. It offers no global-optimality guarantee, and performance is reported per benchmark and configuration rather than as a single solver.

Claims & evidence

Every relationship is a claim with an evidence grade; applicable problem-to-problem relationships also carry an equivalence level. See the evidence policy.

A–X describes evidence reliability; E0–E4 describes mathematical similarity between problems. The two axes are independent.

Relationships to this entry 6

uses method
2D Bin Packing to Genetic Algorithm
2D bin packing has also been addressed with metaheuristics such as genetic algorithms.
EvidenceB · Survey / tutorial / community
Sources
- Source grade: A — Peer-reviewed / officialTwo-dimensional packing problems: A survey
  Citation details
  Lodi, A., Martello, S., Monaci, M. (2002). Two-dimensional packing problems: A survey. EJOR 141(2):241-252. Surveys lower bounds, exact (branch-and-bound), shelf/heuristic, and metaheuristic methods for two-dimensional bin packing and strip packing.
uses method
2D Irregular Nesting to Genetic Algorithm
Irregular nesting has been reported with genetic-algorithm-based search over piece sequence and orientation, paired with a placement heuristic.
EvidenceB · Survey / tutorial / community
Sources
- Source grade: B — Survey / tutorial / communityA tutorial in irregular shape packing problems
  Citation details
  Bennell, J.A., Oliveira, J.F. (2009). A tutorial in irregular shape packing problems. JORS 60(S1):S93-S105.
uses method
2D Knapsack to Genetic Algorithm
2D knapsack variants have also been addressed with metaheuristics such as genetic algorithms.
EvidenceB · Survey / tutorial / community
Sources
- Source grade: A — Peer-reviewed / officialAn improved typology of cutting and packing problems
  Citation details
  Wäscher, G., Haußner, H., Schumann, H. (2007). An improved typology of cutting and packing problems. EJOR 183(3):1109-1130.
uses method
2D Strip Packing to Genetic Algorithm
Rectangle strip/packing has been addressed with genetic-algorithm search over piece sequence and orientation.
EvidenceB · Survey / tutorial / community
Sources
- Source grade: A — Peer-reviewed / officialOn genetic algorithms for the packing of polygons
  Citation details
  Jakobs, S. (1996). On genetic algorithms for the packing of polygons. EJOR 88(1):165-181. Origin of the bottom-left-fill placement heuristic.
uses method
3D Bin Packing to Genetic Algorithm
Container loading / 3D bin packing has been widely addressed with metaheuristics such as genetic algorithms.
EvidenceB · Survey / tutorial / community
Sources
- Source grade: A — Peer-reviewed / officialConstraints in container loading – A state-of-the-art review
  Citation details
  Bortfeldt, A., Wäscher, G. (2013). Constraints in container loading – A state-of-the-art review. EJOR 229(1):1-20.
uses method
Guillotine Cutting to Genetic Algorithm
Guillotine cutting / panel cutting has also been addressed with metaheuristics such as genetic algorithms.
EvidenceB · Survey / tutorial / community
Sources
- Source grade: A — Peer-reviewed / officialTwo-dimensional packing problems: A survey
  Citation details
  Lodi, A., Martello, S., Monaci, M. (2002). Two-dimensional packing problems: A survey. EJOR 141(2):241-252. Surveys lower bounds, exact (branch-and-bound), shelf/heuristic, and metaheuristic methods for two-dimensional bin packing and strip packing.

Relationships to this entry
Relationship	Claim	Evidence	Equiv.	Sources
uses method 2D Bin Packing to Genetic Algorithm	2D bin packing has also been addressed with metaheuristics such as genetic algorithms.	B · Survey / tutorial / community	—	Source grade: A — Peer-reviewed / officialTwo-dimensional packing problems: A survey Citation details Lodi, A., Martello, S., Monaci, M. (2002). Two-dimensional packing problems: A survey. EJOR 141(2):241-252. Surveys lower bounds, exact (branch-and-bound), shelf/heuristic, and metaheuristic methods for two-dimensional bin packing and strip packing.
uses method 2D Irregular Nesting to Genetic Algorithm	Irregular nesting has been reported with genetic-algorithm-based search over piece sequence and orientation, paired with a placement heuristic.	B · Survey / tutorial / community	—	Source grade: B — Survey / tutorial / communityA tutorial in irregular shape packing problems Citation details Bennell, J.A., Oliveira, J.F. (2009). A tutorial in irregular shape packing problems. JORS 60(S1):S93-S105.
uses method 2D Knapsack to Genetic Algorithm	2D knapsack variants have also been addressed with metaheuristics such as genetic algorithms.	B · Survey / tutorial / community	—	Source grade: A — Peer-reviewed / officialAn improved typology of cutting and packing problems Citation details Wäscher, G., Haußner, H., Schumann, H. (2007). An improved typology of cutting and packing problems. EJOR 183(3):1109-1130.
uses method 2D Strip Packing to Genetic Algorithm	Rectangle strip/packing has been addressed with genetic-algorithm search over piece sequence and orientation.	B · Survey / tutorial / community	—	Source grade: A — Peer-reviewed / officialOn genetic algorithms for the packing of polygons Citation details Jakobs, S. (1996). On genetic algorithms for the packing of polygons. EJOR 88(1):165-181. Origin of the bottom-left-fill placement heuristic.
uses method 3D Bin Packing to Genetic Algorithm	Container loading / 3D bin packing has been widely addressed with metaheuristics such as genetic algorithms.	B · Survey / tutorial / community	—	Source grade: A — Peer-reviewed / officialConstraints in container loading – A state-of-the-art review Citation details Bortfeldt, A., Wäscher, G. (2013). Constraints in container loading – A state-of-the-art review. EJOR 229(1):1-20.
uses method Guillotine Cutting to Genetic Algorithm	Guillotine cutting / panel cutting has also been addressed with metaheuristics such as genetic algorithms.	B · Survey / tutorial / community	—	Source grade: A — Peer-reviewed / officialTwo-dimensional packing problems: A survey Citation details Lodi, A., Martello, S., Monaci, M. (2002). Two-dimensional packing problems: A survey. EJOR 141(2):241-252. Surveys lower bounds, exact (branch-and-bound), shelf/heuristic, and metaheuristic methods for two-dimensional bin packing and strip packing.