Parallel genetic approach for routing optimization in large ad hoc networks

<span>This article presents a new approach of integrating parallelism into the genetic algorithm (GA), to solve the problem of routing in a large ad hoc network, the goal is to find the shortest path routing. Firstly, we fix the source and destination, and we use the variable-length chromosomes (routes) and their genes (nodes), in our work we have answered the following question: what is the better solution to find the shortest path: the sequential or parallel method?. All modern systems support simultaneous processes and threads, processes are instances of programs that generally run independently, for example, if you start a program, the operating system spawns a new process that runs parallel elements to other programs, within these processes, we can use threads to execute code simultaneously. Therefore, we can make the most of the available central processing unit (CPU) cores. Furthermore, the obtained results showed that our algorithm gives a much better quality of solutions. Thereafter, we propose an example of a network with 40 nodes, to study the difference between the sequential and parallel methods, then we increased the number of sensors to 100 nodes, to solve the problem of the shortest path in a large ad hoc network.</span>

Neural Network-Based Prediction of Vehicle Fuel Consumption Based on Driving Cycle Data

This paper deals with fuel consumption prediction based on vehicle velocity, acceleration, and road slope time series inputs. Several data-driven models are considered for this purpose, including linear regression models and neural network-based ones. The emphasis is on accounting for the road slope impact when forming the model inputs, in order to improve the prediction accuracy. A particular focus is devoted to conversion of length-varying driving cycles into fixed dimension inputs suitable for neural networks. The proposed prediction algorithms are parameterized and tested based on GPS- and CAN-based tracking data recorded on a number of city buses during their regular operation. The test results demonstrate that a proposed neural network-based approach provides a favorable prediction accuracy and reasonable execution speed, thus making it suitable for various applications such as vehicle routing optimization, synthetic driving cycle validation, transport planning and similar.

Goods Delivery with Electric Vehicles: Electric Vehicle Routing Optimization with Time Windows and Partial or Full Recharge

With the rise of the electric vehicle market share, many logistic companies have started to use electric vehicles for goods delivery. Compared to the vehicles with an internal combustion engine, electric vehicles are considered as a cleaner mode of transport that can reduce greenhouse gas emissions. As electric vehicles have a shorter driving range and have to visit charging stations to replenish their energy, the efficient routing plan is harder to achieve. In this paper, the Electric Vehicle Routing Problem with Time Windows (EVRPTW), which deals with the routing of electric vehicles for the purpose of goods delivery, is observed. Two recharge policies are considered: full recharge and partial recharge. To solve the problem, an Adaptive Large Neighborhood Search (ALNS) metaheuristic based on the ruin-recreate strategy is coupled with a new initial solution heuristic, local search, route removal, and exact procedure for optimal charging station placement. The procedure for the O(1) evaluation in EVRPTW with partial and full recharge strategies is presented. The ALNS was able to find 38 new best solutions on benchmark EVRPTW instances. The results also indicate the benefits and drawbacks of using a partial recharge strategy compared to the full recharge strategy.