Traffic assignment model with fuzzy level of travel demand: An efficient algorithm based on quasi-Logit formulas

QoS-based cooperative algorithm for integral multi-commodity flow problem

“…Path enumeration is a general name for these generating methods including multi-objective shortest path, iterative penalty methods, gateway shortest paths, K-shortest path, K-similar path and dissimilar paths, etc., see e.g. [11,12].…”

“…In this section, we wish to solve (12) subjected to (13) to minimize the total transmission delay and congestion simultaneously. We refer to this problem with minimum delay and congestion multi-commodity flow problem or shortly MDCMF problem.…”

“…where f is the fitness function in terms of objective functions (14) or (12) and penalty values with respect to infeasible chromosomes. P is also the current population and threshold value > 0 is given by decision maker.…”

“…when congestion effects are taken into account. Instead of column generation, some path generation techniques can be considered as candidate path for flow transition [12]. When such paths are in hand, a discrete optimization algorithm is used to assign some flows to absorbing paths in order to satisfy demands.…”

A Decision Support System (FMOTS) for Location Decision of Taxicab Stands

“…In another study (Chen et.al, 2008) used fuzzy logic techniques for determining the satisfaction degrees of routes on road networks. Ghatee and Hashemi (2009) studied on a traffic assignment model in which the travel costs of links depend on their congestion. Some other studies are on signalized junctions, which are closely related with queuing theory: Murat and Baskan (2006) developed a vehicle delay estimation model especially for the cases of over-saturation or non-uniform conditions at signalized junctions.…”