scholarly journals Route Planning for Agricultural Machines with Multiple Depots: Manure Application Case Study

Agronomy ◽  
2020 ◽  
Vol 10 (10) ◽  
pp. 1608
Author(s):  
Mahdi Vahdanjoo ◽  
Kun Zhou ◽  
Claus Aage Grøn Sørensen
Keyword(s):  
Route Planning ◽  
Route Optimization ◽  
Specific Load ◽  
Planning Tool ◽  
Routing Problem ◽  
Planning Approach ◽  
Multiple Depots ◽  
General Goal ◽  
Agricultural Machines

Capacitated field operations involve input/output material flows where there are capacity constraints in the form of a specific load that a vehicle can carry. As such, a specific normal-sized field cannot be covered in one single operation using only one load, and the vehicle needs to get serviced (i.e., refilling) from out-of-field facilities (depot). Although several algorithms have been developed to solve the routing problem of capacitated operations, these algorithms only considered one depot. The general goal of this paper is to develop a route planning tool for agricultural machines with multiple depots. The tool presented consists of two modules: the first one regards the field geometrical representation in which the field is partitioned into tracks and headland passes; the second one regards route optimization that is implemented by the metaheuristic simulated annealing (SA) algorithm. In order to validate the developed tool, a comparison between a well-known route planning approach, namely B-pattern, and the algorithm presented in this study was carried out. The results show that the proposed algorithm outperforms the B-pattern by up to 20.0% in terms of traveled nonworking distance. The applicability of the tool developed was tested in a case study with seven scenarios differing in terms of locations and number of depots. The results of this study illustrated that the location and number of depots significantly affect the total nonworking traversal distance during a field operation.

Real-time Unmanned Aerial Vehicle Cruise Route Optimization for Road Segment Surveillance using Decomposition Algorithm

Robotica ◽  
2020 ◽  
pp. 1-16
Author(s):  
Xiaofeng Liu ◽  
Jian Ma ◽  
Dashan Chen ◽  
Li-Ye Zhang
Keyword(s):  
Real Time ◽  
Unmanned Aerial Vehicle ◽  
Route Planning ◽  
Traffic Monitoring ◽  
Route Optimization ◽  
Road Segment ◽  
Solution Quality ◽  
Planning Approach ◽  
Aerial Vehicle ◽  
Road Segments

SUMMARY Unmanned aerial vehicle (UAV) was introduced for nondeterministic traffic monitoring, and a real-time UAV cruise route planning approach was proposed for road segment surveillance. First, critical road segments are defined so as to identify the visiting and unvisited road segments. Then, a UAV cruise route optimization model is established. Next, a decomposition-based multi-objective evolutionary algorithm (DMEA) is proposed. Furthermore, a case study with two scenarios and algorithm sensitivity analysis are conducted. The analysis result shows that DMEA outperforms other two commonly used algorithms in terms of calculation time and solution quality. Finally, conclusions and recommendations on UAV-based traffic monitoring are presented.

scholarly journals Research on Coordination and Optimization of Order Allocation and Delivery Route Planning in Take-Out System

2020 ◽  
Vol 2020 ◽  
pp. 1-16
Author(s):  
Guofeng Sun ◽  
Zhiqiang Tian ◽  
Renhua Liu ◽  
Yun Jing ◽  
Yawen Ma
Keyword(s):  
Time Window ◽  
Route Planning ◽  
Route Optimization ◽  
Dynamic Allocation ◽  
Improved Genetic Algorithm ◽  
Time Dimension ◽  
Order Allocation ◽  
Routing Problem ◽  
Delivery Problem ◽  
Delivery Route

This paper studies the take-out route delivery problem (TRDP) with order allocation and unilateral soft time window constraints. The TRDP considers the order allocation and delivery route optimization in the delivery service process. The TRDP is a challenging version of vehicle routing problem. In order to solve this problem, this paper aims to minimize the total cost of delivery, builds an optimization model of this problem by using cumulative time, and adds time dimension in order allocation and path optimization dimensions. It can not only track the real-time location of delivery personnel but also record the delivery personnel to perform a certain task. The main algorithm is the dynamic allocation algorithm designed from the perspective of dispatch efficiency, and the subalgorithm is the improved genetic algorithm. Finally, some experiments are designed to verify the effectiveness of the established model and the designed algorithm, the order allocation and route optimization are calculated with/without the consideration of traffic jam, and the results show that the algorithm can generate better solution in each scene.

scholarly journals Research on Optimization of Customized Bus Routes Based on Uncertainty Theory

2021 ◽  
Vol 2021 ◽  
pp. 1-10
Author(s):  
Zi Sang ◽  
Bing Zhang ◽  
Yunqiang Xue ◽  
Hongzhi Guan
Keyword(s):  
Optimization Model ◽  
Uncertainty Theory ◽  
Optimization Problem ◽  
Route Planning ◽  
Route Optimization ◽  
Improved Genetic Algorithm ◽  
Optimization Scheme ◽  
Theoretical Support ◽  
Vehicle Operation

In the optimization process of the routes of customized buses, there are numerous uncertainties in the route planning and setting. In this study, the uncertainty theory is introduced into the optimization problem of a customized bus route, and an uncertain customized bus route optimization model is established, which aims at the minimizing the total mileage of vehicle operation. An improved genetic algorithm is used to solve the model, whose feasibility is verified by a case study. The results show that the optimization model based on the uncertainty theory can yield a reasonable customized bus route optimization scheme, and the total mileage reduced from 35.6 kilometers to 32.2 kilometers. This research provides the theoretical support for the optimization of customized bus routes.

Sustainable location and route planning with GIS for waste sorting centers, case study: Kerman, Iran

2018 ◽  
Vol 37 (3) ◽  
pp. 287-300 ◽  
Author(s):  
Amin Farahbakhsh ◽  
Mohammad Ali Forghani
Keyword(s):  
Route Planning ◽  
Health Centers ◽  
Solid Waste Disposal ◽  
Network Distance ◽  
Routing Problem ◽  
Waste Production ◽  
Plastic Metal ◽  
Hierarchy Process ◽  
The City

One of the important issues in the world is the significant growth of waste production, including waste that is not biodegradable in nature. According to the Kerman Municipality, 440 tonnes of municipal waste is collected daily in Kerman consisting of five major parts of paper, plastic, metal, glass, and wet waste. The major problems of municipal solid waste disposal are soil erosion, air pollution, and greenhouse gas emissions. The most important factors related to recycling are waste sorting and the relevant environmental conditions. This study aims to create a sustainable approach by locating the optimal sites to reduce environmental pollution, decrease costs, and improve the service system to the society. Optimal locations for establishing the collecting and sorting centers in the city are specified by the use of geographic information system software, based on criteria consisting of population density, road network, distance to health centers, distance to disposal center, waste sorting culture, land space, and land cost, which were weighted by an analytical hierarchy process. It was noteworthy that the criterion “waste sorting culture”, which has a foundation in human sciences and sociology, has been considered by experts in this study to be of the highest importance among other criteria at locating sorting centers. Subsequently, using a symmetric capacitated vehicle routing problem, the number and capacity of each vehicle are determined to serve the specified locations according to the economic, social, and environmental constraints.

scholarly journals A Heterogeneous Vehicle Routing Problem with Soft Time Windows for 3PL Company’s Deliveries: A Case Study

2021 ◽  
Vol 54 (6) ◽  
pp. 909-914
Author(s):  
Basma Ismail ◽  
Mahmoud Abo El Enin ◽  
Mariam Osama ◽  
Mariam Abdelhaleem ◽  
Michael Geris ◽  
...  
Keyword(s):  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Time Windows ◽  
Route Optimization ◽  
Third Party ◽  
Time Interval ◽  
Routing Problem ◽  
Soft Time Windows ◽  
Heterogeneous Vehicle Routing Problem

Route optimization is tactically important for companies that must fulfill the demands of different customers with fleet of vehicles, considering multiple factors like: the cost of the resources (vehicles) involved and the operating costs of the entire process. As a case study, a third-party logistics service provider, ABC Company, is introduced to implement optimization on. Furthermore, ABC Company’s problem is defined as route optimization and load consolidation problems that will be solved as heterogeneous vehicle routing problem with soft time windows (HVRPSTW). In this paper’s case, Vehicles travel from a central depot with a restricted capacity, serving clients just once within a defined time interval and providing a needed demand before returning to the central depot. ABC Company’s problem is mathematically formulated and solved using branch and bound method. The formulation is solved on LINGO. The final output is the route, time, cost, and load of each vehicle.

scholarly journals A Brief Note on Bus Based Evacuation Planning

2016 ◽  
Vol 21 (1) ◽  
pp. 28-34
Author(s):  
Bam Bahadur Thapa ◽  
Shree Ram Khadka
Keyword(s):  
Emergency Preparedness ◽  
Vehicle Routing Problem ◽  
Route Planning ◽  
Emergency Planning ◽  
Evacuation Planning ◽  
Routing Problem ◽  
Safe Region ◽  
Evacuation Route Planning ◽  
Evacuation Route

Evacuation route planning is essential for emergency preparedness, especially in regions threatened by hurricanes, earthquake etc. The evacuees who do not travel on their own are gathered at few collection points, where they are brought on buses to take them to safe region in bus based evacuation. Bus based evacuation planning is more essential for developing country like Nepal. It is necessary to reach the destination as early as possible for bus based evacuation. The bus based evacuation planning (BEP) problem is a variant of vehicle routing problem that arises in emergency planning. The problem in this variant is that not all the evacuees can gather at the same time, elderly and handicaps may need special help like wheelchair and may need more pickup time. Another problem is that at the shelter, some people may need special care like medicine, oxygen etc. In this paper we review a mathematical model to minimize the duration of evacuation together with the dynamic programming and the branch and bound as solution procedures. Moreover, a brief report of a case study for Kathmandu has also been given.Journal of Institute of Science and TechnologyVolume 21, Issue 1, August 2016, page: 28-34

scholarly journals Optimal Express Bus Routes Design with Limited-Stop Services for Long-Distance Commuters

2020 ◽  
Vol 12 (4) ◽  
pp. 1669 ◽  
Author(s):  
Hongguo Ren ◽  
Zhenbao Wang ◽  
Yanyan Chen
Keyword(s):  
Route Planning ◽  
Optimization Method ◽  
Route Optimization ◽  
Long Distance ◽  
Routing Problem ◽  
Fleet Size ◽  
Valid Instrument ◽  
Bus Service ◽  
New Perspective ◽  
Bus Services

This research aimed to propose a route optimization method for long-distance commuter bus service to improve the attraction of public transport as a sustainable travel mode. Taking the express bus services (EBS) in Changping Corridor in Beijing as an example, we put forward an EBS route-planning method for long-distance commuter based on a solving algorithm for vehicle routing problem with pickups and deliveries (VRPPD) to determine the length of routes, number of lines, and stop location. Mobile phone location (MPL) data served as a valid instrument for the origin–destination (OD) estimation, which provided a new perspective to identify the locations of homes and jobs. The OD distribution matrices were specified via geocoded MPL data. The optimization objective of the EBS is to minimize the total distance traveled by the lines, subject to maximum segment capacity constraints. The sensitivity analysis was done to several key factors (e.g., the segment capacity, vehicle capacity, and headway) influencing the number of lines, the length of routes. The results suggest that the scenario with the segment capacity of 4000 passengers/h has a minimum of number and length of lines, but we recommend that the transit agency adopt 3000 passengers/h as the route segment capacity because this scenario results in minimum fleet size and minimum total operation length.

A web-based route planning tool to reduce cyclists' exposures to traffic pollution: A case study in Montreal, Canada

2013 ◽  
Vol 123 ◽  
pp. 58-61 ◽  
Author(s):  
Marianne Hatzopoulou ◽  
Scott Weichenthal ◽  
Guillaume Barreau ◽  
Mark Goldberg ◽  
William Farrell ◽  
...  
Keyword(s):  
Route Planning ◽  
Traffic Pollution ◽  
Planning Tool ◽  
Web Based

Route Optimization of Aquatic Product Transportation Based on an Improved Ant Colony Algorithm

2020 ◽  
Vol 24 (4) ◽  
pp. 488-493
Author(s):  
Chenxiao Yu ◽  
Zuiyi Shen ◽  
Pengfei Li ◽  
◽  
◽  
...  
Keyword(s):  
Ant Colony Algorithm ◽  
Time Window ◽  
Route Planning ◽  
Ant Colony ◽  
Route Optimization ◽  
Routing Problem ◽  
Aquatic Products ◽  
Aquatic Product ◽  
To Receive ◽  
Improved Ant Colony Algorithm

In this paper, the time window in which aquatic products must be delivered and the uncertainty of road conditions that affect the time at which customers are able to receive the goods are added as constraints in the optimization model of the Vehicle Routing Problem. The use of pheromones in the original ant colony algorithm was improved, and the waiting factor was added into the state transition rules to limit the information range. The improved ant colony algorithm was used to simulate the model with the example of aquatic product transportation route planning in Zhoushan city. The results show that this algorithm can optimize the transportation and distribution routes of aquatic products more effectively.

scholarly journals Route Planning with Dynamic Information from the EPLOS System

2020 ◽  
Vol 14 (3) ◽  
pp. 332-337
Author(s):  
Michał Kłodawski ◽  
Marianna Jacyna ◽  
Rostislav Vasek ◽  
Piotr Klimek ◽  
Roland Jachimowski ◽  
...  
Keyword(s):  
Simulation Model ◽  
Data Base ◽  
Vehicle Routing ◽  
Vehicle Routing Problem ◽  
Route Planning ◽  
Route Optimization ◽  
Dynamic Information ◽  
Routing Problem ◽  
Vehicle Route ◽  
The Impact

The paper presents the problem of distribution route planning with dynamic information about sudden customers' needs. Particular attention was paid to dynamic vehicle route planning and its influence on the distance covered by a distribution vehicle. In the article, authors assume that the quick information about customers’ sudden needs is transferred from the EPLOS tool data base. Authors analyze the available literature on transport route optimization and propose a solution to the problem of distribution among customers with sudden needs. In order to present the impact of quick information influence on the distribution route minimization, a simulation model of the vehicle routing problem was generated in the FlexSim environment.

Sign in / Sign up

Export Citation Format

Share Document