2018
DOI: 10.1155/2018/2024184
|View full text |Cite
|
Sign up to set email alerts
|

Optimization of Heterogeneous Container Loading Problem with Adaptive Genetic Algorithm

Abstract: This paper studies an optimized container loading problem with the goal of maximizing the 3D space utilization. Based on the characteristics of the mathematical loading model, we develop a dedicated placement heuristic integrated with a novel dynamic space division method, which enables the design of the adaptive genetic algorithm in order to maximize the loading space utilization. We use both weakly and strongly heterogeneous loading data to test the proposed algorithm. By choosing 15 classic sets of test dat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 15 publications
(7 citation statements)
references
References 35 publications
0
7
0
Order By: Relevance
“…It provides new ideas for solving the large-scale complex problem and has been widely used in robot controlling due to its many advantages of self-organization, parallelism, distribution, flexibility, and robustness. Currently, humans have developed many swarm intelligence algorithms by imitating the biological groups and their genetic evolution process in nature, such as particle swarm optimization (PSO) algorithm, ant colony optimization (ACO) algorithm, shuffled frog-leaping algorithm, artificial fish-swarm algorithm, and cuckoo search algorithm [44][45][46][47][48]. Although many scholars have improved their theory and made achievements, the improved methods still have the disadvantages of slow convergence, computational complexity, and falling into its local optimum.…”
Section: Grey Wolf Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…It provides new ideas for solving the large-scale complex problem and has been widely used in robot controlling due to its many advantages of self-organization, parallelism, distribution, flexibility, and robustness. Currently, humans have developed many swarm intelligence algorithms by imitating the biological groups and their genetic evolution process in nature, such as particle swarm optimization (PSO) algorithm, ant colony optimization (ACO) algorithm, shuffled frog-leaping algorithm, artificial fish-swarm algorithm, and cuckoo search algorithm [44][45][46][47][48]. Although many scholars have improved their theory and made achievements, the improved methods still have the disadvantages of slow convergence, computational complexity, and falling into its local optimum.…”
Section: Grey Wolf Algorithmmentioning
confidence: 99%
“…Previous Optimization Methods. For evaluating the performance of the GWO algorithm in rapidly tuning the online robust control scheme, we compare it with other online iteration algorithms like particle swarm optimization (PSO) [46], ant colony algorithm (ACO) [47], genetic algorithm (GA) [48], and Kleinman method [38]. e comparison is shown in Figure 8.…”
Section: Case 2: Comparative Computational Efficiency Withmentioning
confidence: 99%
“…Consequently, popular metaheuristics such as genetic algorithms, tabu search and simulated annealing, as well as heuristics based on the familiarity with the real problem, are often used to solve cargo loading problems. There were numerous papers in the past that used genetic algorithms (GA) for the CLP, while many papers do so even today [23,27,28]. Consequently, the paper [28] presents an adaptive GA, based on the general loading mathematical model aiming to maximize space utilization.…”
Section: Literature Reviewmentioning
confidence: 99%
“…There were numerous papers in the past that used genetic algorithms (GA) for the CLP, while many papers do so even today [23,27,28]. Consequently, the paper [28] presents an adaptive GA, based on the general loading mathematical model aiming to maximize space utilization. Based on the dynamic space division method, the authors develop a dedicated genetic algorithm that uses a two-stage real-number encoding method.…”
Section: Literature Reviewmentioning
confidence: 99%
“…However, when the average fitness is close to the maximum fitness of the contemporary population, it is easy to cause a large number of individuals to have a lower crossover probability and mutation probability, which will stagnate the evolution. This improved AGA has also been applied to many fields such as the three-dimensional container loading problem [27] and the laminate stacking sequence optimization [28]. In addition, the algorithm proposed by Ren is only in view of individual fitness.…”
Section: Introductionmentioning
confidence: 99%