CAJ | 학술논문

本文联合订单分批与拣选路径问题，以行走距离最短为目标，建立了订单分批与拣选路径问题的数学模型。采用节约算法和聚类分析算法对订单进行了分批优化，并采用了三种路径策略：穿越路径策略、返回路径策略、中点路径策略。通过几组具体的订单数据，对不同订单分批算法与路径策略的组合进行了比较分析，从而得出最优的分批结果与路径策略。
본문연합정단분비여간선로경문제，이행주거리최단위목표，건립료정단분비여간선로경문제적수학모형。채용절약산법화취류분석산법대정단진행료분비우화，병채용료삼충로경책략：천월로경책략、반회로경책략、중점로경책략。통과궤조구체적정단수거，대불동정단분비산법여로경책략적조합진행료비교분석，종이득출최우적분비결과여로경책략。
In this paper, a mathematical model of the order batching and routing problem is established based on the shortest path problem and the shortest path problem. In order to optimize the order of the order, the algo-rithm uses the algorithm and the clustering analysis algorithm to optimize the order of the order, and uses three kinds of methods: through the path, the path and the path. Through several groups of concrete orders data, the com-bination of different order batching algorithm and path strategy is analyzed, and the optimal result is obtained.