Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
International Journal of Combinatorial Optimization Problems and Informatics
2012
|
| Subjects: | |
| Online Access: | https://www.redalyc.org/articulo.oa?id=265224452001 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Combinatorial optimization algorithms for intelligent vehicle sequencing problem at an isolated intersection Fei Yan Mahjoub Dridi Abdellah El Moudni Computación heuristic Branch and Bound vehicle arrival time Isolated intersection vehicular infrastructure integration As the development of telecommunication technology and miniaturization technology, intelligent vehicles equipped with microprocessor devices become more and more popular. This encourages researchers to propose new strategies to efficiently improve the traffic situation, especially at intersections. In this study, we present a novel vehicle sequencing algorithm based on analysis of the information received in advance from each vehicle approaching an isolated intersection. The objective is to increase the throughput of the intersection. A Branch and Bound based algorithm is presented because of the combinatorial nature of the studied problem. Structural properties are carefully analyzed to simplify the search procedure for an optimal solution. Computational experiments and simulations are also carried out to evaluate the performance of the proposed algorithms. 2012 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265224452001 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.3 Vol.3