Just-in-time distributed precast scheduling with considering production and transportation costs
To address the distributed precast scheduling problem,considering the characteristics of mixed interruptible and non-interruptible operations,mixed serial and parallel operations,as well as constraints on order acceptance for factories in precast component production,and the varying impact of geographical locations in the transportation process,a sequence-based mixed-integer nonlinear programming model was established to minimize production-transportation costs and inventory-delay penalties.Given the complexity of the problem,a hybrid intelli-gent optimization algorithm based on adaptive large neighborhood search was proposed.In this algorithm,an ordinal-based vector encoding and decoding method was first designed,followed by a combination of dynamic neigh-borhood extraction heuristic and taboo search algorithms to enhance the quality of initial solutions.Diverse neighbor-hood structures and a multi-strategy fusion approach were introduced to further enhance the solution quality and so-lution efficiency to prevent premature convergence to local optima.Finally,the effectiveness of the proposed algo-rithm was validated through extensive experimentation.
distributed precast production schedulingjust-in-timemixed integer nonlinear programmingadaptive large neighborhood search
万方数据
维普
