نتایج جستجو برای: marshalling yard

تعداد نتایج: 2868  

2009
Ferenc Pázmándi Richard T. Scalettar Gergely T. Zimányi

For phase transitions in disordered systems, an exact theorem provides a bound on the finite size correlation length exponent: nFS $ 2yd. It is believed that the intrinsic n satisfies the same bound. We argue that the standard averaging introduces a noise and a new diverging length scale. For n # 2yd self-averaging breaks down, disconnecting n from nFS, and the bound applies only for the latter...

Journal: :Discrete Applied Mathematics 2000
Elias Dahlhaus Peter Horák Mirka Miller Joseph F. Ryan

The problem considered in this paper arose in connection with the rearrangement of railroad cars in China. In terms of sequences the problem reads as follows: contains all the elements of S p(1) , then all elements of S p(2) , : : :, etc., and nally all elements of S p(t). The aim of this paper is to show that the decision problem: \Given numbers n; k and a partition S of f1; 2; :::; ng, is K (...

2012
Lu Zhen

This paper is concerned with yard management in transshipment hubs, where a consignment strategy is often used to reduce reshuffling and vessel turnaround time. This strategy groups unloaded containers according to their destination vessels. In this strategy, yard template determines the assignment of the spaces (subblocks) in the yard to the vessels. This paper studies how to make a robust yar...

2013
Z. X. Wang Felix T. S. Chan S. H. Chung

Since the premium prices of yard trucks and significantly daily volatility of containers serving demand, it is an uneconomic method to keep a full team of fleet to cover the entire service. Some of the transportation services are outsourced to other external companies. The strategy of outsourcing yard trucks is a decision making problem that container terminals are currently facing. Yard truck ...

2009
Jodelson A. Sabino José Eugênio Leal Thomas Stützle Mauro Birattari

This paper proposes an ant colony optimization algorithm to assist railroad yard operational planning staff in their daily tasks. The proposed algorithm tries to minimize a multi-objective function that considers both fixed and variable transportation costs involved in moving railroad cars within the railroad yard area. This is accomplished by searching the best switch engine schedule for a giv...

2013
Daofang Chang Youfang Huang Wei Yan Yu Wang

The efficiency of container handling has got great improvement with the usage of the 40ft quay crane and the twin 40 ft yard crane. Reasonable bay planning strategies is necessary to reach the high handing efficiency by the twin 40 ft yard crane. This paper studies both bay planning and row planning for yard bay allocation. The models of bay planning and row planning are created, and the discre...

Journal: :JSW 2013
Hongxing Zheng Kai Yu Chuang Tu

In order to improve the operating efficiency of mixture storage yard, the problem of multiple yard cranes scheduling (MYCS) must to be solved. The paper develops a multiple yard cranes scheduling MIP model in order to minimize the sum of trucks’ waiting cost and yard cranes’ moving cost. An important feature is that the future has to be taken into account: the interference between two yard cran...

Journal: :space ontology international journal 2015
hossein soltanzadeh

the present study focuses on the formation of various types of yards in mosques and the elements that contribute to the respective process. the significance of the issue lies in that certain scholars have associated the yard in mosques with the concept of garden, and have not taken into account the elements that contribute to the development of mosque yards of various types. the theoretical fin...

2012
Arnoud Visser

Abtract: This report gives a short overview of the potential of using the Lightweight Communication and Marshalling (LCM) framework for an autonomous mobile robot application.

2008
Derrick Hart Alex Iosevich Doowon Koh

An analog of the Falconer distance problem in vector spaces over finite fields asks for the threshold α > 0 such that |∆(E)| & q whenever |E| & q, where E ⊂ Fq , the d-dimensional vector space over a finite field with q elements (not necessarily prime). Here ∆(E) = {(x1 − y1) 2 + · · ·+ (xd − yd) 2 : x, y ∈ E}. The second listed author and Misha Rudnev ([4]) established the threshold d+1 2 , an...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید