IDEAS home Printed from https://ideas.repec.org/p/hal/wpaper/halshs-00310903.html
   My bibliography  Save this paper

a cross-entropy based multiagent approach for multiclass activity chain modeling and simulation

Author

Listed:
  • Tai-Yu Ma

    (LET - Laboratoire d'économie des transports - UL2 - Université Lumière - Lyon 2 - ENTPE - École Nationale des Travaux Publics de l'État - CNRS - Centre National de la Recherche Scientifique)

  • Jean-Patrick Lebacque

    (IFSTTAR/GRETTIA - Génie des Réseaux de Transport Terrestres et Informatique Avancée - IFSTTAR - Institut Français des Sciences et Technologies des Transports, de l'Aménagement et des Réseaux)

Abstract

This paper attempts to model complex destination-chain, departure time and route choices based on activity plan implementation and proposes an arc-based cross entropy method for solving approximately the dynamic user equilibrium in multiagent-based multiclass network context. A multiagent-based dynamic activity chain model is developed, combining travelers' day-to-day learning process in the presence of both traffic flow and activity supply dynamics. The learning process towards user equilibrium in multiagent systems is based on the framework of Bellman's principle of optimality, and iteratively solved by the cross entropy method. A numerical example is implemented to illustrate the performance of the proposed method on a multiclass queuing network.

Suggested Citation

  • Tai-Yu Ma & Jean-Patrick Lebacque, 2011. "a cross-entropy based multiagent approach for multiclass activity chain modeling and simulation," Working Papers halshs-00310903, HAL.
    • Handle: RePEc:hal:wpaper:halshs-00310903
    Note: View the original document on HAL open archive server: https://shs.hal.science/halshs-00310903v3
    as

    Download full text from publisher

    File URL: https://shs.hal.science/halshs-00310903v3/document
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    dynamic traffic assignment; cross entropy method; activity chain; multiagent; Bellman equation;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:hal:wpaper:halshs-00310903. 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: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    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.