The Traffic Assignment problem consists in determining the routes used by sets of network users taking into account the link congestions. In deterministic modelling, Wardrop Equilibriums are computed. They can be reduced to huge nonlinear multiflow problems in the simplest cases. In stochastic modelling, Logit Assignments are used. They can be obtained, mainly, by substituting the minplus semir...

The traffic assignment problem is one of the most important problems for analyzing and optimizing the transportation network to find optimal flows. This study presented a new formulation based on a generalized Benders' decomposition approach to solve its important part, i.e. user equilibrium problems, in deterministic and stochastic cases. The new approach decomposed the problem into a master p...

Stochastic user equilibrium is an important issue in the traffic assignment problems, tradition models for the stochastic user equilibrium problem are designed as mathematical programming problems. In this article, a Physaruminspired model for the probit-based stochastic user equilibrium problem is proposed. There are two main contributions of our work. On the one hand, the origin Physarum mode...

Sustainability of transportation has become one of the most significant issues in the world due to the increasing global warming concerns. There has been a growing interest in improving the performance of the transportation systems using sustainability concepts. In this study, we use some social and environmental measures to assess the sustainability of transportation, such as accessibility of ...

Many disturbances can impact gate assignments in daily operations of an airport. Gate Assignment Problem (GAP) is the main task of an airport to ensure smooth flight-to-Gate assignment managing all disturbances. Or, flights schedule often undergoes some unplanned disruptions, such as weather conditions, gate availability or simply a delay that usually arises. A good plan to GAP should manage as...

We consider a model of a multipath routing system, where arriving customers are routed to a set of identical, parallel, single server queues, according to balancing policies operating without state information. After completion of service, customers are required to leave the system in their order of arrival, thus incurring an additional resequencing delay. We are interested in minimizing the en...

In stochastic (dynamic) traffic assignment (DTA), route choice (RC) formulations with implicit set require less memory than their explicit counterparts. To compute turn probabilities, however, a topological ordering of the nodes is needed, which negatively impacts stability convergence and consistency equilibrium. This paper formulates general framework for RC module efficient DTA (ESDTA) witho...