Berth-Crane allocation model and algorithm of container berths in the uncertain environment

0Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

According to the randomness of the vessel's arrival time and handling time, the establishment of a randomly-oriented environment container berths-crane allocation model, the optimizing goal is to minimize the average ship-waiting time. Taking into account the complexity of the model solution, this paper offers the design of an improved genetic algorithm to reduce the searching space, and according to the characteristics of the optimal solution. With testing example to verify that the model can simulate decision-making environment of berths-crane allocation problem and reflect the decision-maker's attitude toward risks and preferences. The algorithm can gain a stable and satisfactory solution within the operating time. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Liu, J. xin, Du, Y. yue, Hong, Y. fa, & Sun, L. lin. (2013). Berth-Crane allocation model and algorithm of container berths in the uncertain environment. Advances in Intelligent Systems and Computing, 212, 785–792. https://doi.org/10.1007/978-3-642-37502-6_93

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free