Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Proceedings
ISSN 1759-3433 CCP: 76
PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by: B.H.V. Topping and Z. Bittnar
Paper 71
Optimal Allocation of Service Facilities for an Expressway A. O'hashi+, Y. Kohama* and A. Miyamura+
+School of Design and Architecture, Nagoya City University, Nagoya, Japan
A. O'hashi, Y. Kohama, A. Miyamura, "Optimal Allocation of Service Facilities for an Expressway", in B.H.V. Topping, Z. Bittnar, (Editors), "Proceedings of the Third International Conference on Engineering Computational Technology", Civil-Comp Press, Stirlingshire, UK, Paper 71, 2002. doi:10.4203/ccp.76.71
Keywords: optimal allocation, distance measurement, expressway network, graph theory, genetic algorithm.
Summary
The present study deals with the optimal allocation of transportation
facilities or interchange-and-exits on a expressway network with loops
under various kinds of constraints.
Such a problem in general belongs to the combinatorial optimality problems
frequently with a result in enormous amount of generate-and-test
in exponential increase of searching space, which requires
necessary establishment of the heuristic rules or the problem
oriented rules to prune futile alternatives as effectively as possible [3].
Recent results show efficiency of the genetic algorithm (GA), though without
rigorous guarantee of optimality.
However, many cases for engineering requirements by GA could be satisfied [8].
A continuous treatment on the present optimality problem can be realized by
traditional mathematical methods including the iteration technique or
application of the first derivatives to accelerate approximation
to optimality.
The present optimal allocation problem can be described continuously, which
belongs substantially to Voronoi allocation problem [4,5].
Focusing on the transportation problems, a spacing of bus-stops for many to
many travel demand is analyzed [1,4].
Such optimal allocation of bus-stops on routes is methodologically
accomplished[10].
Sequential location-allocation of public facilities in 2D plane is also
dealt with [6].
Practically, it is important to evaluate constraints to optimality,
which include various factors as a density distribution, such as of
population, industrial output, or environmental effects.
An equivalent density distribution in terms of distance from such factors could
simplify complicatedness to a large extent.
Between many synthesis techniques of evaluation, the maximum entropty criteria
could provide rather consistent results.
Thus, a general formulation of the present optimal allocation problem or the original problem is, herein, accomplished with a result in simplified extension problem, which can provide consistently physical background together with easier numerical procedure by the iteration technique. Some numerical examples are compared to a practical design result with considerable rationality. References
purchase the full-text of this paper (price £20)
go to the previous paper |
|