Berth allocation with service priority

Transportation Research Part B: Methodological

Volumn 37, Issue 5, 2003, Pages 437-457

  Imai, Akio ^a,b   Nishimura, Etsuko ^a   Papadimitriou, Stratos ^c  

^a KOBE UNIVERSITY OF MERCANTILE MARINE   (Japan)

^b WORLD MARITIME UNIVERSITY   (Sweden)

^c UNIVERSITY OF PIRAEUS   (Greece)

Author keywords

Berth allocation; Cargo handling; Container transportation; Heuristic; Mathematical programming; Terminal management

Indexed keywords

CARGO HANDLING; COST EFFECTIVENESS; GENETIC ALGORITHMS; HEURISTIC METHODS;

HUB PORTS;

PORTS AND HARBORS;

CARGO HANDLING; CONTAINER TERMINAL; MODELING; PLANNING METHOD; PORT; TRANSPORTATION PLANNING;

EID: 0037409375     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0191-2615(02)00023-1     Document Type: Article

References (28)

1. Ahuja, R.K., Orlin, J.B., Tiwri, A., 2000. A greedy genetic algorithm for the quadratic assignment problem. Computers and Operations Research 27, 917-934.
2. Angel, E., Zissimopoulos, V., 1998. On the quality of local search for the quadratic assignment problem. Discrete Applied Mathematics 82, 15-25.
3. Anstreicher, K.M., 2000. Eigenvalue bounds versus semidefinite relaxations for the quadratic assignment problem. SIAM Journal on Optimization 11, 254-265.
4. Anstreicher, K.M., Brixius, N.W., 2001. A new bound for the quadratic assignment problem based on convex quadratic programming. Mathematical Programming, Series A. 89, 341-357.
5. Arkin, E.M., Hassin, R., Sviridenko, M., 2001. Approximating the maximum quadratic assignment problem. Information Processing Letters 77, 13-16.
6. Ball, M.O., Kaku, B.K., Vakhutinsky, A., 1998. Network-based formulations of the quadratic assignment problem. European Journal of Operational Research 104, 241-249.
7. Brown, G.G., Lawphongpanich, S., Thurman, K.P., 1994. Optimizing ship berthing. Naval Research Logistics 41, 1-15.
8. Brown, G.G., Cormican, K.J., Lawphongpanich, S., 1997. Optimizing submarine berthing with a persistence incentive. Naval Research Logistics 44, 301-318.
9. Clausen, J., Perregaard, M., 1997. Solving large quadratic assignment problems in parallel. Computational Optimization and Applications 8, 111-127.
10. Hahn, P., Grant, T., Hall, N., 1998. A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method. European Journal of Operational Research 108, 629-640.
11. Imai, A., Nagaiwa, K., Chan, W.T., 1997. Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 31, 75-94.
12. Imai, A., Nishimura, E., Papadimitriou, S., 2001. The dynamic berth allocation for a container port. Transportation Research Part B 35, 401-417.
13. Ishii, S., Sato, M., 1998. Constrained neural approaches to quadratic assignment problems. Neural Networks 11, 1073-1082.
14. Karisch, S.E., Cela, E., Clausen, J., Espersen, T., 1999. A dual framework for lower bounds of the quadratic assignment problem based on linearization. Computing 63, 351-403.
15. Kim, J.U., Kim, Y.D., 1996. Simulated annealing and genetic algorithms for scheduling products with multi-level product structure. Computers and Operations Research 23, 857-868.
16. Lai, K.K., Shih, K., 1992. A study of container berth allocation. Journal of Advanced Transportation 26, 45-60.
17. Li, C.-L., Cai, X., Lee, C.-Y., 1998. Scheduling with multiple-job-on-one-processor pattern. IIE Transactions 30, 433-445.
18. Liu, C.L., Layland, J.W., 1973. Scheduling algorithms for multiprogramming in a hard-real-time environment. Journal of ACM 20, 46-61.
19. Lim, A., 1998. The berth scheduling problem. Operations Research Letters 22, 105-110.
20. Lim, M.H., Yuan, Y., Omatu, S., 2000. Efficient genetic algorithms using simple genes exchange local search policy for the quadratic assignment problem. Computational Optimization and Applications 15, 249-268.
21. Nishimura, E., Imai, A., Papadimitriou, S., 2001. Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research 131, 282-292.
22. Pardalos, P.M., Pitsoulis, L.S., Resende, M.G.C., 1997a. Algorithm 769: Fortran subroutines for approximate solution of sparse quadratic assignment problems using GRASP. ACM Transactions on Mathematical Software 23, 196-208.
23. Pardalos, P.M., Ramakrishnan, K.G., Resende, M.G.C., Li, Y., 1997b. Implementation of a variance reduction-based lower bound in a branch-and-bound algorithm for the quadratic assignment problem. SIAM Journal on Optimization 7, 280-294.
24. Resende, M.G.C., Pardalos, P.M., Li, Y., 1996. Algorithm 754: Fortran subroutines for approximate solution of densequadratic assignment problems using GRASP. ACM Transactions on Mathematical Software 22, 104-118.
25. Sergeev, S.I., 1999a. The quadratic assignment problem: I. New lower bounds in paired assignment. Automation and Remote Control 60, 1162-1178.
26. Sergeev, S.I., 1999b. The quadratic assignment problem: II. Refined Gilmore-Lawler algorithm. Automation and Remote Control 60, 1326-1331.
27. Sha, L., Rajkumar, R., Lehoczky, J.P., 1990. Priority inheritance protocol: An approach to real-time synchronization. IEEE Transactions on Computers 39, 1175-1185.
28. Xu, J., Parnas, D.L., 2000. Priority scheduling versus pre-run-time scheduling. Real-Time Systems 18, 7-23.