IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v20y2012i3p777-790.html
   My bibliography  Save this article

Optimal cycle for a signalized intersection using Global Optimization and Complementarity

Author

Listed:
  • Isabel Ribeiro
  • M. Simões

Abstract

A queueing system resulting from a signalised intersection regulated by pre-timed control in an urban traffic network is considered in this paper. Subsequently, we analyse the manner in which Global Optimisation and Complementarity may be used to determine the optimal cycle length and green split allocation for an isolated signalised intersection. The model in question has been formulated as a Mathematical Program with Equilibrium (or Complementarity) Constraints (MPEC). A sequential complementarity algorithm for computing a global minimum for the MPEC is also subject to analysis in this paper. Furthermore, computational experience is included to demonstrate the efficiency of this method as an effective solution for the problem in question. Copyright Sociedad de Estadística e Investigación Operativa 2012

Suggested Citation

  • Isabel Ribeiro & M. Simões, 2012. "Optimal cycle for a signalized intersection using Global Optimization and Complementarity," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(3), pages 777-790, October.
    • Handle: RePEc:spr:topjnl:v:20:y:2012:i:3:p:777-790
    DOI: 10.1007/s11750-010-0167-3
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-010-0167-3
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-010-0167-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Joaquim Júdice & Ana Faustino & Isabel Ribeiro, 2002. "On the solution of NP-hard linear complementarity problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 10(1), pages 125-145, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hoai Le Thi & Tao Pham Dinh, 2011. "On solving Linear Complementarity Problems by DC programming and DCA," Computational Optimization and Applications, Springer, vol. 50(3), pages 507-524, December.
    2. Jing Zhou & Shu-Cherng Fang & Wenxun Xing, 2017. "Conic approximation to quadratic optimization with linear complementarity constraints," Computational Optimization and Applications, Springer, vol. 66(1), pages 97-122, January.
    3. J. J. Júdice & H. D. Sherali & I. M. Ribeiro & A. M. Faustino, 2007. "Complementarity Active-Set Algorithm for Mathematical Programming Problems with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 134(3), pages 467-481, September.
    4. Garci'a-Bertrand, Raquel & Conejo, Antonio J. & Gabriel, Steven, 2006. "Electricity market near-equilibrium under locational marginal pricing and minimum profit conditions," European Journal of Operational Research, Elsevier, vol. 174(1), pages 457-479, October.
    5. Carmo Brás & Gabriele Eichfelder & Joaquim Júdice, 2016. "Copositivity tests based on the linear complementarity problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 461-493, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:20:y:2012:i:3:p:777-790. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.