Global Optimisation of Signal Settings: Meta-Heuristic Algorithms for Solving Real-Scale Problems
In this chapter the Global Optimisation of Signal Settings (GOSS) problem is studied and a meta-heuristic algorithm is proposed for its solution. The GOSS problem arises when the parameters of all (or some) signalised intersections of a network are jointly optimised so as to minimise the value of an objective function (such as total travel time). This problem has been widely studied elsewhere and several algorithms have been proposed, mainly based on descent methods. These algorithms require high computing times for real-scale problems and usually lead to a local optimum since the objective function is hardly ever convex. The high computing times are due to the need to perform traffic assignment to determine the objective function at any iteration. In this chapter we propose a multi-start method based on a Feasible Descent Direction Algorithm (FDDA) for solving this problem. The algorithm is able to search for a local optimal solution and requires lower computing times at any iteration. The proposed algorithm is tested on a real-scale network, also under different demand levels, by adopting different assignment algorithms proposed in the literature. Initial results show that the proposed algorithms perform well and that computing times are compatible with planning purposes also for real-scale networks.
KeywordsSignal settings Network design Metaheuristic algorithms
Partially supported by the Italian MIUR under PRIN2009 grant no. 2009EP3S42_002.
- 2.D’Acierno, L., Gallo, M., Montella, B.: An ant colony optimisation algorithm for solving the asymmetric traffic assignment problem. Eur. J. Oper. Res. S 217, 459–469 (2012)Google Scholar
- 8.Cascetta, E., Gallo, M., Montella, B.: An asymmetric sue model for the combined assignment-control problem. In: Selected proceedings of 8th WCTR, vol. 2, pp. 189–202. Pergamon Press, The Netherlands (1999)Google Scholar
- 9.Sheffi, Y., Powell, W.B.: Optimal signal settings over transportation networks. J. Transp. Eng.-ASCE 109, 824–839 (1983)Google Scholar
- 10.Heydecker, B.G., Khoo, T.K.: The equilibrium network design problem. In: Proceedings of AIRO ‘90, Conference on Models and Methods for Decision Support, pp. 587–602. Sorrento, Italy (1990)Google Scholar
- 12.Oda, T., Otokita, T., Tsugui, T., Mashiyama, Y.: Application of simulated annealing to optimization of traffic signal timings. In: Preprints of the 8th IFAC Symposium on Transportation Systems. Chania, Greece (1997)Google Scholar
- 21.Smith, M.J., Xiang, Y., Yarrow, R.: Bilevel optimisation of signal timings and road prices on urban road networks. In: Preprints of the 8th IFAC Symposium on Transportation Systems, Chania, Greece (1997)Google Scholar
- 22.Abu-Lebdeh, G., Benekohal, R.F.: Design and evaluation of dynamic traffic management strategies for congested conditions. Transport. Res. A-Pol. 37, 109–127 (2003)Google Scholar
- 23.Saraf, R.K.: Adaptive traffic control using neural networks. PhD Thesis, Vanderbilt University, Nashville (TN), USA (1994)Google Scholar
- 31.Dorigo, M.: Optimization, learning and natural algorithms (in Italian). PhD Thesis, Department of Electronics, Polytechnic of Milan, Italy (1992)Google Scholar