The implementation of Industry 5.0 necessitates a decrease in the energy consumption of industrial robots. This research investigates energy optimization for optimal motion planning for a dual-arm industrial robot. The objective function for the energy minimization problem is stated based on the execution time and total energy consumption of the robot arm configurations in its workspace for pick-and-place operation. Firstly, the PID controller is being used to achieve the optimal parameters. The parameters of PID are then fine-tuned using metaheuristic algorithms such as Genetic Algorithms and Particle Swarm Optimization methods to create a more precise robot motion trajectory, resulting in an energy-efficient robot configuration. The results for different robot configurations were compared with both motion planning algorithms, which shows better compatibility in terms of both execution time and energy efficiency. The feasibility of the algorithms is demonstrated by conducting experiments on a dual-arm robot, named as duAro. In terms of energy efficiency, the results show that dual-arm motions can save more energy than single-arm motions for an industrial robot. Furthermore, combining the robot configuration problem with metaheuristic approaches saves energy consumption and robot execution time when compared to motion planning with PID controllers alone.
The government plays a critical role in the promotion of recycling strategy among supply chain members. The purpose of this study is to investigate the optimal government policies on closed-loop supply chains and how these policies impact the market demand and the returning strategies of manufacturers and retailers. This paper presents a design of closed-loop supply chains under government regulation by considering a novel three-stage game theoretic model. Firstly, Stackelberg models are adopted to describe the one-shot game between the manufacturer and the retailer in a local market. Secondly, based on the Stackelberg equilibriums, a repeated and dynamic population game is developed. Thirdly, the government analyzes the population game to find the optimal tax and subsidy policies in the whole market. To solve the proposed model, the idea of backward induction is adopted. The results suggest that, by collecting tax and allocating subsidy, the government can influence the market demands and return rates. The centralized supply chain structure is always preferred for the government and the market. The government prefers to allocate subsidy to low-pollution, low-profit remanufactured products. The environmental attention of the government affects the subsidy policy.
Supply chain digital twin has emerged as a powerful tool in studying the behavior of an actual supply chain. However, most studies in the field of supply chain digital twin have only focused on what-if analysis that compares several different scenarios. This study proposes a data-driven evolutionary algorithm to efficiently solve the service constrained inventory optimization problem using historical data that generated by supply chain digital twins. The objective is to minimize the total costs while satisfying the required service level for a supply chain. The random forest algorithm is used to build surrogate models which can be used to estimate the total costs and service level in a supply chain. The surrogate models are optimized by an ensemble approach-based differential evolution algorithm which can adaptively use different search strategies to improve the performance during the computation process. A three-echelon supply chain digital twin on the geographic information system (GIS) map in real-time is used to examine the efficiency of the proposed method. The experimental results indicate that the data-driven evolutionary algorithm can reduce the total costs and maintain the required service level. The finding suggests that our proposed method can learn from the historical data and generate better inventory policies for a supply chain digital twin.
Perishable goods have a limited shelf life, and inventory should be discarded once it exceeds its shelf life. Finding optimal inventory management policies is essential since inefficient policies can lead to increased waste and higher costs. While many previous studies assume the perishable inventory is processed following the First In, First Out rule, it does not reflect customer purchasing behavior. In practice, customers’ preferences are influenced by the shelf life and price of products. This study optimizes inventory and pricing policies for a perishable inventory management problem considering age-dependent probabilistic demand. However, introducing dynamic pricing significantly increases the complexity of the problem. To tackle this challenge, we propose eliminating irrational actions in dynamic programming without sacrificing optimality. To solve this problem more efficiently, we also implement a deep reinforcement learning algorithm, proximal policy optimization, to solve this problem. The results show that dynamic programming with action reduction achieved an average of 63.1% reduction in computation time compared to vanilla dynamic programming. In most cases, proximal policy optimization achieved an optimality gap of less than 10%. Sensitivity analysis of the demand model revealed a negative correlation between customer sensitivity to shelf lives or prices and total profits.