排序方式: 共有3条查询结果,搜索用时 0 毫秒
1
1.
In this paper, urban network design is analysed through a heuristic multi-criteria technique based on genetic algorithms. Both network layout and link capacity (link layout and traffic lights) are optimised. Different optimisation criteria are included for users, non-users and public system managers. Demand is considered elastic with respect to mode choice; both morning and afternoon peak periods are taken into account. In addition, choice of parking location is simulated. The procedure is applied to a test and to a real transportation system. 相似文献
2.
One of the main components of stochastic assignment models is the route choice model solved with implicit or explicit path enumeration algorithms. Such models are used both for congested networks within equilibrium or dynamic models and for non-congested networks within static or pseudo-dynamic network loading models. This paper proposes a C-Logit model specification within a Dial algorithm structure for the implicit assignment of network flows. The model and its solution algorithm, called D-C-Logit, combine several positive features found in the literature for choice set generation and choices from a given choice set: generation of a set of alternatives with a selective approach; calculation of the path choice probability in a closed form; simulation of the overlapping effect among alternative paths; computation of just one tree for each origin avoiding explicit path enumeration.This paper has two main objectives: the proposition of a Dial-like algorithm to solve a C-Logit assignment model and application of the algorithm to different networks in order to demonstrate certain properties. 相似文献
3.
The paper proposes and applies a method for systematically sorting and reducing the number of different possible solutions
to a network design problem (NDP). This is achieved first by defining a topological similarity measurement and then by applying
cluster analysis. The NDP can be derived from the scientific literature. In general, the method consists of some models and
subsequent algorithms that generate different solutions (enumerative, branch and bound, genetic, expert panel, ...) and evaluate
for each solution an objective function (with deterministic or stochastic network assignment and with elastic or inelastic
demand). The NDP, mainly in urban areas, needs multi-criteria evaluation and in each case a large set of non-dominated solutions
is generated. In this paper, in order to select solutions and identify latent optimal network layouts, cluster analysis is
carried out. The methodology utilises a “cluster” formation in relation to the solution topology and a “best” (representative)
solutions extraction in relation to the criteria values. It can be utilised after solving the existing multi-criteria NDP
and in other network problems, where the best solutions (for global or local network layouts) are extracted (with respect
to the network topology) from a large set. The method is applied in a test system and on different real networks in two Italian
towns, in order to analyse the goodness of the solution algorithm and assess its possible application to different networks. 相似文献
1