A Memetic Algorithm for a continuous case of the Berth allocation problem

ECTA 2011 FCTA 2011 - Proceedings of the International Conference on Evolutionary Computation Theory and Applications and International Conference on Fuzzy Computation Theory and Applications

Volumn , Issue , 2011, Pages 105-113

  Mauri, Geraldo Regis ^a   De Andrade, Larice Nogueira ^b   Lorena, Luiz Antonio Nogueira ^c  

^a FEDERAL UNIVERSITY OF ESPÍRITO SANTO   (Brazil)

^b FEDERAL UNIVERSITY OF TRIÂNGULO MINEIRO   (Brazil)

^c INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Berth allocation; Combinatorial optimization; Memetic algorithm; Simulated annealing

Indexed keywords

BERTH ALLOCATION; BERTH ALLOCATION PROBLEM; COMPUTATIONAL RESULTS; DIFFERENT EQUIPMENT; LOCAL SEARCH; MEMETIC ALGORITHMS; STAND -ALONE; TIME WINDOW CONSTRAINT;

COMBINATORIAL OPTIMIZATION; EVOLUTIONARY ALGORITHMS; SHIPS; SIMULATED ANNEALING; TRANSFER CASES (VEHICLES);

RESERVATION SYSTEMS;

EID: 84862230543     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Barros, V. H., Costa, T. S., Oliveira, A. C. M., and Lorena, L. A. N. (2011). Model and heuristic for berth allocation in tidal bulk ports with stock level constraints. Computers & Industrial Engineering, 60:606-613.
2. Buhrkal, K., Zuglian, S., Ropke, S., Larsen, J., and Lusby, R. (2011). Models for the discrete berth allocation problem: a computational comparison. Transportation Research Part E: Logistics and Transportation Review, 47:461-473.
3. Cordeau, J. F., Laporte, G., Legato, P., and Moccia, L. (2005). Models and tabu search heuristics for the berth allocation problem. Transportation Science, 39:526-538.
4. Dragovic, B., Park, N. K., and Radmilovic, Z. (2005). Simulation modelling of ship-berth link with priority service. Maritime Economics & Logistics, 7:316-335.
5. Giallombardo, G., Moccia, L., Salani, M., and Vacca, I. (2010). Modeling and solving the tactical berth allocation problem. Transportation Research Part B, 44:232-245.
6. Hansen, P., Oguz, C., and Mladenovic, N. (2008). Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research, 191:636-649.
7. Imai, A., Nishimura, E., and Papadimitriou, S. (2001). The dynamic berth allocation problem for a container port. Transportation Research Part B: Methodological, 35:401-417.
8. Imai, A., Nishimura, E., and Papadimitriou, S. (2003). Berth allocation with service priority. Transportation Research Part B: Methodological, 37:437-457.
9. Imai, A., Sun, X., Nishimura, E., and Papadimitriou, S. (2005). Berth allocation in a container port: using a continuous location space approach. Transportation Research Part B, 39:199-221.
10. Mauri, G. R., Oliveira, A. C. M., and Lorena, L. A. N. (2008a). Heurística baseada no simulated annealing aplicada ao problema de alocação de berços. GEPROS - Gestão da Produção, Operações e Sistemas, 1:113-127.
11. Mauri, G. R., Oliveira, A. C. M., and Lorena, L. A. N. (2008b). A hybrid column generation approach for the berth allocation problem. Lecture Notes in Computer Science, 4972:110-122.
12. Moscato, P. (1999). Memetic algorithms: a short introduction. In Corne, D., Dorigo, M., Glover, F., Dasgupta, D., Moscato, P., Poli, R., and Price, K. V., editors, New ideas in optimization. 219-234.
13. Moscato, P. and Norman, M. (1992). A memetic approach for the travelling salesman problem: implementation of a computational ecology for combinatorial optimization on message-passing systems. In Proceedings of the International Conference on Parallel Computing and Transportation Applications. 177-186.
14. Nishimura, E., Imai, A., and Papadimitriou, S. (2001). Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research, 131:282-292.
15. Pacheco, A. V. F., Ribeiro, G. M., and Mauri, G. R. (2010). A grasp with path-relinking for the workover rig scheduling problem. International Journal of Natural Computing Research, 1:1-14.
16. Ribeiro, G. M., Mauri, G. R., and Lorena, L. A. N. (2011). A simple and robust simulated annealing algorithm for scheduling workover rigs on onshore oil fields. Computers & Industrial Engineering, 60:519-526.
17. Steenken, D., Voss, S., and Stahlbock, R. (2004). Container terminal operation and operations research: a classification and literature review. OR Spectrum, 26:3-49.
18. UNCTAD (2009). Review of maritime transport. United Nations conference on trade and development.
19. Vis, I. F. A. and Koster, R. D. (2003). Transshipment of containers at a container terminal: an overview. European Journal of Operational Research, 147:1-16.