The formation of a cooperative alliance is an effective means of approaching the vehicle routing optimization in two-echelon reverse logistics networks. Cooperative mechanisms can contribute to avoiding the inefficient assignment of resources for the recycling logistics operations and reducing long distance transportation. With regard to the relatively low performance of waste collection, this paper proposes a three-phase methodology to properly address the corresponding vehicle routing problem on two echelons. First, a bi-objective programming model is established to minimize the total cost and the number of vehicles considering semitrailers and vehicles sharing. Furthermore, the Clarke–Wright (CW) savings method and the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) are combined to design a hybrid routing optimization heuristic, which is denoted CW_NSGA-II. Routes on the first and second echelons are obtained on the basis of sub-optimal solutions provided by CW algorithm. Compared to other intelligent algorithms, CW_NSGA-II reduces the complexity of the multi-objective solutions search and mostly converges to optimality. The profit generated by cooperation among retail stores and the recycling hub in the reverse logistics network is fairly and reasonably distributed to the participants by applying the Minimum Costs-Remaining Savings (MCRS) method. Finally, an empirical study in Chengdu City, China, reveals the superiority of CW_NSGA over the multi-objective particle swarm optimization and the multi objective genetic algorithms in terms of solutions quality and convergence. Meanwhile, the comparison of MCRS method with the Shapley value model, equal profit method and cost gap allocation proves that MCRS method is more conducive to the stability of the cooperative alliance. In general, the implementation of cooperation in the optimization of the reverse logistics network effectively leads to the sustainable development of urban and sub-urban areas. Through the reasonable reorganization of the entire network, recycling companies can provide more reliable services, contribute to the reduction of environmental pollution, and guarantee significant profits. Thus, this paper provides manufacturing companies, logistics operators and local governments with tools to protect the environment, while still making profits.

Emergency decision-making (EDM) is of paramount importance, especially when the emergency occurs. The evolution nature of the emergency, such as multistage, uncertainty, dynamic, and information updating, has been playing a key role in the dynamic emergency decision-making process. However, most existing studies ignored the aforementioned nature. Our approach accounts for the dynamics inherent to a real emergency decision-making process and presents a multistage dynamic emergency decision-making (MSDEDM) procedure of a dynamic programming model based on decision-makers’ psychological reference satisfactory degree. Firstly, interval-valued trapezoidal intuitionistic fuzzy numbers (IVTrIFNs) are used to depict the relevant fuzziness and uncertainty of information. Secondly, by considering the dynamic evolution process of emergency and the decision-makers’ psychological reference expectation effect, the principle of MSDEDM approach is presented. Based on the analysis, the dynamic model on the new psychological reference satisfactory parameter formula is presented to obtain the optimal satisfaction and weight of each stage. Then, the value utility function based on the DMs’ risk attitude is proposed to obtain the comprehensive value of each emergency alternative for each stage and achieve the ranking results of each stage. Furthermore, a case study involving the transportation emergency decision-making problem demonstrates that the proposed method can achieve selection of the optimal alternatives for each stage, as well as adjustment of the alternatives for neighbouring stages. Finally, the comparative analysis and sensitivity analysis for the results are used to further verify the feasibility and practicability of the proposed method.

Energy supply is an important system that affects the overall efficiency of urban transportation. To improve the system operational efficiency and reduce costs, we formulate and solve a collaborative multidepot petrol station replenishment problem with multicompartments and time window assignment by establishing a mixed-integer linear programming model. The hybrid heuristic algorithm composed of genetic algorithm and particle swarm optimization is used as a solution, and then the Shapley value method is applied to analyze the profit allocation of each petrol depot under different coalitions. The optimal membership sequence of the cooperation is determined according to the strict monotone path. To analyze and verify the effectiveness of the proposed method, a regional petrol supply network in Chongqing city in China is investigated. Through cooperation between petrol depots in the supply network, the utilization of customer clustering, time window coordination, and distribution truck sharing can significantly reduce the total operation costs and improve the efficiency of urban transportation energy supply. This approach can provide theoretical support for relevant government departments and enterprises to make optimal decisions. The implementation of the joint distribution of energy can promote the sustainable development of urban transportation.

Logistics joint distribution network (LJDN) optimization involves vehicle routes scheduling and profit allocation for multiple distribution centers. This is essentially a combinational and cooperative game optimization problem seeking to serve a number of customers with a fleet of vehicles and allocate profit among multiple centers. LJDN routing optimization based on customer clustering units can alleviate the computational complexity and improve the calculation accuracy. In addition, the profit allocation mechanism can be realized based on cooperative game theory through a negotiation procedure by the Logistics Service Provider (LSP). This paper establishes a model to minimize the total cost of the multiple centers joint distribution network when each distribution center is assigned to serve a series of distribution units. An improved particle swarm optimization (PSO) algorithm is presented to tackle the model formulation by assigning distribution centers (DCs) to distribution units. Improved PSO algorithm combines merits of PSO algorithm and genetic algorithm (GA) with global and local search capabilities. Finally, a Shapley value model based on cooperative game theory is proposed to obtain the optimal profit allocation strategy among distribution centers from nonempty coalitions. The computational results from a case study in Guiyang city, China, suggest the optimal sequential coalition of distribution centers can be achieved according to Strictly Monotonic Path (SMP).

The advancement of artificial intelligence, the synonym of precision agriculture has approached the public’s vision, and the different requirements for air humidity in different growth periods of crops are proposed. The BP neural network optimized by particle swarm optimization algorithm is proposed to predict the air humidity of crops. Algorithm, this paper chooses BP algorithm network topology structure is 2-5-1, improves the inertia weight of PSO algorithm, proposes nonlinear inertia weight reduction strategy w = w s − ( w s − w e ) | f 1 t f | , trains BP algorithm with improved PSO algorithm, has no gradient information, jumps out local pole Value, reduce the number of iterations of the algorithm, and speed up the training speed of the neural network. According to the experimental results of MATLAB simulation, the air humidity prediction model of particle swarm optimization neural network is constructed, which proves the effectiveness of the improved particle swarm neural network prediction system. It can be shown that the proposed algorithm has a relative error of at least 0.0134 compared with other algorithms.