GLORIA

GEOMAR Library Ocean Research Information Access

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Mobility and traffic research  (5)
Material
Publisher
Language
Years
FID
  • Mobility and traffic research  (5)
  • 1
    Online Resource
    Online Resource
    SAGE Publications ; 2014
    In:  Transportation Research Record: Journal of the Transportation Research Board Vol. 2468, No. 1 ( 2014-01), p. 38-46
    In: Transportation Research Record: Journal of the Transportation Research Board, SAGE Publications, Vol. 2468, No. 1 ( 2014-01), p. 38-46
    Abstract: Bicycle traffic passing through intersections exhibits a dispersion effect that can influence the movements of nearby vehicles. The primary objective of this study was to investigate the dispersion effect in left-turning bicycle traffic at signalized intersections and to evaluate the effect's influence on the capacity of left-turning vehicles. Characteristics of the dispersion effect were investigated in 20 h of video data collected in Nanjing, China. A Poisson model was estimated to evaluate the factors contributing to platoon width of left-turning bicycle traffic. The impacts of platoon width on the capacity and delay of left-turning vehicles also were evaluated. Results showed that several factors, including the number of left-turning electric bicycles (e-bicycles) and conventional bicycles arriving during the red light period and the directional factor, significantly affected the platoon width of left-turning bicycle traffic. Sensitivity analysis results indicated that the platoon was widest when the number of left-turning e-bicycles divided by the number of total left-turning bicycles arriving per cycle was about 60%. An adjustment factor that accounted for the impacts of left-turning bicycles on the capacity of left-turning vehicles was proposed. Increasing the platoon width of left-turning bicycles from three to eight reduced the left-turning vehicle capacity about 19% and increased the capacity of all left-turning traffic around 25%.
    Type of Medium: Online Resource
    ISSN: 0361-1981 , 2169-4052
    Language: English
    Publisher: SAGE Publications
    Publication Date: 2014
    detail.hit.zdb_id: 2403378-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 2
    Online Resource
    Online Resource
    SAGE Publications ; 2012
    In:  Transportation Research Record: Journal of the Transportation Research Board Vol. 2273, No. 1 ( 2012-01), p. 87-95
    In: Transportation Research Record: Journal of the Transportation Research Board, SAGE Publications, Vol. 2273, No. 1 ( 2012-01), p. 87-95
    Abstract: This paper studies the management of transshipment flows in a container terminal. Management consists of designing a visiting schedule template for feeder vessels and determining storage locations for transshipment containers. A mixed integer programming formulation is developed; it includes the objective of minimizing both the total distance traveled by transshipment flows between quayside and storage yard and the workload imbalance in time. To solve the problem, an algorithm is devised on the basis of Lagrangian relaxation to find near-optimal solutions within short computational times. Numerical experiments are conducted to assess (a) the effectiveness and efficiency of the algorithm and (b) the benefit from adjusting feeder visiting schedule.
    Type of Medium: Online Resource
    ISSN: 0361-1981 , 2169-4052
    Language: English
    Publisher: SAGE Publications
    Publication Date: 2012
    detail.hit.zdb_id: 2403378-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 3
    Online Resource
    Online Resource
    SAGE Publications ; 2009
    In:  Transportation Research Record: Journal of the Transportation Research Board Vol. 2097, No. 1 ( 2009-01), p. 70-77
    In: Transportation Research Record: Journal of the Transportation Research Board, SAGE Publications, Vol. 2097, No. 1 ( 2009-01), p. 70-77
    Abstract: This paper addresses the load scheduling problem of multiple yard crane systems in container terminals with buffer areas. In the problem several yard cranes are used to pick up a sequence of containers for a quay crane. The containers picked up ahead of schedule can be stored in buffer areas until they can be handled by the quay crane. An integer programming model is developed for the problem formulation. In the model the work schedules of different yard cranes are decided simultaneously to minimize the loading time. The yard crane scheduling problem is NP-complete by nature. Therefore a scheduling heuristic is designed to solve the proposed problem. Numerical experiments are conducted to compare the performance of the multiple yard crane systems in container terminals with and without buffer areas.
    Type of Medium: Online Resource
    ISSN: 0361-1981 , 2169-4052
    Language: English
    Publisher: SAGE Publications
    Publication Date: 2009
    detail.hit.zdb_id: 2403378-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 4
    Online Resource
    Online Resource
    SAGE Publications ; 2009
    In:  Transportation Research Record: Journal of the Transportation Research Board Vol. 2097, No. 1 ( 2009-01), p. 62-69
    In: Transportation Research Record: Journal of the Transportation Research Board, SAGE Publications, Vol. 2097, No. 1 ( 2009-01), p. 62-69
    Abstract: Load scheduling problems of the quay crane (QC) and yard crane (YC) are important issues in port container terminal operations. Because the two scheduling problems are closely related, this paper proposes a mathematical model to formulate the load scheduling problem of the QC and YC simultaneously. A genetic algorithm (GA) and a heuristic method [QC and YC scheduling heuristic (QYSH)] are designed for the problem solution. Results obtained through numerical experiments showed that the problem-oriented QYSH method significantly outperformed the GA and could be applied in real operations to conduct simultaneous quay crane and yard crane scheduling.
    Type of Medium: Online Resource
    ISSN: 0361-1981 , 2169-4052
    Language: English
    Publisher: SAGE Publications
    Publication Date: 2009
    detail.hit.zdb_id: 2403378-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
  • 5
    Online Resource
    Online Resource
    SAGE Publications ; 2011
    In:  Transportation Research Record: Journal of the Transportation Research Board Vol. 2222, No. 1 ( 2011-01), p. 63-71
    In: Transportation Research Record: Journal of the Transportation Research Board, SAGE Publications, Vol. 2222, No. 1 ( 2011-01), p. 63-71
    Abstract: The integrated problem for bay allocation and yard crane scheduling in transshipment container terminals was addressed. Unlike space allocation under the entire yard overview and slot assignment within a yard bay, the bay allocation problem focuses on a block and aims to allocate bay resource to fleets of transshipment containers in a more efficient way. The receiving operation and retrieving operation in the storage yards were considered simultaneously to achieve a more efficient operation of yard crane. The bay allocation and the yard crane scheduling were integrated as a whole process. A mixed integer programming model was developed for the problem formulation with the objective of minimizing total costs, including yard crane cost and delay cost. Considering the high complexity of the problem, a simulated annealing heuristic algorithm was developed to obtain near-optimal solutions. Numerical experiments were also conducted to test the efficiency of the proposed algorithm.
    Type of Medium: Online Resource
    ISSN: 0361-1981 , 2169-4052
    Language: English
    Publisher: SAGE Publications
    Publication Date: 2011
    detail.hit.zdb_id: 2403378-9
    Location Call Number Limitation Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...