Name
Title | ||
|---|---|---|
Modified NSGA-II for Solving Continuous Berth Allocation Problem: Using Multiobjective Constraint-Handling Strategy. |
Abstract | ||
|---|---|---|
Continuous berth allocation problem (BAPC) is a major optimization problem in transportation engineering. It mainly aims at minimizing the port stay time of ships by optimally scheduling ships to the berthing areas along quays while satisfying several practical constraints. Most of the previous literatures handle the BAPC by heuristics with different constraint handling strategies as it is proved ... |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1109/TCYB.2017.2669334 | IEEE Transactions on Cybernetics |
Keywords | Field | DocType |
Marine vehicles,Optimization,Containers,Resource management,Cranes,Genetic algorithms,Layout | Resource management,Mathematical optimization,Berth allocation problem,Scheduling (computing),Multi-objective optimization,Sorting,Heuristics,Optimization problem,Genetic algorithm,Mathematics | Journal |
Volume | Issue | ISSN |
47 | 9 | 2168-2267 |
Citations | PageRank | References |
7 | 0.43 | 22 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bin Ji | 1 | 8 | 1.12 |
| Xiao-Hui Yuan | 2 | 534 | 75.44 |
| Yanbin Yuan | 3 | 140 | 17.67 |