- -

A genetic algorithm for robust berth allocation and quay crane assignment

RiuNet: Repositorio Institucional de la Universidad Politécnica de Valencia

Compartir/Enviar a

Citas

Estadísticas

  • Estadisticas de Uso

A genetic algorithm for robust berth allocation and quay crane assignment

Mostrar el registro completo del ítem

Rodríguez Molins, M.; Ingolotti Hetter, LP.; Barber Sanchís, F.; Salido Gregorio, MA.; Sierra, MR.; Puente, J. (2014). A genetic algorithm for robust berth allocation and quay crane assignment. Progress in Artificial Intelligence. 2(4):177-192. https://doi.org/10.1007/s13748-014-0056-3

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/52303

Ficheros en el ítem

Thumbnail
Nombre: progressAI.pdf
Tamaño: 552.4Kb
Formato: PDF
Descripción: Versión del Autor.
Abrir/Preview
[Cerrado]
Nombre: Rodríguez;Ingolot ...
Tamaño: 1.151Mb
Formato: PDF
Descripción: Versión editorial
Solicitar una copia al autor

Metadatos del ítem

Título: A genetic algorithm for robust berth allocation and quay crane assignment
Autor: Rodríguez Molins, Mario Ingolotti Hetter, Laura Paola Barber Sanchís, Federico Salido Gregorio, Miguel Angel Sierra, María R. Puente, Jorge
Entidad UPV: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Fecha difusión:
Resumen:
[EN] Scheduling problems usually obtain the optimal solutions assuming that the environment is deterministic. However, actually the environment is dynamic and uncertain. Thus, the initial data could change and the initial ...[+]
Palabras clave: Scheduling , Planning , Robustness , Genetic algorithms , Metaheuristics , Multi-objective , Berthing allocation , Quay crane assignment
Derechos de uso: Reserva de todos los derechos
Fuente:
Progress in Artificial Intelligence. (issn: 2192-6352 ) (eissn: 2192-6360 )
DOI: 10.1007/s13748-014-0056-3
Versión del editor: http://link.springer.com/article/10.1007%2Fs13748-014-0056-3
Código del Proyecto:
info:eu-repo/grantAgreement/EC/FP7/294931/EU/Customised Advisory Services for Energy-efficient Manufacturing Systems/
info:eu-repo/grantAgreement/MICINN//TIN2010-20976-C02-01/ES/TECNICAS PARA LA EVALUACION Y OBTENCION DE SOLUCIONES ESTABLES Y ROBUSTAS EN PROBLEMAS DE OPTIMIZACION Y SATISFACCION DE RESTRICCIONES/
info:eu-repo/grantAgreement/MICINN//TIN2010-20976-C02-02/ES/METAHEURISTICAS PARA LA ESTABILIDAD Y ROBUSTEZ EN SCHEDULING CON INCERTIDUMBRE/
info:eu-repo/grantAgreement/MECD//AP2010-4405/ES/AP2010-4405/
Descripción: The final publication is available at Springer via http://dx.doi.org/10.1007/s13748-014-0056-3
Agradecimientos:
This research was supported by the Spanish Government under research projects TIN2010-20976-C02-01 and TIN2010-20976-C02-02 (Min. de Ciencia e Innovación, Spain), the project PIRSES-GA-2011-294931 (FP7-PEOPLE-2011-IRSES) ...[+]
Tipo: Artículo

References

Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202, 615–627 (2010)

Czyzak, P., Jaszkiewicz, A.: Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization. J. Multi-criteria Decis. Anal. 7, 34–47 (1998)

Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. Evol. Comput. IEEE Trans. 6(2), 182–197 (2002) [+]
Bierwirth, C., Meisel, F.: A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 202, 615–627 (2010)

Czyzak, P., Jaszkiewicz, A.: Pareto simulated annealing-a metaheuristic technique for multiple-objective combinatorial optimization. J. Multi-criteria Decis. Anal. 7, 34–47 (1998)

Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: Nsga-ii. Evol. Comput. IEEE Trans. 6(2), 182–197 (2002)

Derrac, J., García, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as mehodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3–18 (2011)

Du, Y., Xu, Y., Chen, Q.: A feedback procedure for robust berth allocation with stochastic vessel delays. In: Intelligent control and automation (WCICA), 2010 8th World Congress on, pp. 2210–2215. IEEE (2010)

Giallombardo, G., Moccia, L., Salani, M., Vacca, I.: Modeling and solving the tactical berth allocation problem. Transp. Res. Part B: Methodol. 44(2), 232–245 (2010)

Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, London (1989)

Gonzalez-Rodriguez, I., Vela, C., Puente, J.: A memetic approach to fuzzy job shop based on expectation model. In: Proceedings of IEEE International Conference on fuzzy systems, FUZZ-IEEE2007, pp. 692–697. IEEE (2007)

González-Rodríguez, I., Vela, C., Puente, J.: A genetic solution based on lexicographical goal programming for a multiobjective job shop with uncertainty. J. Intell. Manuf. 21(1), 65–73 (2010)

Han, X.l., Lu, Z.q., Xi, L.f.: A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. Eur. J. Oper. Res. 207(3), 1327–1340 (2010)

Hendriks, M., Laumanns, M., Lefeber, E., Udding, J.T.: Robust cyclic berth planning of container vessels. OR Spectr. 32(3), 501–517 (2010)

Imai, A., Chen, H., Nishimura, E., Papadimitriou, S.: The simultaneous berth and quay crane allocation problem. Transp. Res. Part E: Logist. Transp. Rev. 44(5), 900–920 (2008)

Kim, K., Moon, K.: Berth scheduling by simulated annealing. Transp. Res. Part B: Methodol. 37(6), 541–560 (2003)

Kim, M., Hiroyasu, T., Miki, M., Watanabe, S.: Spea2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2. In: Parallel problem solving from nature-PPSN VIII, pp. 742–751. Springer, New York (2004)

Liang, C., Guo, J., Yang, Y.: Multi-objective hybrid genetic algorithm for quay crane dynamic assignment in berth allocation planning. J. Intell. Manuf. 22, 471–479 (2011)

Lim, A.: The berth planning problem. Oper. Res. Lett. 22(2–3), 105–110 (1998)

Mezura-Montes, E., Coello Coello, C.A.: Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol. Comput. 1(4), 173–194 (2011)

Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs, third, revised and extended. Springer, New York (1996)

Park, Y., Kim, K.: A scheduling method for berth and quay cranes. OR Spectr. 25(1), 1–23 (2003)

Salido, M.A., Rodriguez-Molins, M., Barber, F.: Integrated intelligent techniques for remarshaling and berthing in maritime terminals. Adv. Eng. Inf. 25(3), 435–451 (2011)

Sheskin, D.: Handbook of Parametric and Nonparametric Statistical Procedures. Chapman & Hall/CRC, London (2004)

Stahlbock, R., Voß, S.: Operations research at container terminals: a literature update. OR Spectr. 30(1), 1–52 (2008)

Xu, Y., Chen, Q., Quan, X.: Robust berth scheduling with uncertain vessel delay and handling time. Ann. Oper. Res. 192(1), 123–140 (2012)

Zhang, C., Zheng, L., Zhang, Z., Shi, L., Armstrong, A.: The allocation of berths and quay cranes by using a sub-gradient optimization technique. Computers Ind. Eng. 58(1), 40–50 (2010)

Zhen, L., Chang, D.F.: A bi-objective model for robust berth allocation scheduling. Computers Ind. Eng. 63(1), 262–273 (2012)

[-]

recommendations

 

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro completo del ítem