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

A model for calculating optimal vertical alignments of interchanges

Author

Listed:
  • Lee, Yusin
  • Cheng, Juey-Fu

Abstract

In this paper we propose a model to calculate an optimal vertical alignment of an interchange with a given horizontal layout. The vertical profiles of all ramps in the interchange are solved simultaneously. The problem is formulated as a mixed integer program. A heuristic that can solve the problem very efficiently is also proposed. The model and heuristic were tested by applying the technique to a real life example, a full system interchange with 4 legs and 8 ramps. Comparison of the computational results with the real layout, which was designed by a major consulting firm, indicates that the model produces designs close to those of human experts.

Suggested Citation

  • Lee, Yusin & Cheng, Juey-Fu, 2001. "A model for calculating optimal vertical alignments of interchanges," Transportation Research Part B: Methodological, Elsevier, vol. 35(5), pages 423-445, June.
    • Handle: RePEc:eee:transb:v:35:y:2001:i:5:p:423-445
    as

    Download full text from publisher

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

    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. Atidel Ben Hadj-Alouane & James C. Bean, 1997. "A Genetic Algorithm for the Multiple-Choice Integer Program," Operations Research, INFORMS, vol. 45(1), pages 92-101, February.
    2. Goh, C. J. & Chew, E. P. & Fwa, T. F., 1988. "Discrete and continuous models for computation of optimal vertical highway alignment," Transportation Research Part B: Methodological, Elsevier, vol. 22(6), pages 399-409, December.
    3. Moreb, Ahmad A., 1996. "Linear programming model for finding optimal roadway grades that minimize earthwork cost," European Journal of Operational Research, Elsevier, vol. 93(1), pages 148-154, August.
    4. Chew, E. P. & Goh, C. J. & Fwa, T. F., 1989. "Simultaneous optimization of horizontal and vertical alignments for highways," Transportation Research Part B: Methodological, Elsevier, vol. 23(5), pages 315-329, October.
    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. Dominique Monnet & Warren Hare & Yves Lucet, 2020. "Fast feasibility check of the multi-material vertical alignment problem in road design," Computational Optimization and Applications, Springer, vol. 75(2), pages 515-536, March.
    2. Hare, Warren & Lucet, Yves & Rahman, Faisal, 2015. "A mixed-integer linear programming model to optimize the vertical alignment considering blocks and side-slopes in road construction," European Journal of Operational Research, Elsevier, vol. 241(3), pages 631-641.
    3. Kim, Eungcheol & Jha, Manoj K. & Son, Bongsoo, 2005. "Improving the computational efficiency of highway alignment optimization models through a stepwise genetic algorithms approach," Transportation Research Part B: Methodological, Elsevier, vol. 39(4), pages 339-360, May.
    4. Jong, Jyh-Cherng & Schonfeld, Paul, 2003. "An evolutionary model for simultaneously optimizing three-dimensional highway alignments," Transportation Research Part B: Methodological, Elsevier, vol. 37(2), pages 107-128, February.
    5. Zhong, Tao & Young, Rhonda, 2010. "Multiple Choice Knapsack Problem: Example of planning choice in transportation," Evaluation and Program Planning, Elsevier, vol. 33(2), pages 128-137, May.
    6. Zong-Zhi Lin & James C. Bean & Chelsea C. White, 2004. "A Hybrid Genetic/Optimization Algorithm for Finite-Horizon, Partially Observed Markov Decision Processes," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 27-38, February.
    7. Martin Schlüter & Matthias Gerdts, 2010. "The oracle penalty method," Journal of Global Optimization, Springer, vol. 47(2), pages 293-325, June.
    8. Miettinen, Kaisa & Makela, Marko M., 2006. "Synchronous approach in interactive multiobjective optimization," European Journal of Operational Research, Elsevier, vol. 170(3), pages 909-922, May.
    9. Alice E. Smith, 2023. "Note from the Editor," INFORMS Journal on Computing, INFORMS, vol. 35(4), pages 711-712, July.
    10. Jeffrey W. Ohlmann & Barrett W. Thomas, 2007. "A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 19(1), pages 80-90, February.
    11. Mukund Pratap Singh & Pitam Singh & Priyamvada Singh, 2019. "Fuzzy AHP-based multi-criteria decision-making analysis for route alignment planning using geographic information system (GIS)," Journal of Geographical Systems, Springer, vol. 21(3), pages 395-432, September.
    12. Jacob R. Fooks & Kent D. Messer & Maik Kecinski, 2018. "A Cautionary Note on the Use of Benefit Metrics for Cost-Effective Conservation," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 71(4), pages 985-999, December.
    13. Alexouda, Georgia & Paparrizos, Konstantinos, 2001. "A genetic algorithm approach to the product line design problem using the seller's return criterion: An extensive comparative computational study," European Journal of Operational Research, Elsevier, vol. 134(1), pages 165-178, October.
    14. Zhihua Chen & Xuchen Xu & Hongbo Liu, 2023. "Improved Dual-Population Genetic Algorithm: A Straightforward Optimizer Applied to Engineering Optimization," Sustainability, MDPI, vol. 15(20), pages 1-32, October.
    15. Hare, Warren L. & Koch, Valentin R. & Lucet, Yves, 2011. "Models and algorithms to improve earthwork operations in road design using mixed integer linear programming," European Journal of Operational Research, Elsevier, vol. 215(2), pages 470-480, December.
    16. Lovell, David J. & Jong, Jyh-Cherng & Chang, Peter C., 2001. "Clear zone requirements based on horizontal sight distance considerations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(5), pages 391-411, June.
    17. Dominique Monnet & Warren Hare & Yves Lucet, 2022. "A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design," Computational Optimization and Applications, Springer, vol. 81(3), pages 741-767, April.
    18. Zhihua Chen & Xuchen Xu & Hongbo Liu, 2023. "The Successive Approximation Genetic Algorithm (SAGA) for Optimization Problems with Single Constraint," Mathematics, MDPI, vol. 11(8), pages 1-26, April.
    19. Jeffrey W. Ohlmann & James C. Bean & Shane G. Henderson, 2004. "Convergence in Probability of Compressed Annealing," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 837-860, November.
    20. Hüseyin Güden & Haldun Süral, 2017. "A polynomial algorithm for the earthwork allocation problem with borrow and waste site selection," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(9), pages 1085-1093, September.

    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:35:y:2001:i:5:p:423-445. 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.