Show simple item record

contributor authorMilica Šelmić
contributor authorDragana Macura
contributor authorDušan Teodorović
date accessioned2017-05-08T22:01:57Z
date available2017-05-08T22:01:57Z
date copyrightJanuary 2012
date issued2012
identifier other%28asce%29te%2E1943-5436%2E0000334.pdf
identifier urihttp://yetl.yabesh.ir/yetl/handle/yetl/69295
description abstractTransport networks in many cities are generally very seriously congested. Consequently, travel time, number of stops, unexpected delays, transport costs, level of air pollution, noise, and traffic accidents are increased. In addition to daily congestion, there may be congestion and traffic jams as a consequence of reconstruction of the roads’ lanes. During the past decade, different strategies for transport demand management have been developed, with the aim to decrease existing traffic congestion. One of the available strategies is a ride matching (sharing) concept. This strategy means that several participants share only one private car when traveling from origin to destination. A model for grouping drivers into cars for ride matching, according to similarities of a place of living and working, working hours, and type of car license plate, is developed in this paper. The writers apply the ride matching concept on congested traffic during the reconstruction of the main bridge in Belgrade, Serbia, which is the Gazela Bridge. The basis of the proposed model is the
publisherAmerican Society of Civil Engineers
titleRide Matching Using K -means Method: Case Study of Gazela Bridge in Belgrade, Serbia
typeJournal Paper
journal volume138
journal issue1
journal titleJournal of Transportation Engineering, Part A: Systems
identifier doi10.1061/(ASCE)TE.1943-5436.0000291
treeJournal of Transportation Engineering, Part A: Systems:;2012:;Volume ( 138 ):;issue: 001
contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record