Large-scale, network-centric control systems can benefits significantly viu the use of computer and communication technologies. Given the large size and complexity of such systems it is often not possible to compute optimal solutions. In many cases, it may be necessary that the control soluton con be computed within a short time interval, Whereas computing an optimal soluhuio migiht requtire a much longer time interval Thus, heuristic contirol strategies are often deployed in lieu of fully optimal solutions. Howesrer, in order to ensure that a heuristic technique meets the performance requirements reasonably well, it is necessary to compare it with the optimal method. In this, paper, we demonstrate this process by using a case study of scheduling vehicles traveling on a grid of intersecting roads. We develop an optimization model for this problem using linear programming and solve it using CPLEX. Moreover, we develop two heuristic algorithms for the same problem, and evaluate them against the optimal approach.
An Optimization Model for Rigorously Assessing Efficient Heuristics for Traffic Coordination at Intersections
2007-09-01
5824170 byte
Conference paper
Electronic Resource
English
Rigorously Assessing Software Reliability and Safety
British Library Online Contents | 1996
|Rigorously Assessing Software Reliability and Safety
British Library Conference Proceedings | 1996
|Efficient Traffic Coordination Strategies at Intersections Using Multiple Collision Sets
Springer Verlag | 2019
|