Suriya Phongmoo
ABSTRACT
The objectives of this research aim to apply the mathematical model, to propose an Artificial Bee Colony for Solving Three-Dimensional Knapsack Problem and to determine the optimal parameters of an Artificial Bee Colony Algorithm. This work application of heuristic approach is used for optimizing containers loading problem and we has a contract with logistic and transport company in the northern of Thailand to joint on this research.
For the containers loading problem are the Three-Dimensional Knapsack Problem and it will be solving the real problem within the supporting of logistic and transport company in the northern of Thailand. However we deal with Nim See Seng Transport 1988 Co., Ltd cause of they are the big transportation company in the north of Thailand.
The result of this research will be comparing between performance of the result in OR-Library which is a database that collects the best optimal solution data about Three-Dimensional Knapsack Problem and Artificial Bee Colony Algorithm, on the other hand Artificial Bee Colony Algorithm will be provides the good solutions within the satisfaction computer runtime, maximize profit, minimize empty space and respond to customers satisfaction also.
- Lewandowski, Krzysztof (2016). "Growth in the Size of Unit Loads and Shipping Containers from Antique to WWI". Packaging Technology and Science. 29 (8--9): 451--478. doi:10.1002/pts.2231. ISSN 1099-1522.Google Scholar
- G. Scheithauer, Algorithms for the container loading problem, in: Operations Research Proceedings 1991, Springer, Berlin, 1992, pp. 445--452.Google ScholarCross Ref
- M. Gehring, K. Menscher, M. Meyer, A computer-based heuristic for packing pooled shipment containers, European Journal of Operational Research 44 (1990) 277--288.Google ScholarCross Ref
- C.S. Chen, S.M. Lee, Q.S. Shen, An analytical model for the container loading problem, European Journal of Operational Research 80 (1995) 68--76.Google ScholarCross Ref
- D., Karaboga, B., Basturk(2007). "On the performance of artificial bee colony (ABC) algorithm" Computer Engineering Department, Erciyes University.Google Scholar
- Leonardo Junqueira, Reinaldo Morabito, Denise Sato Yamashita (2012). "Three-dimensional container loading models with cargo stability and load bearing constraints" computer and operations research: 74--85Google Scholar
- G. Scheithauer, Algorithms for the container loading problem, in: Operations Research Proceedings 1991, Springer, Berlin, 1992, pp. 445--452.Google ScholarCross Ref
- M. Gehring, K. Menscher, M. Meyer, A computer-based heuristic for packing pooled shipment containers, European Journal of Operational Research 44 (1990) 277--288.Google ScholarCross Ref
- C.S. Chen, S.M. Lee, Q.S. Shen, An analytical model for the container loading problem, European Journal of Operational Research 80 (1995) 68--76.Google ScholarCross Ref
Index Terms
- Artificial Bee Colony for Solving Multi-Objectives Three-Dimensional Knapsack Problem
Recommendations
Velocity based artificial bee colony algorithm for high dimensional continuous optimization problems
Artificial bee colony (ABC) is a swarm optimization algorithm which has been shown to be more effective than the other population based algorithms such as genetic algorithm (GA), particle swarm optimization (PSO) and ant colony optimization (ACO). Since ...
Development and investigation of efficient artificial bee colony algorithm for numerical function optimization
Artificial bee colony algorithm (ABC), which is inspired by the foraging behavior of honey bee swarm, is a biological-inspired optimization. It shows more effective than genetic algorithm (GA), particle swarm optimization (PSO) and ant colony ...
The continuous artificial bee colony algorithm for binary optimization
This paper introduces an ABC variant to solve binary optimization problems.The performance of the proposed method is investigated on well-known UFLPs.The proposed method is compared with the ABC variants and PSO variants.The experimental results show ...
Comments