A Multiproduct Single-Period Inventory Management Problem under Variable Possibility Distributions

In multiproduct single-period inventory management problem (MSIMP), the optimal order quantity often depends on the distributions of uncertain parameters. However, the distribution information about uncertain parameters is usually partially available. To model this situation, a MSIMP is studied by credibilistic optimization method, where the uncertain demand and carbon emission are characterized by variable possibility distributions. First, the uncertain demand and carbon emission are characterized by generalized parametric interval-valued (PIV) fuzzy variables, and the analytical expressions about the mean values and second-order moments of selection variables are established. Taking second-order moment as a risk measure, a new credibilistic multiproduct single-period inventory management model is developed under mean-moment optimization criterion. Furthermore, the proposed model is converted to its equivalent deterministic model. Taking advantage of the structural characteristics of the deterministic model, a domain decomposition method is designed to find the optimal order quantities. Finally, a numerical example is provided to illustrate the efficiency of the proposed mean-moment credibilistic optimization method. The computational results demonstrate that a small perturbation of the possibility distribution can make the nominal optimal solution infeasible. In this case, the decision makers should employ the proposed credibilistic optimization method to find the optimal order quantities

Research on Intelligent Guidance Optimal Path of Shared Car Charging in the IOT Environment

In recent years, with the improvement of Internet of Things (IOT) technology, a “shared” service concept has appeared in people’s life. In the limited available resources, it is of great value to study the optimal path of charging pile selection for shared cars. With the help of Internet of Things technology and through analyzing the collected data, this paper introduces three path optimization methods, the Dijkstra algorithm, heuristic algorithm A∗, and improved particle swarm optimization (PSO) algorithm; establishes relevant convergence conditions; and takes the actual path cost as the criterion to judge the optimal path. In addition, this paper studies the optimal path from the shared car to the charging pile. Through the simulation experiment, the results show that compared with the traditional optimal path algorithm, the improved particle swarm optimization algorithm has strong parallelism and better search effect for optimal path selection in the case of large number of traffic path nodes and complex paths, which fully reflects the performance advantage of the algorithm