Data Mining - Concepts and Techniques.

On the truck dispatching problem

Unmanned aerial vehicles, or drones, have the potential to significantly reduce the cost and time of making last-mile deliveries and responding to emergencies. Despite this potential, little work has gone into developing vehicle routing problems (VRPs) specifically for drone delivery scenarios. Existing VRPs are insufficient for planning drone deliveries: either multiple trips to the depot are not permitted, leading to solutions with excess drones, or the effect of battery and payload weight on energy consumption is not considered, leading to costly or infeasible routes. We propose two multitrip VRPs for drone delivery that address both issues. One minimizes costs subject to a delivery time limit, while the other minimizes the overall delivery time subject to a budget constraint. We mathematically derive and experimentally validate an energy consumption model for multirotor drones, demonstrating that energy consumption varies approximately linearly with payload and battery weight. We use this approximation to derive mixed integer linear programs for our VRPs. We propose a cost function that considers our energy consumption model and drone reuse, and apply it in a simulated annealing (SA) heuristic for finding suboptimal solutions to practical scenarios. To assist drone delivery practitioners with balancing cost and delivery time, the SA heuristic is used to show that the minimum cost has an inverse exponential relationship with the delivery time limit, and the minimum overall delivery time has an inverse exponential relationship with the budget. Numerical results confirm the importance of reusing drones and optimizing battery size in drone delivery VRPs.

Vehicle Routing Problems for Drone Delivery

Green Logistics has emerged as the new agenda item in supply chain management. The traditional objective of distribution management has been upgraded to minimizing system-wide costs related to economic and environmental issues. Reflecting the environmental sensitivity of vehicle routing problems (VRP), an extensive literature review of Green Vehicle Routing Problems (GVRP) is presented. We provide a classification of GVRP that categorizes GVRP into Green-VRP, Pollution Routing Problem, VRP in Reverse Logistics, and suggest research gaps between its state and richer models describing the complexity in real-world cases. The purpose is to review the most up-to-date state-of-the-art of GVRP, discuss how the traditional VRP variants can interact with GVRP and offer an insight into the next wave of research into GVRP. It is hoped that OR/MS researchers together with logistics practitioners can be inspired and cooperate to contribute to a sustainable industry.

Survey of Green Vehicle Routing Problem: Past and future trends

An effective way for managing and controlling a large number o f inventory items or stock keeping units (SKUs) is the inventory classification. Tradi tional ABC analysis which based on only a single criterion is commonly used for classification of SKU s. However, we should consider inven- tory classification as a multi-criteria problem in practice . In this study, a new method of Evaluation based on Distance from Average Solution (EDAS) is introduced for multi-criteria inventory clas- sification (MCIC) problems. In the proposed method, we use po sitive and negative distances from the average solution for appraising alternatives (SKUs). To represent performance of the proposed method in MCIC problems, we use a common example with 47 SKUs. Comparing the results of the proposed method with some existing methods shows the good performance of it in ABC classifica- tion. The proposed method can also be used for multi-criteria decision-making (MCDM) problems. A comparative analysis is also made for showing the validity and stability of the proposed method in MCDM problems. We compare the proposed method with VIKOR, TOPSIS, SAW and COPRAS methods using an example. Seven sets of criteria weights and Spearman's correlation coefficient are used for this analysis. The results show that the proposed method is stable in different weights and well consistent with the other methods.

/pdf/multi-criteria-inventory-classification-using-a-new-method-5220ny8i4c.pdf

Multi-Criteria Inventory Classification Using a New Method of Evaluation Based on Distance from Average Solution (EDAS)

Development of a fuel consumption optimization model for the capacitated vehicle routing problem

The green vehicle routing and scheduling problem (GVRSP) aims to minimize green-house gas emissions in logistics systems through better planning of deliveries/pickups made by a fleet of vehicles. We define a new mixed integer liner programming (MIP) model which considers heterogeneous vehicles, time-varying traffic congestion, customer/vehicle time window constraints, the impact of vehicle loads on emissions, and vehicle capacity/range constraints in the GVRSP. The proposed model allows vehicles to stop on arcs, which is shown to reduce emissions up to additional 8% on simulated data. A hybrid algorithm of MIP and iterated neighborhood search is proposed to solve the problem.

The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion

A genetic algorithm with exact dynamic programming for the green vehicle routing & scheduling problem

The outcomes of hypertension refer to the death or serious complications (such as myocardial infarction or stroke) that may occur in patients with hypertension. The outcomes of hypertension are very concerning for patients and doctors, and are ideally avoided. However, there is no satisfactory method for predicting the outcomes of hypertension. Therefore, this paper proposes a prediction method for outcomes based on physical examination indicators of hypertension patients. In this work, we divide the patients’ outcome prediction into two steps. The first step is to extract the key features from the patients’ many physical examination indicators. The second step is to use the key features extracted from the first step to predict the patients’ outcomes. To this end, we propose a model combining recursive feature elimination with a cross-validation method and classification algorithm. In the first step, we use the recursive feature elimination algorithm to rank the importance of all features, and then extract the optimal features subset using cross-validation. In the second step, we use four classification algorithms (support vector machine (SVM), C4.5 decision tree, random forest (RF), and extreme gradient boosting (XGBoost)) to accurately predict patient outcomes by using their optimal features subset. The selected model prediction performance evaluation metrics are accuracy, F1 measure, and area under receiver operating characteristic curve. The 10-fold cross-validation shows that C4.5, RF, and XGBoost can achieve very good prediction results with a small number of features, and the classifier after recursive feature elimination with cross-validation feature selection has better prediction performance. Among the four classifiers, XGBoost has the best prediction performance, and its accuracy, F1, and area under receiver operating characteristic curve (AUC) values are 94.36%, 0.875, and 0.927, respectively, using the optimal features subset. This article’s prediction of hypertension outcomes contributes to the in-depth study of hypertension complications and has strong practical significance.

/pdf/a-machine-learning-based-prediction-method-for-hypertension-4enoghnbsd.pdf

A Machine-Learning-Based Prediction Method for Hypertension Outcomes Based on Medical Data.

Electric vehicles (EVs) are witnessing a surge in demand and production for their environmental benefits. This study reviews the development of electric vehicle routing problem (EVRP) in transport logistics. The review found that few existing EVRP models considered integrally the unique characteristics of EVs, such as the nonlinear charging function, nonlinear electricity-consumption function, and dynamic driving ranges. This study develops a new comprehensive model of the EVRP that considers a general energy/electricity consumption function for EVs that factor in energy losses (aerodynamic, tire friction, drivetrain, ancillary, and kinetic/potential losses), nonlinear charging function with the piecewise linearization technique, efficient visits to charge stations, and continuous decision variables for speed, payload, travel time, recharging, etc. The newly developed model is much closer to reality by integrating most of the unique characteristics of EVs known so far, and therefore it advances the state-of-the-art in EVRP. Computational experiments on Solomon's instances were done to exhibit the effectiveness and efficiency of the developed model under the effects of air conditioner, battery capacity, and travel speed. These experiments demonstrated that the model can obtain more practical logistics plans for an EV fleet with a lower total emissions cost and higher energy utilization.

Yiyong Xiao

Papers

Development of a fuel consumption optimization model for the capacitated vehicle routing problem

The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion

A genetic algorithm with exact dynamic programming for the green vehicle routing & scheduling problem

A Machine-Learning-Based Prediction Method for Hypertension Outcomes Based on Medical Data.

Electric vehicle routing problem: A systematic review and a new comprehensive model with nonlinear energy recharging and consumption