Use of Cartesian Coordinate Geometry in Solving One-Dimensional Bin-Packing Problems
Saved in:
| Title: | Use of Cartesian Coordinate Geometry in Solving One-Dimensional Bin-Packing Problems |
|---|---|
| Authors: | Rodrigo, Niluka, Daundasekera, W B, Pereraa, AAI |
| Source: | MathLAB Journal; Vol. 1 No. 1 (2018): Mathematical Theories; 143-153 ; 2582-0389 |
| Publisher Information: | PURKH |
| Publication Year: | 2018 |
| Collection: | PURKH (E-Journals) |
| Subject Terms: | Python Software Package, MBBA, BPP |
| Description: | In this paper, our objective is to investigate a mathematical formulation of solving the Bin Packing Problem (BPP). It has become one of the leading mathematical applications throughout the time. A BPP basically describes in three ways; One-Dimensional, Two-Dimensional and Three-Dimensional Bin Packing problems. In our approach, Modified Branch and Bound Algorithm (MBBA) is developed to generate all the feasible packing patterns of given boxes to required containers for One-Dimensional BPP. Further development of algorithms was made to ascertain the locations of each box within the container by using Cartesian coordinate system. Developed algorithms are coded and programmed in the Python programming environment to generate feasible packing patterns. |
| Document Type: | article in journal/newspaper |
| File Description: | application/pdf |
| Language: | English |
| Relation: | https://purkh.com/index.php/mathlab/article/view/53/11; https://purkh.com/index.php/mathlab/article/view/53 |
| Availability: | https://purkh.com/index.php/mathlab/article/view/53 |
| Rights: | Copyright (c) 2018 Niluka Rodrigo |
| Accession Number: | edsbas.ADA2AE20 |
| Database: | BASE |
Nájsť tento článok vo Web of Science Be the first to leave a comment!