This article is conducting a study on the demand forecast from the distribution network system composed of m-distribution centers and n-retailers. We analyze the characteristics of the regional logistics network. Use ...
详细信息
This article is conducting a study on the demand forecast from the distribution network system composed of m-distribution centers and n-retailers. We analyze the characteristics of the regional logistics network. Use the dijkstra shortest path algorithm and gain the shortest path distribution, based on which the inventory demand forecasting model which can obtain the total demand of each distribution center is established. Finally, an example is given to show that the model is correct and feasible.
This article is conducting a study on the demand forecast from the distribution network system composed of m-distribution centers and *** analyze the characteristics of the regional logistics network. Use the dijkstra...
详细信息
This article is conducting a study on the demand forecast from the distribution network system composed of m-distribution centers and *** analyze the characteristics of the regional logistics network. Use the dijkstra shortest path algorithm and gain the shortest path distribution,based on which the inventory demand forecasting model which can obtain the total demand of each distribution center is ***,an example is given to show that the model is correct and feasible.
Since the number of private cars in cities is growing increasingly and the phenomenon of traffic jams is more and more severe,how to utilize the current road network and improve the transportation efficiency more rati...
详细信息
Since the number of private cars in cities is growing increasingly and the phenomenon of traffic jams is more and more severe,how to utilize the current road network and improve the transportation efficiency more rational has become a research which highlights in today's academic world. With regard to this issue,Beijing ring road traffic system is taken as the model in this paper,what's more,a new dynamic route guidance algorithm is proposed to provide the humanized"optimal route"for the *** study builds a graph theory model of road network for Beijing ring road traffic system,and realizes the optimal route of calculation by classic dijkstra ***,based on the particularity of ring road traffic city,the study improves the calculation priority of ring road node in dijkstra algorithm. Compared with traditional dijkstra algorithm,the time complexity of this new algorithm decreases to 1/16k(k equals to the number of ring road in the road network).In addition, when referring to control the middle and long distance of route guidance,the extra miles is less than 5%,which effectively promotes the algorithm practicability on large-scale ring road network.
The multiobjective route selection problem (m-RSP) is a key research topic in the car navigation system (CNS) for ITS (Intelligent Transportation System). In this paper, we propose an interactive multistage weight-bas...
详细信息
The multiobjective route selection problem (m-RSP) is a key research topic in the car navigation system (CNS) for ITS (Intelligent Transportation System). In this paper, we propose an interactive multistage weight-based dijkstra genetic algorithm (mwD-GA) to solve it. The purpose of the proposed approach is to create enough Pareto-optimal route's with good distribution for the car driver depending on his/her preference. At the same time, the routes can be recalculated according to the driver's preferences by the multistage framework proposed. In the solution approach proposed, the accurate route searching ability of the dijkstra algorithm and the exploration ability of the Genetic algorithm (GA) are effectively combined together for solving the m-RSP problems. Solutions provided by the proposed approach are compared with the current research to show the effectiveness and practicability of the solution approach proposed.
This paper consists of two parts: planning Co-operative Transport Systems (CTS) with general rules (communication is a new idea in this system) and an investigation into route planning as a part of services provided i...
详细信息
This paper consists of two parts: planning Co-operative Transport Systems (CTS) with general rules (communication is a new idea in this system) and an investigation into route planning as a part of services provided in CTS. Part one reveals developing new systems for cooperative sensing and predicting flow, infrastructure and environmental conditions surrounding traffic, with a view to improve the safety and efficiency of road transport operations. Part two introduces the enhancement of the performance of the route planning algorithms. The key issues of these parts are communication and co-operation between the elements of the whole Co-operative Transport System.
The cross-layer design approach is an important concept in ad-hoc networks which is adopted to solve several open issues. It aims to overcome MANET performance problems by allowing protocols belonging to different lay...
详细信息
ISBN:
(纸本)9783642016646
The cross-layer design approach is an important concept in ad-hoc networks which is adopted to solve several open issues. It aims to overcome MANET performance problems by allowing protocols belonging to different layers to cooperate and share network status information while still maintaining separated layers. In this work, we provide a routing agent of cross layer method which is based on the cooperation between Adjacency matrix routing protocol and the IEEE 802.11e MAC protocol. This proposal aims to avoid the congested nodes and guarantee better performance in terms of delay, packet delivery ratio, and so on. In the proposed method, each node maintains an adjacency matrix representing the network topology and MAC conditions with neighbors. The number of retransmissions in MAC layer is introduced as an indication of congestion. When the congestion occurs, the source node works as the routing agent to detect new route by checking MAC information and the adjacency matrix to the destination. The simulation results show that Cross layer give better performance than network layer only methods, especially in the frequent congestion condition.
With the research and application of Intelligent Transportation System, there is a higher requirement for solving the optimal path problem in large scale transportation networks in real time. In order to get the effec...
详细信息
ISBN:
(纸本)9780769535708
With the research and application of Intelligent Transportation System, there is a higher requirement for solving the optimal path problem in large scale transportation networks in real time. In order to get the effective optimal path algorithms for the actual transportation networks, three optimal path algorithms are chosen to be parallelized. The parallel optimal path algorithms are then implemented based on dual-core processor and the speed-up ratio and efficiency of parallel algorithms are tested and analyzed in actual Xi'an road networks with 4525 nodes and 6616 paths. The experiment results show that the parallel algorithms devised in this paper are efficient and the speed-up ratio of the three parallel algorithms are satisfied in solving optimal path problems in large scale networks.
The shortest path based on MAKLINK graph is composed of straight line segments, and there may have not sufficient space for path smoothing when the vehicle is bounded by turning radius. Both the necessary conditions t...
详细信息
ISBN:
(纸本)9780769538044
The shortest path based on MAKLINK graph is composed of straight line segments, and there may have not sufficient space for path smoothing when the vehicle is bounded by turning radius. Both the necessary conditions that the vehicle makes a turn safely at the vertex of swell annulus and the space constraint equation of the path nodes are considered. Transition arcs can be employed directly to wipe off the inflexions of the path, which are intersections of the line segments on the shortest path obtained by the ACS algorithm. To speed up the convergence speed and avoid falling into local optimal solution, the ACS algorithm is improved in this paper by introducing the global-distance heuristic factor, using pheromone evaporation coefficient with the function of automatic adjustment and restricting the pheromone concentration within some range. The pheromone evaporation coefficient can adjust automatically. The simulation results show that the method can find a collision-free path quickly under different conditions. The quickness and feasibility are demonstrated.
Global path planning for mobile robot using genetic algorithm and simulated annealing algorithm is investigated in this paper. In view of the slow convergence speed of the conventional simulated annealing algorithm, a...
详细信息
ISBN:
(纸本)9781605583266
Global path planning for mobile robot using genetic algorithm and simulated annealing algorithm is investigated in this paper. In view of the slow convergence speed of the conventional simulated annealing algorithm, a modified simulated annealing algorithm is presented, and a hybrid algorithm based on the modified simulated annealing algorithm and genetic algorithm is proposed. The proposed algorithm includes three steps: the MAKLINK graph theory is adopted to establish the free space model of mobile robots firstly, then dijkstra algorithm is utilized for finding a feasible collision-free path and fixing on the sub-search-space where the global optimal path inside,. finally the global optimal path of mobile robots is obtained based on the hybrid algorithm of modified simulated annealing algorithm and genetic algorithm. Experimental results indicate that the proposed algorithm has better performance than simulated annealing algorithm and ant system algorithm in term of both solution quality and computational time, and thus it is a viable approach to mobile robot global path planning.
This paper proposes an algorithm based on a transfer graph model to compute a Multimodal Shortest Path (MSP) between a given source node s and a destination node d. The first step of this algorithm consists of computi...
详细信息
ISBN:
(纸本)9781424441358
This paper proposes an algorithm based on a transfer graph model to compute a Multimodal Shortest Path (MSP) between a given source node s and a destination node d. The first step of this algorithm consists of computing a database saving a large part of necessary data to provide a response to a user itinerary request. Whe show in this paper that using Ant Colony Optimization metaheuristic (ACO) to compute this database, reduces considerably the memory space complexity comparing to the Dijskstra algorithm.
暂无评论