【作者】 王浩；

【导师】 郭瑞军； 杨勇虎；

【作者基本信息】 大连交通大学 ， 工程硕士（专业学位）， 2016， 硕士

【摘要】 本论文的研究核心是整车物流仓储中心中的道位优化调度问题,所谓道位优化调度问题就是考虑如何在满足一定约束的条件下,为到达和离开仓储中心的车辆分配到适合的道位进行装车作业,保证车辆正常运行并满足一定优化目标的一项综合管理问题。该问题的解决将改善我国整车物流中心管理中的道位优化调度计划的手工管理方式的情况,实现计算机优化位置分配,适应信息化协的飞速发展,从而有助于企业提高设备资源的利用效率,减少相关物流企业的支出,同时还能够节省大力等资源,因此具有重要的意义与价值。本文在已有的研究基础上,进一步对物流运输中心道位优化调度问题进行研究,主要做了三方面的工作:第一,总结在该问题上国内外专家学者的研究现状,分析其中存在的问题。阐明了图着色模型以及其在调度优化方面存在的优势。第二,带有冲突关系道位分配问题建模与求解。以最小化占用道位数目以及最少调度场内行走距离为目标函数,通过量化大、中、小道位对目标函数的贡献,把调度过程中的问题转换成为基于权重的图着色算法道位优化调度模型,并通过相应的冲突判定算法、难度系数排序算法以及冲突消去算法的设计来进行解答。并且通过实例数据计算结果的分析与比较,证明了该模型及思路是切实可行的。第三,带有时间延迟问题的道位分配问题建模与求解。以分配方案的稳定性和鲁棒性为目标,将带有延误问题的适位分配问题装换成鲁棒图着色问题进行建模。针对问题,设计并且通过编码实现了遗传算法对该问题的求解,证明了所建模型及遗传算法求解的有效性。更多还原

【Abstract】 The core of this research paper is the vehicle logistics and warehousing center in the loading field path optimization scheduling problem,the so-called loading field path optimization scheduling problem is to consider how under certain constraint conditions for the arrival and departure of vehicles assigned to the storage center for the loading field path operations carried out to ensure the normal operation of vehicles and must meet a comprehensive management optimization objectives.Solution to this problem will improve our automobile logistics center management in the case of manual loading field path optimize management of scheduling,location assignment optimization computer implemented to adapt the rapid development of information technology,which helps companies improve the efficiency of device resources reduce expenses related logistics enterprises,but also can save manpower and other resources,so it has important research value and application value.This paper summarizes the relevant references and research at home and abroad on the basis of further logistics center loading field path optimization scheduling problem studied,mainly to do the work in three areas:First,the stocktaking study on the issue of domestic and foreign experts and scholars to analyze the existing problems.To clarify the presentation graph coloring model and the advantages of its presence in the scheduling optimization.Second,the conflict relationship with loading field path allocation model and algorithm.In order to minimize the number of occupied loading field paths and minimal scheduling field walking distance of the objective function by quantifying the large,medium,trails bit contribution to the objective function,the scheduling problem is converted into Optimal Weight-based graph coloring algorithm loading field paths model and algorithm determines the appropriate conflict,the difficulty factor and sorting algorithms conflict elimination algorithm is designed to answer.And the results of data analysis by examples and comparative verification proved that the model and the idea is feasible.Third,the loading field paths with a time delay problem assignment model and algorithm.loading field path allocation to the stability and robustness of the distribution plan for the destination,with delays in loading into the robust modeling graph coloring problem.For problem,,design and coding to achieve through a genetic algorithm to solve this problem,it proves the validity of the model and genetic algorithm.更多还原