China 
Africa 
Explore chapters and articles related to this topic
Multi-Aerial-Robot Planning
Published in Yasmina Bestaoui Sebbane, Multi-UAV Planning and Task Allocation, 2020
The General Vehicle Routing Problem (GVRP) is a combined load acceptance and routing problem which generalizes the well-known VRP and Pickup and Delivery Problem (PDP). Among the real-life requirements are time-window restrictions, a heterogeneous vehicle fleet with different travel times, travel costs and capacity, multi-dimensional capacity constraints, order/vehicle compatibility constraints, order with multiple pickup delivery and service locations, different start and end locations for vehicles and route restrictions for vehicles. The most widely studied VRPs are the capacitated VRP and the vehicle routing problem with time windows (VRPTW). Variable neighborhood search is meta-heuristic based on the idea of systematically changing the neighborhood structure during the search. VNS systematically exploits the following observations: A local optimum with respect to one neighborhood structure is not necessary the same for another.A global optimum is a local optimum with respect to all possible neighborhood structures.For many problems, the local optima with respect to one or several neighborhoods are relatively close to each other.
School Bus Routing Problems and Solutions for Smart Cities ‒ A Case Study
Published in Pradeep Tomar, Gurjit Kaur, Green and Smart Technologies for Smart Cities, 2019
Carlos Alberto Ochoa, Aida Yarira Reyes Escalante
Vehicle routing problem (VRP) is an optimization issue that has been used for approximately 50 years for its benefits and applicability, and even today it is still used in the search for better routes of mobility (Lewis et al. 2018). Concerning the problem of transfers within the town, Gakenheimer (1997)indicated that there were disturbing records that accessibility between places had already disappeared. Mobility problems have been studied in more detail since 1998 when the problems caused lost times and important effects in the economic, environmental and social areas, examples of this problem are presented below Rio de Janeiro, Brazil, has recorded taking up to 90 minutes to get from one place in the city to another;Bogotá, Colombia, where a person can take 60 minutes to move from a place to another;Manila, with speeds of seven miles per hour due to vehicular congestion; andBangkok, which, due to the amount of traffic, there were stoppages recorded that, on average, is equivalent to 44 days lost in traffic jams in a year.
Orienteering and Coverage
Published in Yasmina Bestaoui Sebbane, Intelligent Autonomy of Uavs, 2018
The most widely studied VRPs are the capacitated VRP and the vehicle routing problem with time windows (VRPTW). Variable neighborhood search (VNS) is a meta-heuristic based on the idea of systematically changing the neighborhood structure during the search. VNS systematically exploits the following observation:A local optimum with respect to one neighborhood structure is not necessary as for another.A global optimum is a local optimum with respect to all possible neighborhood structures.For many problems local optima with respect to one or several neighborhoods are relatively close to each other.
Biomass supply chain resilience: integrating demand and availability predictions into routing decisions using machine learning
Published in Smart Science, 2023
Foad Esmaeili, Fereshteh Mafakheri, Fuzhan Nasiri
Vehicle Routing Problem (VRP) algorithms are combinatorial optimization algorithms where a set of vehicles have to start from a depot and traverse between given destinations. The aim of these algorithms is to minimize traveled distances contributing to the minimization of transportation costs and/or time [41]. Vehicle routing problems are computationally expensive. Therefore, various exact and heuristic algorithms have been proposed to solve the VRP. Once the number of nodes, either delivery points or depots, increase, the level hardness to solve the problem drastically increases [42]. In supply chain management, a key objective is to minimize the cost of the transportation fleet. These costs will decrease if optimal routes are taken by the fleet. In addition, other parameters, such as freshness of perishable goods upon delivery are of great importance to minimize delivery time [43].
Adaptive multi-phase approach for solving the realistic vehicle routing problems in logistics with innovative comparison method for evaluation based on real GPS data
Published in Transportation Letters, 2022
Emir Žunić, Sead Delalić, Dženana Đonko
The problem of optimization of transport routes and optimal utilization of the transport fleet has been discussed and constantly improved for many years. Vehicle routing problem (VRP) represents the entire group of problems where the goal is to find the optimal route, in which a transport vehicle or more of them visit the specific number of customers (delivery points), starting from the central depot and returning thereafter serving customers. In some cases, one vehicle can be used more than once during a single routing. The optimal route is the one with the minimum cost road (Dantzig and Ramser 1959). These problems of optimization become extremely complex if a large number of customers are taken into consideration. Vehicle routing problems are a real challenge to solve when numerous real limitations (constraints) are included, such as the time windows of customers, time of unloading the merchandise, different types of options for packing the goods into vehicles, predefined capacity, and a heterogeneous fleet of vehicles, as well as fixed and variable vehicle costs. These indicators significantly reduce the number of available approaches, models, and algorithms, which can be applied to a complex set of input data.
The vehicle routing problem for perishable goods: A systematic review
Published in Cogent Engineering, 2020
Dana Marsetiya Utama, Shanty Kusuma Dewi, Abdul Wahid, Imam Santoso
The Vehicle Routing Problem (VRP) is a matter of determining the optimal routes carried out by vehicles to serve a particular set of customers. One of some problem in VRP is the Vehicle Routing Problem for Perishable Goods (VRPfPG) that address for products that are rapidly losing quality and perishable. In this paper, a systematic literature review is carried out on the single and multiple-objective problem-solving. These problems are classified based on optimization methods and objective functions. Most of the reviewed papers above consider a single-objective problem, while some focus on multi-objective problems. Moreover, an analysis based on the optimization method, and the objective function is presented completely in single and multiple-objective problems. Finally, future studies are suggested to explore comprehensive studies in the VRPfPG problem.