Table of Contents
Conference Papers in Mathematics
Volume 2013 (2013), Article ID 216898, 6 pages
http://dx.doi.org/10.1155/2013/216898
Conference Paper

Solving a Signalized Traffic Intersection Problem with NLP Solvers

1CIICESI, School of Technology and Management of Felgueiras, Polytechnic of Porto, 4610-156 Felgueiras, Portugal
2Centre of Mathematics, CM-UTAD, University of Trás-os-Montes e Alto Douro, 5001-801 Vila Real, Portugal
3R&D Algoritmi Centre, Department of Production and Systems, University of Minho, Campus of Gualtar, 4710-057 Braga, Portugal

Received 15 June 2013; Accepted 10 July 2013

Academic Editors: G. S. F. Frederico, N. Martins, D. F. M. Torres, and A. J. Zaslavski

This Conference Paper is based on a presentation given by M. Teresa T. Monteiro at “The Cape Verde International Days on Mathematics 2013” held from 22 April 2013 to 25 April 2013 in Praia, Cape Verde.

Copyright © 2013 Teófilo Miguel M. Melo et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Mathematical Programs with Complementarity Constraints (MPCC) finds many applications in areas such as engineering design, economic equilibrium, and mathematical theory itself. In this work, we consider a queuing system model resulting from a single signalized traffic intersection regulated by pretimed control in an urban traffic network. The model is formulated as an MPCC problem and may be used to ascertain the optimal cycle and the green split allocation. This MPCC problem is also formulated as its NLP equivalent reformulation. The goal of this work is to solve the problem, using both MPCC and NLP formulations, minimizing two objective functions: the average queue length over all queues and the average waiting time over the worst queue. The problem was codified in AMPL and solved using some optimization software packages.