Search

The efficient design of water transmission main involves several optimization processes among which an important place is held by their path optimization. In this paper are developed two deterministic mathematical models for optimization of water transmission main path, based on techniques of sequential operational calculus, implemented in a computer program. Using these optimization models could be obtained an optimal solution for selection of source location and of water transmission main path based on graph theory and dynamic programming. The results of few numerical applications show the effectiveness and efficiency of the proposed optimization models. [ABSTRACT FROM AUTHOR]

During the course of moving in the urban traffic network, the need of mobile vehicle navigation service may be altered or updated at any time. For instance, the mobile vehicle may want to go to another destination in the middle of driving according to the selected navigation route. Thus, we should select an optimum temporary point of interest in the candidate sets to work out a new effective navigation route. In the light of the navigation need and the query efficiency of urban traffic navigation saptio-temporal data, the paper presented an urban traffic navigation data model firstly. Secondly, the paper proposed a novel saptio-temporal index for the urban traffic network, which is called Urban Traffic Navigation R-tree. Finally, the author put forward a saptio-temporal data query method based on the temporary additional point of interest. Extensive experiments have demonstrated the efficiency and accuracy of the method. [ABSTRACT FROM PUBLISHER]

Localization of mobile nodes is a challenging problem especially when both anchor and node are mobile. In this paper, algorithms for optimal anchor guiding, to localize maximum number of nodes, are proposed. The algorithms are based on the principle of jointly maximizing a grid benefit criterion and the number of nodes localized. The advantage of these algorithms is that, that both the anchors and nodes can be deployed randomly and can traverse the region with varying speeds. Additionally, the optimal path for the anchor is decided in such a way that the maximum number of nodes are localized. The proposed algorithms are extensively analyzed for their performance by conducting experiments on both, NI and Crossbow set-up. The results obtained from localization error analysis indicate that the algorithms discussed in this work perform reasonably better than the similar conventional algorithms available in literature. Additional analysis performed on energy consumption indicate that the proposed algorithms are energy efficient. [ABSTRACT FROM PUBLISHER]

Aiming at the problem of low positioning accuracy and unitary function existing in currently domestic commercial, a low-cost vehicle navigation system with map matching and path planning based on Windows Mobile was designed. The design principle and realization of the embedded vehicle navigation system and background monitor center were provided in detail. In order to met the requirements of high-precision positioning and real-time navigation, the dynamic parallelogram map-matching algorithm and the optimal-path A∗ algorithm were applied to the system. Real-life application of the system to the City of Hefei showed that the performance was stable, and it achieved the expected design goal. [ABSTRACT FROM PUBLISHER]

In this paper we propose a network aware approach for routing in graded network using Artificial Bee Colony (ABC) algorithm. ABC has been used as a good search process for optimality exploitation and exploration. The paper shows how ABC approach has been utilized for determining the optimal path based on bandwidth availability of the link and how it outperformed non graded network while deriving the optimal path. The selection of the nodes is based on the direction of the destination node also. This would help in narrowing down the number of nodes participating in routing. Here an agent system governs the collection of QoS parameters of the nodes. Also a quadrant is synthesized with centre as the source node. Based on the information of which quadrant the destination belongs, a search is performed. Among the many searches observed by the onlooker bees the best path is selected based on which onlooker bee comes back to source with information of the optimal path. The simulation result shows that the path convergence in graded network with ABC was 30% faster than non-graded ABC. [ABSTRACT FROM PUBLISHER]

With the vigorous development of economics, urban transportation construction is continuing to expand and the need for traffic travel is increasing. The key solutions to relieve the over-crowdedness of urban traffic reside in the following aspects: to give priority to the development of public transport, to scientifically organize the public transportation resources for operations, to maximize the advantages of public transport, and to improve the overall efficiency and service levels of the public transport system. In this paper we first discuss the state-of-arts of researches on domestic and international urban public transport systems. Based on our discussion, we analyze the urban public transport network architecture from aspects such as the basic components of public transport network, and the characteristics of public transport network, etc. In addition, we judge comprehensively according to the preference for the passengers travel choices, transit network model characteristics and time cost. Combined with the survey of Shanghai residents on travel habits, we verified and analyzed the constraints of passengers travel decision-making factors. Through comparative analysis, based on the ISM analysis method we can effectively analyze the psychology and the principle of optimal choice of passenger travel, and by the algorithm of proposed model, this paper provides ideas for the shift of transit mode of passengers travel route from a traditional mode to a multi-modal one. [ABSTRACT FROM PUBLISHER]

This path planning algorithm is used for the autonomous vehicle driving in the unstructured road. The gradient grid which is obtained from the point cloud data is used as the cost field. Considering the traffic-ability of autonomous vehicle, the cost field needs to be corrected by the High-resolution gradient and elevation grid in this paper. Then transforming the grid model into the network-node model. In this way, the cost field model can be used for the optimal path algorithm, such as the Dijkstra algorithm. [ABSTRACT FROM PUBLISHER]

Understanding source code identifiers, by identifying words composing them, is a necessary step for many program comprehension, reverse engineering, or redocumentation tasks. To this aim, researchers have proposed several identifier splitting and expansion approaches such as Samurai, TIDIER and more recently GenTest. The ultimate goal of such approaches is to help disambiguating conceptual information encoded in compound (or abbreviated) identifiers. This paper presents TRIS, TRee-based Identifier Splitter, a two-phases approach to split and expand program identifiers. First, TRIS pre-compiles transformed dictionary words into a tree representation, associating a cost to each transformation. In a second phase, it maps the identifier splitting/expansion problem into a minimization problem, i.e., the search of the shortest path (optimal split/expansion) in a weighted graph. We apply TRIS to a sample of 974 identifiers extracted from JHotDraw, 3,085 from Lynx, and to a sample of 489 identifiers extracted from 340 C programs. Also, we compare TRIS with GenTest on a set of 2,663 mixed Java, C and C++ identifiers. We report evidence that TRIS split (and expansion) is more accurate than state-of-the-art approaches and that it is also efficient in terms of computation time. [ABSTRACT FROM PUBLISHER]

This paper deals with automatic data retranslation in wireless data networks. Data network can be dynamic, i.e. repeated changes of connection state between the networks elements occur. The paper presents this data network architecture, data retranslation principles, maintenance and distribution of information about connection state between networks elements and searching for optimal path from source to destination. [ABSTRACT FROM AUTHOR]

The algorithm of path dynamic optimization is an important part of intelligent transportation system. Based on the assumption that the network status is known or predictable, this paper estimated dynamical travel time in the urban road network by established mathematical model; Optimal path algorithm that can effectively solve the induction of the urban road network was proposed; Based on the actual road network and combined with geographic information, it developed dynamic path planning of urban road network experimental system, which can realize real-time dynamic optimal route guidance. [ABSTRACT FROM PUBLISHER]