The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Advanced vehicle guidance systems use real-time traffic information to route traffic and to avoid congestion. Unfortunately, these systems can only react upon the presence of traffic jams and not to prevent the creation of unnecessary congestion. Anticipatory vehicle routing is promising in that respect, because this approach allows directing vehicle routing by accounting for traffic forecast information...
Due to the deficiency of logistics distribution, this paper presents a new approach to deal with VRP problems and utilizes network analysis function of GIS. Firstly, this paper specifies how to establish road network based on GIS. Secondly, this paper focuses on Vehicle Routing Problems with Time Window constraints. Finally, article based on the network analysis function of GIS, routing results on...
In this article, we focus on a typical application of Cyber Physical System (CPS), i.e., vehicle route navigation. Two fundamental problems have been examined: 1) How different are various vehicle routing algorithms? 2) How valuable is real-time traffic information or historical traffic information in helping vehicle routing? Different from most previous works based on simulations, we presented performance...
This paper models a vehicle routing problem applied in Singapore transportation situation. It is close to the classical vehicle routing problem with time windows, but with two special characteristics. Firstly, the routes are designed for vehicles to serve the customers in a practical map modeled with a set of roads and junctions. Secondly, in order to manage the traffic conditions, the special Electronic...
In this paper, it is presented a methodology for solving the Vehicle Routing Problem with Pickup and Delivery and Time Windows (VRPPDTW). The proposed methodology can be divided in two phases, i.e, the construction phase and the refinement phase. In the construction phase, the generation of an initial solution is made through Ant Colony Optimization (ACO) meta-heuristic with the elitism concept. Only...
In Mobile Ad Hoc Networks (MANET), routing messages are broadcast if a destination is needed or a route to destination is broken. In this paper, we introduce a route breakage probability model of a mobile ad hoc network in a motorway scenario. The model shows high probability of route breakage between vehicles driving in opposite and low probability of route breakage between vehicles driving in same...
The dynamic setting of the node's power value is not involved in the traditional VANET protocol. Thus, the node energy could not be effectively saved, and the channel interference between nodes is likely to be caused. This paper proposes a new vehicle network routing technology based on power control--- PAODV, PAODV mainly uses the power control on link layer, and it is realized through MAC protocol...
A Fuzzy approach to backward movement control for trailers in a dynamic environment is presented in this paper. The approach is then extended and employed for conditions where obstacles are placed on the trailer pathway. In the first case, obstacles are assumed to be fixed, while the second condition includes moving obstacles through which the trailer should be directed toward the parking dock. The...
In the open vehicle routing problem (OVRP), a vehicle does not return to the depot after servicing the last customer on a route. Today, the OVRP is encountered in practice in the home delivery of packages and newspapers. Contractors who are not employees of the delivery company use their own vehicles and do not return to the depot. An improved tabu search for the open vehicle routing problem is considered...
Vehicular Ad-Hoc Networks (VANETs) are an important research area due to the potential benefits they could bring to traffic optimisation in urban environments. The communication protocols used within such networks, due to the intrinsic properties of such environments, reflect a series of characteristics which set them apart from common approaches. Routing messages, using a carry-and-forward strategy...
An evolutionary Multi-Objective Algorithm (MOA) is used to investigate the trade-off between CO2 savings, distance and number of vehicles used in a typical vehicle routing problem with Time Windows (VRPTW). A problem set is derived containing three problems based on accurate geographical data which encapsulates the topology of streets as well as layouts and characteristics of junctions. This is combined...
This study primarily focuses on solving the vehicle routing problem with soft time windows (VRPSTW) by applying an improved double-population genetic algorithm (DPGA). The traditional single-population genetic algorithm (SPGA) in solving vehicle routing problem usually traps in local optimum or consumes considerable time. In this paper two different initialization methods - random initialization method...
This paper is talking about Open Capacitated Arc Routing Problem,which is a combinational optimization problem.The objective is mainly to search for a solution of minimum cost.
One of the differences of freight modeling to passenger modeling is its complex pattern in supply chain process. Probability of tour is a function of network and impedances among destinations and fleet constraints. It is obvious that in network with passage restrictions (in residential streets and collectors) for heavy vehicles, the number of destinations in each tour (tour length) will increase and...
Providing Internet access on buses allow people to read news, check emails, watch sport games, and hence can greatly improve the quality of people's life. This paper proposes an adaptive routing protocol, called R-BUS for a bus network. R-BUS selects a route based on the link's lifetime and its communication signal quality. The protocol takes the bus mobility and the radio propagation model into account...
Vehicular ad hoc network (VANET) is a special class of wireless mobile communication network. For vehicle-to-vehicle (V2V) communication, suitable routing protocols are needed. A routing metric combining hop counts and retransmission counts at MAC layer is proposed with consideration of link quality and delay reduction. Based on the new routing metric, a cross-layer ad hoc on-demand multipath distance...
Improving the efficiency of dynamic vehicle routing problem on large scale road network is a difficult problem. There are numerous works proposed on this problem, they try to solve the problem from different aspects. In this paper, we propose a novel method-ellipse bounding method (EBM) based dynamic vehicle routing algorithm, which maintains dynamic ellipses to prune its searching branches while...
The Vehicle Routing Problem has been a popular research topic in logistics (Physical distribution) which is of much practical value. This thesis puts forward the method of solving vehicle routing problem by the immune algorithm. In the solution procedure, this thesis creates a new encoded model which can increase the operational efficiency of the algorithm presented by decreasing the encoding length...
It is possible to provide applications for life-saving and traffic control on VANET in which characteristic of high mobility and extreme topology changes is shown. And greedy-forwarding strategy that is one of the position-based routing schemes cause inefficient path forwarding and frequent transmission failure. Thus, we propose efficient routing scheme using circular node to provide service registration...
The vehicle routing problem is a classical NP (Non-deterministic Polynomial) problem, and it is usually difficult to obtain the satisfied solution by the traditional method. On the basis of analysis of the existing genetic algorithm, the vehicle routing problems is solved through the improved mutation operator and the genetic algorithm of natural number coding scheme. Experiment result indicates that...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.