基于蚁群算法的仓库拣货路径优化研究-企业管理及其信息化专业论文.docxVIP

基于蚁群算法的仓库拣货路径优化研究摘要 基于蚁群算法的仓库拣货路径优化研究 摘要 越来越多的企业构建自己的仓库和配送体系，以期降低物流成本，保持自 己的竞争力。物流作为“第三利润源泉越来越受重视。现代仓库是物流不可 或缺的一部分，拣货作业是仓库的核心作业环节，拣货成本占到整个仓库物流 成本的40％，其效率的高低直接影响到整个仓库的效率，而提高拣货作业效率， 缩短拣货路径长度至关重要。本文选择双区型仓库为研究对象，应用蚁群算法 对拣货路径加以优化。 本文首先分析了仓库拣货路径的研究现状和存在的问题，综述了物流拣货 路径的相关问题，包括拣货作业流程、仓库中典型的双区型仓库和影响拣货的 因素等。其次根据双区型仓库中拣货路径问题的特点，将该问题分成不考虑拣 货车辆容积和考虑拣货车容积两种情况，针对不考虑拣货车容积的情况，采用 蚁群算法优化求解其拣货路径问题，并将该算法的结果与S形启发式算法进行 比较，验证了该方法的有效性。最后针对考虑拣货车容积的情况，应用蚁群算 法对拣货路径问题进行建模求解，并在Vsi ualC++6．0平台上上实现了该算法， 与遗传算法的优化结果进行比较发现当拣货数量较多时，该算法具有明显优势。 关键词：蚁群算法；双区型仓库；拣货路径 Research Research on Optimization method of picking routing in the warehouse Based on Ant Colony Algorithm AB STRACT More and more companies build warehouse and distribution system．They want to reduce logistics cost and maintain own competitiveness．As”third profit source”，logistics get a lot of attention．Modern warehouse is logistics indispensable part．Picking is core operating in the warehouse。Picking cost accountes entire warehouse logistics cost 40％．Its efficiency direct influence entire warehouse efficiency．In order to improving picking efficiency，short picking path length is crucial． Firstly，the article analyzes warehouse picking path，research status and problems．Picking path related problems include picking workflow,typical dual district type warehouse and the factors which influenced picking efficiency． Secondly according double district type warehouse picking path problem characteristics，the problem depart to two situations，not consider picking—car’S volume and consider picking．car’S volume．Not consider volume situation，the article adopt Ant Colony Algorithm to solve this problem，and verify the results with S shaped heuristic algorithm’S results．Finally for considering picking-car’S volume situation，the artile apply Ant Colony Algorithm to solve picking routing problem modeling and realize the algorithm in Vsiual C++6．0 platform，compare the results with Genetic Algorithm optimization results．We found in the table， when we pick more goo