IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/2159865.html
   My bibliography  Save this article

Simultaneous Generation of Optimum Pavement Clusters and Associated Performance Models

Author

Listed:
  • Mukesh Khadka
  • Alexander Paz
  • Cristian Arteaga
  • David K. Hale

Abstract

With regard to developing pavement performance models (PPMs), the existing state-of-the-art proposes Clusterwise Linear Regression (CLR) to determine the pavement clusters and associated PPMs simultaneously. However, the approach does not determine optimal clustering to minimize error; that is, the number of clusters and explanatory variables are prespecified to determine the corresponding coefficients of the PPMs. In addition, existing formulations do no address issues associated with overfitting as there is no limit to include parameters in the model. In order to address this limitation, this paper proposes a mathematical program within the CLR approach to determine simultaneously an optimal number of clusters, assignment of segments into clusters, and regression coefficients for all prespecified explanatory variables required to minimize the estimation error. The Bayesian Information Criteria is proposed to limit the number of optimal clusters. A simulated annealing coupled with ordinary least squares was used to solve the mathematical program.

Suggested Citation

  • Mukesh Khadka & Alexander Paz & Cristian Arteaga & David K. Hale, 2018. "Simultaneous Generation of Optimum Pavement Clusters and Associated Performance Models," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-17, December.
  • Handle: RePEc:hin:jnlmpe:2159865
    DOI: 10.1155/2018/2159865
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2018/2159865.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2018/2159865.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2018/2159865?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
    ---><---

    Citations

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


    Cited by:

    1. Beeramoole, Prithvi Bhat & Arteaga, Cristian & Pinz, Alban & Haque, Md Mazharul & Paz, Alexander, 2023. "Extensive hypothesis testing for estimation of mixed-Logit models," Journal of choice modelling, Elsevier, vol. 47(C).

    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:hin:jnlmpe:2159865. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.