循环取料下的多道口分配问题及算法研究

Study on Multi-path Distribution and Algorithm Based on Circular Picking

针对循环取料下的多道口分配问题,研究无时间窗约束的车辆优化调度问题。决策变量是每辆车停靠道口的先后顺序和每个道口停靠的车辆的先后顺序,优化目标是最小化卸货所需的总时间。首先,建立该类问题的混合整数规划模型。其次,提出求解该类问题的贪婪算法。最后,数值实验表明该类算法的有效性。

Based on the multi-path distribution under circular picking, the paper studies vehicle optimized scheduling without time window constraint. Decision varibles are sequences of the paths of each vehicle stopped in and the vehicles stopped in each path. The optimized object is the shortest total time needed by unloading. The paper establishes a mixed integer programming, then proposes a geedy algorithm to solve the problem and fiinally gives out anumefieal example.