论文部分内容阅读
放射形专用线非直达车流取送车问题属于一类组合优化问题,影响因素较多。经过分析,本文建立了目标函数,给出了送车需要时间和取车需要时间计算公式,提出送车增量和取车增量概念,用以替代目标函数,可简化计算。寻求最佳取送方案按照分部求解的思路进行,整个选优过程实质是一个迭代过程。通过算例说明了算法步骤,其核心是在送车状态树上采用隐枚举法搜索优质可比送车方案,为此证明了一个定理,可借以提高收敛速度。
Radial special line non-direct traffic flow car delivery problems belong to a class of combinatorial optimization problems, more influencing factors. After analysis, this paper established the objective function, given the time needed to get off the car and the time needed to get the car formula, put forward the concept of car incremental and car incremental, to replace the objective function, can simplify the calculation. Seek the best pick-and-drop solution in accordance with the idea of sub-division, the entire process of electoral process is essentially an iterative process. An example is given to illustrate the steps of the algorithm. The core of the algorithm is to search for a high quality and comparable delivery scheme by using the hidden enumeration method in the delivery vehicle state tree. This proves a theorem which can improve the convergence speed.