Disasters such as earthquakes, typhoons, floods and COVID-19 continue to threaten the lives of people in all countries. In order to cover the basic needs of the victims, emergency logistics should be implemented in time. Location-routing problem (LRP) tackles facility location problem and vehicle routing problem simultaneously to obtain the overall optimization. In response to the shortage of relief materials in the early post-disaster stage, a multi-objective model for the LRP considering fairness is constructed by evaluating the urgency coefficients of all demand points. The objectives are the lowest cost, delivery time and degree of dissatisfaction. Since LRP is a NP-hard problem, a hybrid metaheuristic algorithm of Discrete Particle Swarm Optimization (DPSO) and Harris Hawks Optimization (HHO) is designed to solve the model. In addition, three improvement strategies, namely elite-opposition learning, nonlinear escaping energy, multi-probability random walk, are introduced to enhance its execution efficiency. Finally, the effectiveness and performance of the LRP model and the hybrid metaheuristic algorithm are verified by a case study of COVID-19 in Wuhan. It demonstrates that the hybrid metaheuristic algorithm is more competitive with higher accuracy and the ability to jump out of the local optimum than other metaheuristic algorithms.

Order distribution and routing optimization of takeout delivery is a challenging research topic in the field of e-commerce. In this paper, we propose a drone–rider joint delivery mode with multi-distribution center collaboration for the problems of limited-service range, unreasonable distribution, high delivery cost, and tight time windows in the takeout delivery process. The model is constructed with the minimum delivery cost and the overall maximum customer satisfaction as the objective function, and a two-stage heuristic algorithm is designed to solve the model. In the first stage, Euclidean distance is used to classify customers into the regions belonging to different distribution centers, and the affinity propagation (AP) clustering algorithm is applied to allocate orders from different distribution centers. The second stage uses an improved tabu search algorithm for route optimization based on specifying the number of rider and drone calls. This paper takes China’s Ele.me and Meituan takeout as the reference object and uses the Solomon data set for research. The experimental results show that compared with the traditional rider delivery mode, the drone–rider joint delivery mode with multiple distribution center collaboration can effectively reduce the number of riders used, lower the delivery cost, and improve the overall customer satisfaction.

The fourth-party logistics routing problem (4PLRP) is an important issue in the operation of fourth-party logistics (4PL). In this paper, the study of fourth-party logistics (4PL) path optimization considers that more third-party logistics (3PL) undertake transportation tasks. Under the condition that the 3PL transportation time, transportation cost, node transit time, and transit cost are uncertain, 4PL provides customers with a set of transportation solutions to transport transportation tasks from the initial node to the destination node according to the customer’s risk aversion preference. The transportation scheme not only meets the customer’s time and cost requirements but also meets the carrying capacity and reputation constraints of 3PL. Between the two nodes, one or more 3PLs will undertake the transportation task. The customer’s risk preference will be measured by the ratio utility theory (RUT). An ant colony system-improved grey wolf optimization (ACS-IGWO) is designed to solve the model, and the grey wolf optimization (GWO) is improved by the convergence factor and the proportional weight. Problem analysis is conducted through simulation experiments.

The meal delivery routing problem faced by the e-commerce platform is challenging. In order to reduce the logistics cost and meet the needs of customers, a multi-objective meal delivery routing problem is studied under the shared logistics services mode (SLSM). In the meal delivery problem, the third-party logistics providers need to arrange vehicles in the multi-depot to pick up meals from multiple food providers and deliver them to customers, so as to realize the sharing of logistics services between food providers and compare them with the traditional logistics service mode (TLSM). While realizing sharing, it is also necessary to meet customer time requirements as much as possible. In this case, a multi-objective mathematical model to minimize customer dissatisfaction and delivery cost is established, and the linear weighting method is employed to transform the model. An improved Ant Lion Optimizer (IALO) is proposed to solve the problem, and compared with other algorithms. The experiments verified the effectiveness of the proposed algorithm and show that SLSM can save logistics costs and meet customer needs more than TLSM, and provide certain reference opinions for the e-commerce platform.

IT outsourcing is an effective way to enhance the core competitiveness for many enterprises. But the schedule risk of IT outsourcing project may cause enormous economic loss to enterprise. In this paper, the Distributed Decision Making (DDM) theory and the principal‐agent theory are used to build a model for schedule risk management of IT outsourcing project. In addition, a hybrid algorithm combining simulated annealing (SA) and genetic algorithm (GA) is designed, namely, simulated annealing genetic algorithm (SAGA). The effect of the proposed model on the schedule risk management problem is analyzed in the simulation experiment. Meanwhile, the simulation results of the three algorithms GA, SA, and SAGA show that SAGA is the most superior one to the other two algorithms in terms of stability and convergence. Consequently, this paper provides the scientific quantitative proposal for the decision maker who needs to manage the schedule risk of IT outsourcing project.