Name
Abstract | ||
|---|---|---|
Container terminals are continuously facing the challenge of strong competition between ports. In this study, we present the terminal of Normandy-Le Havre port. We consider a mixed integer programming problem for the problem of assigning optimal delivery tasks to lifting vehicles. There are a lot of algorithms designed for this problem such as B&B method, cutting plane,... By using an exact penalty technique we treat this problem as a DC programme in the context of continuous optimisation. Further, we combine DCA with the classical Branch and Bound method for finding global solutions. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1504/IJIIDS.2012.050092 | IJIIDS |
Keywords | Field | DocType |
b method,dc programme,automated port container terminal,classical branch,global solution,continuous optimisation,quay crane,exact penalty technique,normandy-le havre port,bound method,container terminal,mixed integer programming problem,competition,algorithms,mixed integer programming,branch and bound | Port (computer networking),Branch and bound,Cutting-plane method,Mathematical optimization,Scheduling (computing),Computer science,B-Method,Integer programming,Dc programming,Branch and bound method | Journal |
Volume | Issue | Citations |
6 | 6 | 1 |
PageRank | References | Authors |
0.35 | 6 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Le Hoai Minh | 1 | 131 | 7.91 |
| Adnan Yassine | 2 | 136 | 20.53 |
| Riadh Moussi | 3 | 7 | 1.95 |