An Improved Harris Hawk Optimization Algorithm for Flexible Job Shop Scheduling Problem

Flexible job shop scheduling problem(FJSP)is the core decision-making problem of intelligent manufacturing production management.The Harris hawk optimization(HHO)algorithm,as a typical metaheuristic algorithm,has been widely employed to solve scheduling problems.However,HHO suffers from premature convergence when solving NP-hard problems.Therefore,this paper proposes an improved HHO algorithm(GNHHO)to solve the FJSP.GNHHO introduces an elitism strategy,a chaotic mechanism,a nonlinear escaping energy update strategy,and a Gaussian random walk strategy to prevent premature convergence.A flexible job shop scheduling model is constructed,and the static and dynamic FJSP is investigated to minimize the makespan.This paper chooses a two-segment encoding mode based on the job and the machine of the FJSP.To verify the effectiveness of GNHHO,this study tests it in 23 benchmark functions,10 standard job shop scheduling problems(JSPs),and 5 standard FJSPs.Besides,this study collects data from an agricultural company and uses the GNHHO algorithm to optimize the company’s FJSP.The optimized scheduling scheme demonstrates significant improvements in makespan,with an advancement of 28.16%for static scheduling and 35.63%for dynamic scheduling.Moreover,it achieves an average increase of 21.50%in the on-time order delivery rate.The results demonstrate that the performance of the GNHHO algorithm in solving FJSP is superior to some existing algorithms.

Two-stage stochastic programming with robust constraints for the logistics network post-disruption response strategy optimization

Logistics networks (LNs) are essential for the transportation and distribution of goods or services from suppliers to consumers. However, LNs with complex structures are more vulnerable to disruptions due to natural disasters and accidents. To address the LN post-disruption response strategy optimization problem, this study proposes a novel two-stage stochastic programming model with robust delivery time constraints. The proposed model jointly optimizes the new-line-opening and rerouting decisions in the face of uncertain transport demands and transportation times. To enhance the robustness of the response strategy obtained, the conditional value at risk (CVaR) criterion is utilized to reduce the operational risk, and robust constraints based on the scenario-based uncertainty sets are proposed to guarantee the delivery time requirement. An equivalent tractable mixed-integer linear programming reformulation is further derived by linearizing the CVaR objective function and dualizing the infinite number of robust constraints into finite ones. A case study based on the practical operations of the JD LN is conducted to validate the practical significance of the proposed model. A comparison with the rerouting strategy and two benchmark models demonstrates the superiority of the proposed model in terms of operational cost, delivery time, and loading rate.

Stochastic Joint Replenishment Optimization under Joint Inbound Operational Cost

With e-commerce concentrating retailers and customers onto one platform,logistics companies(e.g.,JD Logistics)have launched integrated supply chain solutions for corporate customers(e.g.,online retailers)with warehousing,transportation,last-mile delivery,and other value-added services.The platform’s concentration of business flows leads to the consolidation of logistics resources,which allows us to coordinate supply chain operations across different corporate customers.This paper studies the stochastic joint replenishment problem of coordinating multiple suppliers and multiple products to gain the economies of scale of the replenishment setup cost and the warehouse inbound operational cost.To this end,we develop stochastic joint replenishment models based on the general-integer policy(SJRM-GIP)for the multi-supplier and multi-product problems and further reformulate the resulted nonlinear optimization models into equivalent mixed integer second-order conic programs(MISOCPs)when the inbound operational cost takes the square-root form.Then,we propose generalized Benders decomposition(GBD)algorithms to solve the MISOCPs by exploiting the Lagrangian duality,convexity,and submodularity of the sub-problems.To reduce the computational burden of the SJRM-GIP,we further propose an SJRM based on the power-of-two policy and extend the proposed GBD algorithms.Extensive numerical experiments based on practical datasets show that the stochastic joint replenishment across multiple suppliers and multiple products would deliver 13∼20%cost savings compared to the independent replenishment benchmark,and on average the proposed GBD algorithm based on the enhanced gradient cut can achieve more than 90%computational time reduction for large-size problem instances compared to the Gurobi solver.The power-of-two policy is capable of providing high-quality solutions with high computational efficiency.