IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v40y2006i10p857-871.html
   My bibliography  Save this article

A discrete optimization approach for locating Automatic Vehicle Identification readers for the provision of roadway travel times

Author

Listed:
  • Sherali, Hanif D.
  • Desai, Jitamitra
  • Rakha, Hesham

Abstract

This paper develops an algorithm for optimally locating Automatic Vehicle Identification tag readers by maximizing the benefit that would accrue from measuring travel times on a transportation network. The problem is formulated as a quadratic 0-1 optimization problem where the objective function parameters represent benefit factors that capture the relevance of measuring travel times as reflected by the demand and travel time variability along specified trips. An optimization approach based on the Reformulation-Linearization Technique coupled with semidefinite programming concepts is designed to solve the formulated reader location problem. To illustrate the proposed methodology, we consider a transportation network that is comprised of freeway segments that might include merge, diverge, weaving, and bottleneck sections. In order to derive benefit factors for the various origin-destination pairs on this network, we employ a simulation package (INTEGRATION) in combination with a composite function, which estimates the travel time variability along a trip that is comprised of links that include any of the four identified sections. The simulation results are actually recorded as generic look-up tables that can be used for any such section for the purpose of computing the associated benefit factor coefficients. Computational results are presented using data pertaining to a freeway section in San Antonio, Texas, as well as synthetic test cases, to demonstrate the effectiveness of the proposed approach, and to study the sensitivity of the quality of the solution to variations in the number of available readers.

Suggested Citation

  • Sherali, Hanif D. & Desai, Jitamitra & Rakha, Hesham, 2006. "A discrete optimization approach for locating Automatic Vehicle Identification readers for the provision of roadway travel times," Transportation Research Part B: Methodological, Elsevier, vol. 40(10), pages 857-871, December.
    • Handle: RePEc:eee:transb:v:40:y:2006:i:10:p:857-871
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191-2615(06)00003-8
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Warren P. Adams & Hanif D. Sherali, 1986. "A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems," Management Science, INFORMS, vol. 32(10), pages 1274-1290, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Xing, Tao & Zhou, Xuesong & Taylor, Jeffrey, 2013. "Designing heterogeneous sensor networks for estimating and predicting path travel time dynamics: An information-theoretic modeling approach," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 66-90.
    2. Hyoshin (John) Park & Ali Haghani & Song Gao & Michael A. Knodler & Siby Samuel, 2018. "Anticipatory Dynamic Traffic Sensor Location Problems with Connected Vehicle Technologies," Service Science, INFORMS, vol. 52(6), pages 1299-1326, December.
    3. Saif Eddin Jabari & Laura Wynter, 2016. "Sensor placement with time-to-detection guarantees," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(4), pages 415-433, December.
    4. Li, Xiaopeng & Ouyang, Yanfeng, 2011. "Reliable sensor deployment for network traffic surveillance," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 218-231, January.
    5. Xuesong Zhou & George F. List, 2010. "An Information-Theoretic Sensor Location Model for Traffic Origin-Destination Demand Estimation Applications," Transportation Science, INFORMS, vol. 44(2), pages 254-273, May.
    6. Hadavi, Majid & Shafahi, Yousef, 2016. "Vehicle identification sensor models for origin–destination estimation," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 82-106.
    7. Danczyk, Adam & Liu, Henry X., 2011. "A mixed-integer linear program for optimizing sensor locations along freeway corridors," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 208-217, January.
    8. Wenhao Li & Chengkun Liu & Tao Wang & Yanjie Ji, 2024. "An innovative supervised learning structure for trajectory reconstruction of sparse LPR data," Transportation, Springer, vol. 51(1), pages 73-97, February.
    9. Xiaopeng Li & Yanfeng Ouyang, 2012. "Reliable Traffic Sensor Deployment Under Probabilistic Disruptions and Generalized Surveillance Effectiveness Measures," Operations Research, INFORMS, vol. 60(5), pages 1183-1198, October.

    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. Alain Billionnet & Sourour Elloumi & Amélie Lambert, 2013. "An efficient compact quadratic convex reformulation for general integer quadratic programs," Computational Optimization and Applications, Springer, vol. 54(1), pages 141-162, January.
    2. Hanif D. Sherali & Warren P. Adams & Patrick J. Driscoll, 1998. "Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems," Operations Research, INFORMS, vol. 46(3), pages 396-405, June.
    3. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    4. Fabio Furini & Emiliano Traversi, 2019. "Theoretical and computational study of several linearisation techniques for binary quadratic problems," Annals of Operations Research, Springer, vol. 279(1), pages 387-411, August.
    5. Caprara, Alberto, 2008. "Constrained 0-1 quadratic programming: Basic approaches and extensions," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1494-1503, June.
    6. de Meijer, Frank, 2023. "Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization," Other publications TiSEM b1f1088c-95fe-4b8a-9e15-c, Tilburg University, School of Economics and Management.
    7. Sven Mallach, 2021. "Inductive linearization for binary quadratic programs with linear constraints," 4OR, Springer, vol. 19(4), pages 549-570, December.
    8. Guanglei Wang & Hassan Hijazi, 2018. "Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches," Computational Optimization and Applications, Springer, vol. 71(2), pages 553-608, November.
    9. Bruglieri, Maurizio & Liberti, Leo, 2008. "Optimal running and planning of a biomass-based energy production process," Energy Policy, Elsevier, vol. 36(7), pages 2430-2438, July.
    10. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
    11. Eva K. Lee, 2004. "Generating Cutting Planes for Mixed Integer Programming Problems in a Parallel Computing Environment," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 3-26, February.
    12. Hanif Sherali, 2007. "RLT: A unified approach for discrete and continuous nonconvex optimization," Annals of Operations Research, Springer, vol. 149(1), pages 185-193, February.
    13. Pessoa, Artur Alves & Hahn, Peter M. & Guignard, Monique & Zhu, Yi-Rong, 2010. "Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique," European Journal of Operational Research, Elsevier, vol. 206(1), pages 54-63, October.
    14. Tao Pham Dinh & Nam Nguyen Canh & Hoai Le Thi, 2010. "An efficient combined DCA and B&B using DC/SDP relaxation for globally solving binary quadratic programs," Journal of Global Optimization, Springer, vol. 48(4), pages 595-632, December.
    15. Bradley Sturt, 2021. "A nonparametric algorithm for optimal stopping based on robust optimization," Papers 2103.03300, arXiv.org, revised Mar 2023.
    16. Anjos, Miguel F. & Vieira, Manuel V.C., 2017. "Mathematical optimization approaches for facility layout problems: The state-of-the-art and future research directions," European Journal of Operational Research, Elsevier, vol. 261(1), pages 1-16.
    17. Billionnet, Alain & Calmels, Frederic, 1996. "Linear programming for the 0-1 quadratic knapsack problem," European Journal of Operational Research, Elsevier, vol. 92(2), pages 310-325, July.
    18. Hussein El Hajj & Douglas R. Bish & Ebru K. Bish, 2021. "Equity in genetic newborn screening," Naval Research Logistics (NRL), John Wiley & Sons, vol. 68(1), pages 44-64, February.
    19. Stefan Helber & Daniel Böhme & Farid Oucherif & Svenja Lagershausen & Steffen Kasper, 2016. "A hierarchical facility layout planning approach for large and complex hospitals," Flexible Services and Manufacturing Journal, Springer, vol. 28(1), pages 5-29, June.
    20. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.

    More about this item

    Statistics

    Access and download statistics

    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:eee:transb:v:40:y:2006:i:10:p:857-871. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.