Hazardous chemicals transportation requires a high-level of security assurance. It is an effective transport strategy that reserved-lanes are set in a transportation route to avoid accidents such as rear-end collision...
详细信息
Hazardous chemicals transportation requires a high-level of security assurance. It is an effective transport strategy that reserved-lanes are set in a transportation route to avoid accidents such as rear-end collision and crash. However, other vehicles will be inevitably influenced if a lane is set as the reserved-lane. Thus, how to minimize the influence by setting the reserved-lane becomes a problem needed to be studied. The mathematical programming model of the reserved-lane setting for hazardous chemicals transportation is established in this paper. According to the characteristics of the problem, the heuristic algorithm based on dijkstra algorithm is proposed. This algorithm is a simple and intelligible, satisfactory solution that can be obtained in polynomials.
The selection of optimal path is one of the classic problems in graph theory. Its utilization have various practical uses ranging from the transportation, civil engineering and other applications. Rarely those applica...
详细信息
ISBN:
(纸本)9783319114637;9783319114620
The selection of optimal path is one of the classic problems in graph theory. Its utilization have various practical uses ranging from the transportation, civil engineering and other applications. Rarely those applications take into account the uncertainty of the weights of the graph. However this uncertainty can have high impact on the results. Several studies offer solution by implementing the fuzzy arithmetic for calculation of the optimal path but even in those cases neither of those studies proposed complete solution to the problem of ranking of the fuzzy numbers. In the study the ranking system based on the Theory of Possibility is used. The biggest advantage of this approach is that it very well addresses the indistinguishability of fuzzy numbers. Lengths of the paths are compared based on the possibility and the necessity of being smaller than the alternative. The algorithm offers the user more information than only the optimal path, instead the list of possible solutions is calculated and the alternatives can be ranked using the possibility and the necessity to identify the possibly best variant.
This paper designs a parking guidance system based on parking sensor network. The system consists of parking lot sensors and sink node and parking manager. The system builds the parking sensor network by ZigBee commun...
详细信息
ISBN:
(纸本)9781467370059
This paper designs a parking guidance system based on parking sensor network. The system consists of parking lot sensors and sink node and parking manager. The system builds the parking sensor network by ZigBee communication protocol, where the real-time parking information of all parking sensors is transmitted to the sink node. The sink node sends information of all parking lots to the parking manager by manner. In the parking manager, there will display the information and position of the parking spaces. Moreover, this paper uses dijkstra optimization algorithm to obtain the optimal parking router.
A novel method of improved dijkstra algorithm and particle swarm optimization is proposed to evaluate global path planning for mobile robot. The first step is to make the MAKLINK graph which is used to describe the wo...
详细信息
ISBN:
(纸本)9780878492497
A novel method of improved dijkstra algorithm and particle swarm optimization is proposed to evaluate global path planning for mobile robot. The first step is to make the MAKLINK graph which is used to describe the working space of mobile robot. The limited length value of free linkage line is conducted to substitute the constant weights in the adjacent matrix, which is well correlated with the fact that the number of paths is drastically less than that using the conventional dijkstra method. Then the particle swarm optimization is adopted to investigate the global path from the several possible paths. Therefore, the proposed method facilitates reducing the computing time which enhances the efficiency of particle swarm optimization when performs the global path planning for mobile robot. Furthermore, simulation result is provided to verify the effectiveness and practicability.
In this paper, based on the dijkstra algorithm and its past improvements, a new improvement is proposed by considering the case of the nodes, reforming the feature matrix of precursor node, and adding a shortest path ...
详细信息
ISBN:
(纸本)9781424455690
In this paper, based on the dijkstra algorithm and its past improvements, a new improvement is proposed by considering the case of the nodes, reforming the feature matrix of precursor node, and adding a shortest path tree. The algorithm has its adantages on both reducing the number of repeated operations and reading the shortest path and the path length from the startpoint to all the other nodes by the shortest path tree or by the feature matrix.
In large or medium retail enterprises, the downstream of the supply chain is usually composed by distribution centers or various warehouses. Since the distance of each distribution route is large, so the optimization ...
详细信息
In large or medium retail enterprises, the downstream of the supply chain is usually composed by distribution centers or various warehouses. Since the distance of each distribution route is large, so the optimization of path is very important for the cost control and profit maximization of the enterprise. This paper uses dijkstra algorithm to solve the shortest path problem, and uses the method of map labeling, simplifying the solving process Finally through the abstracting model of the problem, and designing of structure and combining with the process oriented C language, the paper realizes this function.
Web services composing technique presents the wonderful outlook of flexibly and agilely constructing the enterprise applications for us. In this paper, we analyze the Web services composing model and propose a new met...
详细信息
ISBN:
(纸本)9781424458721;9781424458745
Web services composing technique presents the wonderful outlook of flexibly and agilely constructing the enterprise applications for us. In this paper, we analyze the Web services composing model and propose a new method of computing the service's QoS value solving the problem that the QoS properties have different trend. At the same time, we try to use the dijkstra algorithm to implement the optimal services composing path selecting and provide the formal description of the algorithm implementing the optimal path selecting process.
By analyzing operating principle and topology structure, complex water supply network can be abstracted into a weighted directed graph. Using dijkstra algorithm, minimum dissipated power paths from water sources to al...
详细信息
By analyzing operating principle and topology structure, complex water supply network can be abstracted into a weighted directed graph. Using dijkstra algorithm, minimum dissipated power paths from water sources to all nodes have been calculated to simplify the original network. Combining Sugiyama algorithm, the main network layout with a hierarchical structure and initial District Metering Area can be defined. For those nodes who are far away from the water sources and close to the border area, a boundary criterion has been proposed to check the belongings and to determine the final District Metering Area partition. Finally, a sample town with real data in Info Works WS software has been set up. This case study is presented to illustrate the effectiveness of our proposed method.
Improved dijkstra algorithm was applied to the buildings' intelligent evacuation path *** defining and describing attribute characteristics of network nodes about the architectural space and the evacuation passage...
详细信息
ISBN:
(纸本)9781479919819
Improved dijkstra algorithm was applied to the buildings' intelligent evacuation path *** defining and describing attribute characteristics of network nodes about the architectural space and the evacuation passageway,and then according to the fire information,the optimal evacuation path was ***,the optimal path of each node information and evacuation marks associated with the database to realize the data transmission of the path optimization algorithm and fire linkage control system and to achieve integration with the intelligent evacuation system as well.
Due to many factors,vegetable transportation scheme decision is more complicated,thus we put forward a reasonable and practical meaningful vegetables transport model that has considerable practical *** on the rational...
详细信息
ISBN:
(纸本)9781510811980
Due to many factors,vegetable transportation scheme decision is more complicated,thus we put forward a reasonable and practical meaningful vegetables transport model that has considerable practical *** on the rationality and feasibility of transportation scheme,and the limitation of vegetables supply and demand,we establish the linear programming model,and do AMPL procedure of the *** calculate the data of vegetables transportation about the city of planting base as an example,the solving speed and the results show the rationality of the model.
暂无评论