Lane assignment on automated highway systems

Ramaswamy, D.; Medanić, J.; Perkins, W.R.; Benekohal, Rahim F.

doi:10.1109/25.618201

Cited by 21 publications

(14 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The partitioned strategies are also illustrated in Ramaswamy et al (1997) and have been shown to be an efficient way of reducing the number of necessary maneuvers. It is observed that partitioned strategies can be simply characterized by the two so-called partitions, denoted by p 1 and p 2 , that divide the origin/destination matrix into three regions characterized by lane usage: p 1 separates vehicles using lane L 1 from vehicles using lane L 2 while p 2 separates vehicles using lane L 2 from those using lane L 3 .…”

Section: Assumptionsmentioning

confidence: 97%

“…Several classes of lane assignment strategies were defined in Ramaswamy et al (1997): unrestricted policy, general lane assignment policy, constant lane policy, destination monotone policy, origin monotone policy, and monotone policies.…”

Section: Assumptionsmentioning

confidence: 99%

“…Tsao (1996) identified a general class of equations/inequalities to represent the impact of lane changes on AHS longitudinal flow and developed mathematical models for system-optimal AHS dynamic traffic assignment in a deterministic setting. Ramaswamy et al (1997) defined the lane assignment problem using an itinerary matrix, with the objective of reducing unnecessary crossings on the highway because they thought that maneuvers lead to path intercepts and are the main reason for delays and capacity reduction. As will be shown in Section 2.1, Ramaswamy obtained a similar result to Hall (1995) which assigned the inner lane to the longer trip.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Lane assignment problem using a genetic algorithm in the Automated Highway Systems

Kim

Cho

Medanić

2008

Int.J Automot. Technol.

View full text Add to dashboard Cite

This paper deals with the lane assignment problem in the Automated Highway Systems (AHS). The purpose of lane assignment strategies is to increase throughput on multi-lane highways with many entry and exit points, based on the itineraries of vehicles using the highway (point of entry, time of entry and exit point) and the effects of maneuvers. Using partitioned lane assignment strategies, the lane assignment problem is formulated as an optimization problem to find the proper positions of partitions. Then the optimal problem is solved using a Genetic Algorithm (GA). The proposed algorithm has been validated by comparing its solution with that of an all-cases algorithm for a simple case. Moreover, a traffic simulator with a realistic car-following model as well as lane change logic has been developed. The simulation results show the efficiency of the proposed genetic algorithm, compared with random assignment algorithms.

show abstract

Section: Assumptionsmentioning

confidence: 97%

Section: Assumptionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Lane assignment problem using a genetic algorithm in the Automated Highway Systems

Kim

Cho

Medanić

2008

Int.J Automot. Technol.

View full text Add to dashboard Cite

show abstract

“…A large number of automated lane change maneuver systems have been proposed to assist human drivers [21][22][23][24][25][26]. In particular, a neural network [24] and bayesian data fusion [25] [41]. Lane assignments may be made for each vehicle or a group of vehicle and usually depend on the distance a vehicle has to travel before exiting the highway.…”

Section: Related Workmentioning

confidence: 99%

Minimizing the Disruption of Traffic Flow of Automated Vehicles During Lane Changes

Desiraju

Chantem

Heaslip

2015

IEEE Trans. Intell. Transport. Syst.

View full text Add to dashboard Cite

In intelligent transportation systems, most of the research work has focused on lane change assistant systems. No existing work considers minimizing the interruption of traffic flow by maximizing the number of lane changes while eliminating the collisions. In this thesis, we develop qualitative and quantitative approaches for minimizing the interruption of traffic flow for three lane scenarios and show that we can extend our approach to any random number of lanes. The algorithm we propose in this thesis is able to achieve the maximum number of lane changes provided that only one vehicle per group (novel concept which is described in this thesis) is allowed to change lanes at a time. Simulation results show that our approach provides much better performance when compared with different lane change algorithms without incurring large overhead, and is hence suitable for online use.

show abstract

“…Meanwhile, the lane assignment was previously proposed in the highway systems and traffic assignment context (Fisk, 1990;Hall and Lotspeich, 1996;Hall and Caliskan, 1999;Ramaswamy, et al, 1997). The signal timing together with lane assignment was later investigated by other researches (Lam et al, 1997;Wong and Wong, 2003;Wong and Heydecker, 2011).…”

Section: Introductionmentioning

confidence: 99%

The optimization of lane assignment and signal timing at the tandem intersection with pre‐signal

Zhou

Zhuang

2013

J of Advced Transportation

View full text Add to dashboard Cite

SUMMARYThis paper presents an integrated model for optimizing lane assignment and signal timing at tandem intersection, which is introduced recently. The pre-signal is utilized in the tandem intersection to reorganize the traffic flow; hence, the vehicles, regardless of whether left-turns or through vehicles, can be discharged in all the lanes. However, the previous work does not consider the extra traffic disruption and the associated delay caused by the additional pre-signal. In the paper, the extra delay aroused by the coordination is incorporated in a lane assignment and signal timing optimization model, and the problem is converted into a mixed-integer non-linear programming. A feasible directions method is hence introduced to solve the mixed-integer non-linear programming. The result of the optimization shows that the performance of the tandem intersection is improved and the average delay is minimized. The comparison between the tandem and the conventional configuration is presented, and the results verify that the former shows better performance than the latter. In addition, the optimal sequence corresponding to the turning proportion and the optimal lane assignment at the upstream approach of the pre-signal are presented. Furthermore, if the number of lanes is equal in all arms, the paper proves that the average delay will be reduced if lane assignment is proportional to the turning proportion and the vehicles with low proportion are discharged in advance.

show abstract

Lane assignment on automated highway systems

Cited by 21 publications

References 6 publications

Lane assignment problem using a genetic algorithm in the Automated Highway Systems

Lane assignment problem using a genetic algorithm in the Automated Highway Systems

Minimizing the Disruption of Traffic Flow of Automated Vehicles During Lane Changes

The optimization of lane assignment and signal timing at the tandem intersection with pre‐signal

Contact Info

Product

Resources

About