Study on Bay-filling Problem in Stowage Planning of Export Containers

2013 ◽  
Vol 12 (21) ◽  
pp. 5967-5974 ◽  
Author(s):  
Zhao Ning ◽  
Shen Yifan ◽  
Chai Jiaqi ◽  
Mi Chao ◽  
Mi Weijian
2021 ◽  
Vol 1821 (1) ◽  
pp. 012040
Author(s):  
N L A Pramesti ◽  
I Mukhlash ◽  
S Nugroho

2015 ◽  
Vol 55 (2) ◽  
pp. 249-262
Author(s):  
Dominic Dotterrer
Keyword(s):  

1989 ◽  
Vol 26 (01) ◽  
pp. 47-61
Author(s):  
D. J. Saginaw ◽  
A. N. Perakis

The results of a project intending to design and develop a microcomputer-based, interactive graphics decision support system for containership stowage planning are presented. The objective was to create a working prototype that would automate data management tasks and provide computational capabilities to allow the stowage planner to continuously assess vessel trim, stability, and strength characteristics. The paper provides a complete description of the decision support system developed to meet this objective, including a definition of the containership stowage problem, and details on the design and development of the Automated Stowage Plan Generation Routine (ASPGR). The paper concludes with a discussion of issues relevant to the implementation of the system in the maritime industry.


Author(s):  
Anibal Tavares de Azevedo ◽  
Edilson Fernandes de Arruda ◽  
Luiz Leduino de Salles Neto ◽  
Antonio Augusto Chaves ◽  
Antonio Carlos Moretti
Keyword(s):  

1968 ◽  
Vol 5 (02) ◽  
pp. 427-435 ◽  
Author(s):  
John P. Mullooly

Consider an interval of the real line (0, x), x > 0; and place in it a random subinterval S(x) defined by the random variables Xx and Yx , the position of the center of S(x) and the length of S(x). The set (0, x)– S(x) consists of two intervals of length δ and η. Let a > 0 be a fixed constant. If δ ≦ a, then a random interval S(δ) defined by Xδ, Yδ is placed in the interval of length δ. If δ < a, the placement of the second interval is not made. The same is done for the interval of length η. Continue to place non-intersecting random subintervals in (0, x), and require that the lengths of all the random subintervals be ≦ a. The process terminates after a finite number of steps when all the segments of (0, x) uncovered by random subintervals are of length < a. At this stage, we say that (0, x) is saturated. Define N(a, x) as the number of random subintervals that have been placed when the process terminates. We are interested in the asymptotic behavior of the moments of N(a, x), for large x.


Sign in / Sign up

Export Citation Format

Share Document