An Evolutionary Algorithm for solving the Two-Dimensional Irregular Shape Packing Problem combined with the Knapsack Problem
This work presents an evolutionary algorithm to solve a joint problem of the Packing Problem and the Knapsack Problem, where the objective is to place items (with shape, value and weight) in a container (defined by its shape and capacity), maximizing the container's value, without intersections...
| Author: | |
|---|---|
| Format: | master thesis |
| Publication Date: | 2020 |
| Country: | España |
| Institution: | Universitat Politècnica de Catalunya (UPC) |
| Repository: | UPCommons. Portal del coneixement obert de la UPC |
| Language: | English |
| OAI Identifier: | oai:upcommons.upc.edu:2117/178858 |
| Online Access: | https://hdl.handle.net/2117/178858 |
| Access Level: | Open access |
| Keyword: | Genetic algorithms Artificial intelligence Problema de Packing Problema d'Empaquetat Problema de Packing amb formes irregulars Problema de Packing 2D Problema de Packing bidimensional Problema de la Motxilla Problema de la Motxilla 0/1 Problem de Packing i de la Motxilla Problema de la Motxtilla amb Packing Problema combinat Problema conjunt Problema híbrid Optimització Algorisme evolutiu Intel·ligència Artificial Packing Problem Irregular Shape Packing Problem 2D Packing Problem Two-Dimensional Packing Problem Knapsack Problem 0/1 Knapsack Problem Packing Knapsack Problem Knapsack Packing Problem Joint Problem Hybrid Problem Optimization Evolutionary algorithm Algorismes genètics Intel·ligència artificial Àrees temàtiques de la UPC::Informàtica |
| Summary: | This work presents an evolutionary algorithm to solve a joint problem of the Packing Problem and the Knapsack Problem, where the objective is to place items (with shape, value and weight) in a container (defined by its shape and capacity), maximizing the container's value, without intersections. |
|---|