Unmanned Aerial Vehicle Inspection Routing and Scheduling for Engineering Management

Technological advancements in unmanned aerial vehicles(UAVs)have revolutionized various industries,enabling the widespread adoption of UAV-based solutions.In engineering management,UAV-based inspection has emerged as a highly efficient method for identifying hidden risks in high-risk construction environments,surpassing traditional inspection techniques.Building on this foundation,this paper delves into the optimization of UAV inspection routing and scheduling,addressing the complexity introduced by factors such as no-fly zones,monitoring-interval time windows,and multiple monitoring rounds.To tackle this challenging problem,we propose a mixed-integer linear programming(MILP)model that optimizes inspection task assignments,monitoring sequence schedules,and charging decisions.The comprehensive consideration of these factors differentiates our problem from conventional vehicle routing problem(VRP),leading to a mathematically intractable model for commercial solvers in the case of large-scale instances.To overcome this limitation,we design a tailored variable neighborhood search(VNS)metaheuristic,customizing the algorithm to efficiently solve our model.Extensive numerical experiments are conducted to validate the efficacy of our proposed algorithm,demonstrating its scalability for both large-scale and real-scale instances.Sensitivity experiments and a case study based on an actual engineering project are also conducted,providing valuable insights for engineering managers to enhance inspection work efficiency.

Rolling horizon scheduling algorithm for dynamic vehicle scheduling system

Dynamic exclusive pickup and delivery problem with time windows (DE-PDPTW), aspecial dynamic vehicle scheduling problem, is proposed. Its mathematical description is given andits static properties are analyzed, and then the problem is simplified asthe asymmetrical travelingsalesman problem with time windows. The rolling horizon scheduling algorithm (RHSA) to solve thisdynamic problem is proposed. By the rolling of time horizon, the RHSA can adapt to the problem'sdynamic change and reduce the computation time by dealing with only part of the customers in eachrolling time horizon. Then, its three factors, the current customer window, the scheduling of thecurrent customer window and the rolling strategy, are analyzed. The test results demonstrate theeffectiveness of the RHSA to solve the dynamic vehicle scheduling problem.

Optimization for vehicle scheduling in iron and steel works based on semi-trailer swap transport

In order to solve internal logistics problems of iron and steel works,such as low transportation efficiency of vehicles and high transportation cost,the production process and traditional transportation style of iron and steel works were introduced.The internal transport tasks of iron and steel works were grouped based on cluster analysis according to demand time of the transportation.An improved vehicle scheduling model of semi-trailer swap transport among loading nodes and unloading nodes in one task group was set up.The algorithm was designed to solve the vehicle routing problem with simultaneous pick-up and delivery(VRPSPD) problem based on semi-trailer swap transport.A solving program was written by MATLAB software and the method to figure out the optimal path of each grouping was obtained.The dropping and pulling transportation plan of the tractor was designed.And an example of semi-trailer swap transport in iron and steel works was given.The results indicate that semi-trailer swap transport can decrease the numbers of vehicles and drivers by 54.5% and 88.6% respectively compared with decentralized scheduling in iron and steel works,and the total distance traveled reduces by 43.5%.The semi-trailer swap transport can help the iron and steel works develop the production in intension.

Simultaneous scheduling of machines and automated guided vehicles in flexible manufacturing systems using genetic algorithms

The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain independent general purpose GA was used,which was an add-in to the spreadsheet software.An adaptation of the propritary GA software was demonstrated to the problem of minimizing the total completion time or makespan for simultaneous scheduling of machines and vehicles in flexible manufacturing systems.Computational results are presented for a benchmark with 82 test problems,which have been constructed by other researchers.The achieved results are comparable to the previous approaches.The proposed approach can be also applied to other problems or objective functions without changing the GA routine or the spreadsheet model.

Study on scheduling algorithm for multiple handling requests of single automated guided vehicles

To solve the problem of small amount of machining centers in small and medium flexible manufacture systems(FMS), a scheduling mode of single automated guided vehicle(AGV) is adopted to deal with multiple transport requests in this paper. Firstly, a workshop scheduling mechanism of AGV is analyzed and a mathematical model is established using Genetic Algorithm. According to several sets of transport priority of AGV, processes of FMS are encoded, and fitness function, selection, crossover, and variation methods are designed. The transport priority which has the least impact on scheduling results is determined based on the simulation analysis of Genetic Algorithm, and the makespan, the longest waiting time, and optimal route of the car are calculated. According to the actual processing situation of the workshop, feasibility of this method is verified successfully to provide an effective solution to the scheduling problem of single AGV.

Improved Ant Colony Algorithm for Vehicle Scheduling Problem in Airport Ground Service Support

Support vehicles are part of the main body of airport ground operations,and their scheduling efficiency directly impacts flight delays.A mathematical model is constructed and the responsiveness of support vehicles for current operational demands is proposed to study optimization algorithms for vehicle scheduling.The model is based on the constraint relationship of the initial operation time,time window,and gate position distribution,which gives an improvement to the ant colony algorithm(ACO).The impacts of the improved ACO as used for support vehicle optimization are compared and analyzed.The results show that the scheduling scheme of refueling trucks based on the improved ACO can reduce flight delays caused by refueling operations by 56.87%,indicating the improved ACO can improve support vehicle scheduling.Besides,the improved ACO can jump out of local optima,which can balance the working time of refueling trucks.This research optimizes the scheduling scheme of support vehicles under the existing conditions of airports,which has practical significance to fully utilize ground service resources,improve the efficiency of airport ground operations,and effectively reduce flight delays caused by ground service support.

The Information Modeling and Intelligent Optimization Method for Logistics Vehicle Routing and Scheduling with Multi-objective and Multi-constraint

The vehicle routing and scheduling (VRS) problem with multi-objective and multi-constraint is analyzed, considering the complexity of the modern logistics in city economy and daily life based on the system engineering. The objective and constraint includes loading, the dispatch and arrival time, transportation conditions,total cost,etc. An information model and a mathematical model are built,and a method based on knowledge and biologic immunity is put forward for optimizing and evaluating the programs dimensions in vehicle routing and scheduling with multi-objective and multi-constraints. The proposed model and method are illustrated in a case study concerning a transport network, and the result shows that more optimization solutions can be easily obtained and the method is efficient and feasible. Comparing with the standard GA and the standard GA without time constraint,the computational time of the algorithm is less in this paper. And the probability of gaining optimal solution is bigger and the result is better under the condition of multi-constraint.

Shift scheduling strategy development for parallel hybrid construction vehicles

The shift scheduling system of the transmission has an important effect on the dynamic and economic performance of hybrid vehicles. In this work, shift scheduling strategies are developed for parallel hybrid construction vehicles. The effect of power distribution and direction on shift characteristics of the parallel hybrid vehicle with operating loads is evaluated, which must be considered for optimal shift control. A power distribution factor is defined to accurately describe the power distribution and direction in various parallel hybrid systems. This paper proposes a Levenberg-Marquardt algorithm optimized neural network shift scheduling strategy. The methodology contains two objective functions, it is a dynamic combination of a dynamic shift schedule for optimal vehicle acceleration, and an energy-efficient shift schedule for optimal powertrain efficiency. The study is performed on a test bench under typical operating conditions of a wheel loader. The experimental results show that the proposed strategies offer effective and competitive shift performance.

Large-Scale Vehicle Platooning:Advances and Challenges in Scheduling and Planning Techniques

Through vehicle-to-vehicle(V2V)communication,autonomizing a vehicle platoon can significantly reduce the distance between vehicles,thereby reducing air resistance and improving road traffic efficiency.The gradual maturation of platoon control technology is enabling vehicle platoons to achieve basic driving functions,thereby permitting large-scale vehicle platoon scheduling and planning,which is essential for industrialized platoon applications and generates significant economic benefits.Scheduling and planning are required in many aspects of vehicle platoon operation;here,we outline the advantages and challenges of a number of the most important applications,including platoon formation scheduling,lane-change planning,passing traffic light scheduling,and vehicle resource allocation.This paper’s primary objective is to integrate current independent platoon scheduling and planning techniques into an integrated architecture to meet the demands of large-scale platoon applications.To this end,we first summarize the general techniques of vehicle platoon scheduling and planning,then list the primary scenarios for scheduling and planning technique application,and finally discuss current challenges and future development trends in platoon scheduling and planning.We hope that this paper can encourage related platoon researchers to conduct more systematic research and integrate multiple platoon scheduling and planning technologies and applications.

Optimized vehicle scheduling and filling model based on effective space and integrated solving algorithm

We established an integrated and optimized model of vehicle scheduling problem and vehicle filling problem for solving an extremely complex delivery mode-multi-type vehicles, non-full loads, pickup and delivery in logistics and delivery system. The integrated and optimized model is based on our previous research result-effective space method. An integrated algorithm suitable for the integrated and optimized model was proposed and corresponding computer programs were designed to solve practical problems. The results indicates the programs can work out optimized delivery routes and concrete loading projects. The model and algorithm have many virtues and are valuable in practice.

MULTITASK SCHEDULING IN NETWORKED CONTROL SYSTEMS WITH APPLICATION TO LARGE SCALE VEHICLE CONTROL

Aiming at scheduling problems of networked control system （NCS） used to fulfill motion synthesis and cooperation control of the distributed multi-mechatronic systems, the differences of network scheduling and task scheduling are compared, and the mathematic description of task scheduling is presented. A performance index function of task scheduling of NCS according to task balance and traffic load matching principles is defined. According to this index, a static scheduling method is designed and implemented to controlling task set simulation of the DCY100 transportation vehicle. The simulation results are applied successfully to practical engineering in this case so as to validate the effectiveness of the proposed performance index and scheduling algorithm.

Economical Aspects of the Vehicle Scheduling Optimization

The paper deals with the vehicle scheduling problem related to regional public transport. Linear programming methods are used to solve the problem. A mathematical model is created including the constraints and the objective function minimizing costs and the number of vehicles. A minimum costs and a number of vehicles are forced at the same time by special economical input data analysis and an allocation of costs. Determining of the costs coefficients is done by three methods, which differs primarily by how much of the total costs they take into account. The decomposition of the set of lines into disjoint subsets can be used instead of the ＂direct＂ optimization. The decomposition has proven to be a suitable alternative in solving large optimization problems. The problem was applied to optimize vehicle scheduling in the region, which is situated in the north-east of the Czech Republic. There is used Xpress-IVE software, which solve the problem by simplex algorithm and branch and bound method. Research results show that there are large reserves in the organization of public transport. The implementation of the new vehicle scheduling would bring significant costs reductions in amount of at least 10% for the optimal solution and in amount of about 10% for the decomposition solution. The number of drivers could be decreased and the total time of the vehicles being outside the garage could be also reduced by at least 10%.

Automatic Driving Material Handling Vehicle Station Location and Scheduling Mathematical Modeling and Analysis

Traditional material handling vehicles often use internal combustion engines as their power source, which results in exhaust emissions that pollute the environment. In contrast, automated material handling vehicles have the advantages of zero emissions, low noise, and low vibration, thus avoiding exhaust pollution and providing a more comfortable working environment for operators. In order to achieve the goals of “peaking carbon emissions by 2030 and achieving carbon neutrality by 2060”, the use of environmentally friendly autonomous material handling vehicles for material transportation is an inevitable trend. To maximize the amount of transported materials, consider peak-to-valley electricity pricing, battery pack procurement, and the construction of charging and swapping stations while achieving “minimum daily transportation volume” and “lowest investment and operational cost over a 3-year settlement period” with the shortest overall travel distance for all material handling vehicles, this paper examines two different scenarios and establishes goal programming models. The appropriate locations for material handling vehicle swapping stations and vehicle battery pack scheduling schemes are then developed using the NSGA-II algorithm and ant colony optimization algorithm. The results show that, while ensuring a daily transportation volume of no less than 300 vehicles, the lowest investment and operational cost over a 3-year settlement period is approximately 24.1 million Yuan. The material handling vehicles follow the shortest path of 119.2653 km passing through the designated retrieval points and have two shortest routes. Furthermore, the advantages and disadvantages of the proposed models are analyzed, followed by an evaluation, deepening, and potential extension of the models. Finally, future research directions in this field are suggested.

A Heuristic Method for Vehicle Scheduling Problems

This paper presents a sequential optimum algorithm for vehicle schedulingproblem, which includes obtaining initial theoretical solution, adjustingsolution, forming initial routes and adjustins routes. This method can beapplied to general transportation problems with multiple depots and multiplevehicle types on complex network. In comparison with manual scheduling ofChengdu Transportation Company II, the result shows that this method isreasonable, feasible and applicable.

Study on shift schedule saving energy of automatic transmission of ground vehicles

To improve ground vehicle efficiency, shift schedule energy saving was proposed for the ground vehicle automatic transmission by studying the function of the torque converter and transmission in the vehicular drivetrain. The shift schedule can keep the torque converter working in the high efficiency range under all the working conditions except in the low efficiency range on the left when the transmission worked at the lowest shift, and in the low efficiency range on the right when the transmission worked at the highest shift. The shift quality key factors were analysed. The automatic trans-mission's bench-test adopting this shift schedule was made on the automatic transmission's test-bed. The experimental results showed that the shift schedule was correct and that the shift quality was controllable.

AGV Scheduling Optimization of Automated Port Based on Disruption Management

The recent rapid development of China’s foreign trade has led to the significant increase in waterway transportation and automated container ports. Automated terminals can significantly improve the loading and unloading efficiency of container terminals. These terminals can also increase the port’s transportation volume while ensuring the quality of cargo loading and unloading, which has become an inevitable trend in the future development of ports. However, the continuous growth of the port’s transportation volume has increased the horizontal transportation pressure on the automated terminal, and the problems of route conflicts and road locks faced by automated guided vehicles (AGV) have become increasingly prominent. Accordingly, this work takes Xiamen Yuanhai automated container terminal as an example. This work focuses on analyzing the interference problem of path conflict in its horizontal transportation AGV scheduling. Results show that path conflict, the most prominent interference factor, will cause AGV scheduling to be unable to execute the original plan. Consequently, the disruption management was used to establish a disturbance recovery model, and the Dijkstra algorithm for combining with time windows is adopted to plan a conflict-free path. Based on the comparison with the rescheduling method, the research obtains that the deviation of the transportation path and the deviation degree of the transportation path under the disruption management method are much lower than those of the rescheduling method. The transportation path deviation degree of the disruption management method is only 5.56%. Meanwhile, the deviation degree of the transportation path under the rescheduling method is 44.44%.

Generation and Analysis of Hybrid-Electric Vehicle Transmission Shift Schedules with a Torque Split Algorithm

The increased concern over global climate change and lack of long-term sustainability of fossil fuels in the projected future has prompted further research into advanced alternative fuel vehicles to reduce vehicle emissions and fuel consumption. One of the primary advanced vehicle research areas involves electrification and hybridization of vehicles. As hybrid-electric vehicle technology has advanced, so has the need for more innovative control schemes for hybrid vehicles, including the development and optimization of hybrid powertrain transmission shift schedules. The hybrid shift schedule works in tandem with a cost function-based torque split algorithm that dynamically determines the optimal torque command for the electric motor and engine. The focus of this work is to develop and analyze the benefits and limitations of two different shift schedules for a position-3 (P3) parallel hybrid-electric vehicle. a traditional two-parameter shift schedule that operates as a function of vehicle accelerator position and vehicle speed (state of charge (SOC) independent shift schedule), and a three-parameter shift schedule that also adapts to fluctuations in the state of charge of the high voltage batteries (SOC dependent shift schedule). The shift schedules were generated using an exhaustive search coupled with a fitness function to evaluate all possible vehicle operating points. The generated shift schedules were then tested in the software-in-the-loop (SIL) environment and the vehicle-in-the-loop (VIL) environment and compared to each other, as well as to the stock 8L45 8-speed transmission shift schedule. The results show that both generated shift schedules improved upon the stock transmission shift schedule used in the hybrid powertrain comparing component efficiency, vehicle efficiency, engine fuel economy, and vehicle fuel economy.

Adaptive augmentation of gain-scheduled controller for aerospace vehicles

This paper proposes an adaptive augmentation control design approach of the gain-scheduled controller.This extension is motivated by the need for augmentation of the baseline gainscheduled controller.The proposed approach can be utilized to design flight control systems for advanced aerospace vehicles with a large parameter variation.The flight dynamics within the flight envelope is described by a switched nonlinear system,which is essentially a switched polytopic system with uncertainties.The flight control system consists of a baseline gain-scheduled controller and a model reference adaptive augmentation controller,while the latter can recover the nominal performance of the gainscheduled controlled system under large uncertainties.By the multiple Lyapunov functions method,it is proved that the switched nonlinear system is uniformly ultimately bounded.To validate the effectiveness of the proposed approach,this approach is applied to a generic hypersonic vehicle,and the simulation results show that the system output tracks the command signal well even when large uncertainties exist.

Polytopic LPV modeling and gain-scheduled switching control for a flexible air-breathing hypersonic vehicle

A novel gain-scheduled switching control method for the longitudinal motion of a flexible air-breathing hypersonic vehicle （FAHV） is proposed. Firstly, velocity and altitude are selected as scheduling variables, a polytopic linear parameter varying （LPV） model is developed to represent the complex nonlinear longitudinal dynamics of the FAHV. Secondly, based on the obtained polytopic LPV model, the flight envelope is divided into four smaller subregions, and four gain-scheduled controllers are designed for these parameter subregions. Then, by the defined switching characteristic function, these gain-scheduled controllers are switched in order to guarantee the closed-loop FAHV system to be asymptotically stable and satisfy a given tracking error performance criterion. The condition of gain-scheduled switching controller synthesis is given in terms of linear matrix inequalities （LMIs） which can be easily solved by using standard software packages. Finally, simulation results show the effectiveness of the presented method.

Electric vehicle optimal scheduling method considering charging piles matching based on edge intelligence

To adress the problems of insufficient consideration of charging pile resource limitations,discrete-time scheduling methods that do not meet the actual demand and insufficient descriptions of peak-shaving response capability in current electric vehicle(EV)opti-mization scheduling,edge intelligence-oriented electric vehicle optimization scheduling and charging station peak-shaving response capability assessment methods are proposed on the basis of the consideration of electric vehicle and charging pile matching.First,an edge-intelligence-oriented electric vehicle regulation frame for charging stations is proposed.Second,continuous time variables are used to represent the available charging periods,establish the charging station controllable EV load model and the future available charging pile mathematical model,and establish the EV and charging pile matching matrix and constraints.Then,with the goal of maximizing the user charging demand and reducing the charging cost,the charging station EV optimal scheduling model is established,and the EV peak response capacity assessment model is further established by considering the EV load shifting constraints under different peak response capacities.Finally,a typical scenario of a real charging station is taken as an example for the analysis of optimal EV scheduling and peak shaving response capacity,and the proposed method is compared with the traditional method to verify the effectiveness and practicality of the proposed method.