IDEAS home Printed from https://ideas.repec.org/a/sae/envira/v36y2004i5p897-919.html
   My bibliography  Save this article

A Dual Neural Network for Solving Entropy-Maximising Models

Author

Listed:
  • Yee Leung

    (Department of Geography and Resource Management, Center for Environmental Policy and Resource Management, and Joint Laboratory for Geoinformation Science, The Chinese University of Hong Kong, Hong Kong)

  • Xing-Bao Gao

    (Department of Mathematics, Shaanxi Normal University, Xi'an, Shaanxi 710062, People's Republic of China)

  • Kai-Zhou Chen

    (Microelectronic Institute, Xidian University, Xi'an, Shaanxi 710071, People's Republic of China)

Abstract

The entropy-maximixing model has been applied with varying degrees of success in the analysis and planning of origin – destination types of spatial interaction. Although theoretical underpinnings and solution methods have been developed over the years, there are still outstanding problems that need to be thoroughly investigated. From the practical point of view, solving this model directly and in real time has high theoretical and pragmatic value. In this paper we propose a neural network for solving the dual problem of this model in real time. The size of the proposed network is very small and its structure is very simple, so it can be implemented in hardware. From the theoretical perspective, we solve the seldom investigated issue of convergence to the optimal solution of the entropy-maximising model. We strictly prove that the proposed dual neural network is Lyapunov stable and that each of its trajectories can converge asymptotically to an exact solution of the dual problem. The validity and transient behaviour of the proposed neural network are demonstrated by numerical examples. It is also demonstrated that the proposed network approach renders for the first time a tight integration of an entropy-maximising model and a neural network, and offers a general representation and solution to a large variety of entropy-maximising models.

Suggested Citation

  • Yee Leung & Xing-Bao Gao & Kai-Zhou Chen, 2004. "A Dual Neural Network for Solving Entropy-Maximising Models," Environment and Planning A, , vol. 36(5), pages 897-919, May.
    • Handle: RePEc:sae:envira:v:36:y:2004:i:5:p:897-919
    DOI: 10.1068/a3673a
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1068/a3673a
    Download Restriction: no
    File URL: https://libkey.io/10.1068/a3673a?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
    ---><---

    References listed on IDEAS

    as
    1. Manfred M. Fischer & Katerina Hlavácková-Schindler & Martin Reismann, 1999. "articles: A global search procedure for parameter estimation in neural spatial interaction modelling," Papers in Regional Science, Springer;Regional Science Association International, vol. 78(2), pages 119-134.
    2. Kuwahara, Masao & Sullivan, Edward C., 1987. "Estimating origin-destination matrices from roadside survey data," Transportation Research Part B: Methodological, Elsevier, vol. 21(3), pages 233-248, June.
    3. Maher, M. J., 1983. "Inferences on trip matrices from observations on link volumes: A Bayesian statistical approach," Transportation Research Part B: Methodological, Elsevier, vol. 17(6), pages 435-447, December.
    4. Cascetta, Ennio, 1984. "Estimation of trip matrices from traffic counts and survey data: A generalized least squares estimator," Transportation Research Part B: Methodological, Elsevier, vol. 18(4-5), pages 289-299.
    5. Manfred M. Fischer & Yee Leung, 1998. "A genetic-algorithms based evolutionary computational neural network for modelling spatial interaction data," ERSA conference papers ersa98p478, European Regional Science Association.
    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. Blume, Steffen O.P. & Corman, Francesco & Sansavini, Giovanni, 2022. "Bayesian origin-destination estimation in networked transit systems using nodal in- and outflow counts," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 60-94.
    2. Lo, H. P. & Zhang, N. & Lam, W. H. K., 1996. "Estimation of an origin-destination matrix with random link choice proportions: A statistical approach," Transportation Research Part B: Methodological, Elsevier, vol. 30(4), pages 309-324, August.
    3. Menon, Aditya Krishna & Cai, Chen & Wang, Weihong & Wen, Tao & Chen, Fang, 2015. "Fine-grained OD estimation with automated zoning and sparsity regularisation," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 150-172.
    4. Castillo, Enrique & Menéndez, José María & Sánchez-Cambronero, Santos, 2008. "Predicting traffic flow using Bayesian networks," Transportation Research Part B: Methodological, Elsevier, vol. 42(5), pages 482-509, June.
    5. Bielli, Maurizio & Reverberi, Pierfrancesco, 1996. "New operations research and artificial intelligence approaches to traffic engineering problems," European Journal of Operational Research, Elsevier, vol. 92(3), pages 550-572, August.
    6. Shao, Hu & Lam, William H.K. & Sumalee, Agachai & Chen, Anthony & Hazelton, Martin L., 2014. "Estimation of mean and covariance of peak hour origin–destination demands from day-to-day traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 68(C), pages 52-75.
    7. Bierlaire, M. & Toint, Ph. L., 1995. "Meuse: An origin-destination matrix estimator that exploits structure," Transportation Research Part B: Methodological, Elsevier, vol. 29(1), pages 47-60, February.
    8. Hai Yang & Qiang Meng & Michael G. H. Bell, 2001. "Simultaneous Estimation of the Origin-Destination Matrices and Travel-Cost Coefficient for Congested Networks in a Stochastic User Equilibrium," Transportation Science, INFORMS, vol. 35(2), pages 107-123, May.
    9. Sherali, Hanif D. & Narayanan, Arvind & Sivanandan, R., 2003. "Estimation of origin-destination trip-tables based on a partial set of traffic link volumes," Transportation Research Part B: Methodological, Elsevier, vol. 37(9), pages 815-836, November.
    10. Melo, Lucas Eduardo Araújo de & Isler, Cassiano Augusto, 2023. "Integrating link count data for enhanced estimation of deterrence functions: A case study of short-term bicycle network interventions," Journal of Transport Geography, Elsevier, vol. 112(C).
    11. Hazelton, Martin L. & Najim, Lara, 2024. "Using traffic assignment models to assist Bayesian inference for origin–destination matrices," Transportation Research Part B: Methodological, Elsevier, vol. 186(C).
    12. Abdullah Alshehri & Mahmoud Owais & Jayadev Gyani & Mishal H. Aljarbou & Saleh Alsulamy, 2023. "Residual Neural Networks for Origin–Destination Trip Matrix Estimation from Traffic Sensor Information," Sustainability, MDPI, vol. 15(13), pages 1-21, June.
    13. Yibo Cao & Lu Liu & Yuhan Dong, 2023. "Convolutional Long Short-Term Memory Two-Dimensional Bidirectional Graph Convolutional Network for Taxi Demand Prediction," Sustainability, MDPI, vol. 15(10), pages 1-14, May.
    14. Anselmo Ramalho Pitombeira-Neto & Carlos Felipe Grangeiro Loureiro & Luis Eduardo Carvalho, 2020. "A Dynamic Hierarchical Bayesian Model for the Estimation of day-to-day Origin-destination Flows in Transportation Networks," Networks and Spatial Economics, Springer, vol. 20(2), pages 499-527, June.
    15. Lo, H. P. & Zhang, N. & Lam, W. H. K., 1999. "Decomposition algorithm for statistical estimation of OD matrix with random link choice proportions from traffic counts," Transportation Research Part B: Methodological, Elsevier, vol. 33(5), pages 369-385, June.
    16. Doblas, Javier & Benitez, Francisco G., 2005. "An approach to estimating and updating origin-destination matrices based upon traffic counts preserving the prior structure of a survey matrix," Transportation Research Part B: Methodological, Elsevier, vol. 39(7), pages 565-591, August.
    17. 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.
    18. Juha-Matti Kuusinen & Janne Sorsa & Marja-Liisa Siikonen, 2015. "The Elevator Trip Origin-Destination Matrix Estimation Problem," Transportation Science, INFORMS, vol. 49(3), pages 559-576, August.
    19. Seungkyu Ryu, 2020. "A Bicycle Origin–Destination Matrix Estimation Based on a Two-Stage Procedure," Sustainability, MDPI, vol. 12(7), pages 1-14, April.
    20. Z. Wu & W. Lam, 2006. "Transit passenger origin-destination estimation in congested transit networks with elastic line frequencies," Annals of Operations Research, Springer, vol. 144(1), pages 363-378, April.

    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:sae:envira:v:36:y:2004:i:5:p:897-919. 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: SAGE Publications (email available below). General contact details of provider: .

    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.