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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    An Optimization Model for Rigorously Assessing Efficient Heuristics for Traffic Coordination at Intersections


    Contributors:


    Publication date :

    2007-09-01


    Size :

    5824170 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Rigorously Assessing Software Reliability and Safety

    Strigini, L. / Fenton, N. | British Library Online Contents | 1996


    Rigorously Assessing Software Reliability and Safety

    Strigini, L. / Fenton, N. / European Space Agency | British Library Conference Proceedings | 1996


    Efficient Traffic Coordination Strategies at Intersections Using Multiple Collision Sets

    Mo, Yangan / Wang, Mengqi / Zhang, Tingting et al. | Springer Verlag | 2019