The cross‐entropy method for combinatorial optimization problems of seaport logistics terminal
Turkay Yildiz, Funda Yercan
Transport · 2010
doi:10.3846/transport.2010.51 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
Studies on seaport operations emphasize the fact that the numbers of resources utilized at seaport terminals add a multitude of complexities to dynamic optimization problems. In such dynamic environments, there has been a need for solving each complex operational problem to increase service efficiency and to improve seaport competitiveness. This paper states the key problems of seaport logistics and proposes an innovative cross‐entropy (CE) algorithm for solving the complex problems of combinatorial seaport logistics. Computational results exhibit that the CE algorithm is an efficient, convenient and applicable stochastic method for solving the optimization problems of seaport logistics operations. First published online: 10 Feb 2010
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.