A hybrid cross entropy algorithm for solving dynamic transit network design problem

11/22/2012
by   Tai-Yu Ma, et al.
0

This paper proposes a hybrid multiagent learning algorithm for solving the dynamic simulation-based bilevel network design problem. The objective is to determine the op-timal frequency of a multimodal transit network, which minimizes total users' travel cost and operation cost of transit lines. The problem is formulated as a bilevel programming problem with equilibrium constraints describing non-cooperative Nash equilibrium in a dynamic simulation-based transit assignment context. A hybrid algorithm combing the cross entropy multiagent learning algorithm and Hooke-Jeeves algorithm is proposed. Computational results are provided on the Sioux Falls network to illustrate the perform-ance of the proposed algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/27/2022

Efficient Distributed Learning in Stochastic Non-cooperative Games without Information Exchange

In this work, we study stochastic non-cooperative games, where only nois...
research
09/01/2020

Learning Nash Equilibria in Zero-Sum Stochastic Games via Entropy-Regularized Policy Approximation

We explore the use of policy approximation for reducing the computationa...
research
04/27/2021

A Dual Process Model for Optimizing Cross Entropy in Neural Networks

Minimizing cross-entropy is a widely used method for training artificial...
research
11/15/2022

Linear Convergent Distributed Nash Equilibrium Seeking with Compression

Information compression techniques are often employed to reduce communic...
research
07/17/2021

A congested schedule-based dynamic transit passenger flow estimator using stop count data

A dynamic transit flow estimation model based on congested schedule-base...
research
12/27/2019

Non-Cooperative Game Theory Based Rate Adaptation for Dynamic Video Streaming over HTTP

Dynamic Adaptive Streaming over HTTP (DASH) has demonstrated to be an em...
research
03/13/2013

An Entropy-based Learning Algorithm of Bayesian Conditional Trees

This article offers a modification of Chow and Liu's learning algorithm ...

Please sign up or login with your details

Forgot password? Click here to reset