启发式Hopfield神经网络在车间调度中的应用

调度问题是一类非常复杂的组合优化问题，而Hopfield神经网络通常被广泛应用于各种组合优化问题．针对车间调度问题(JSP)的约束条件和换位矩阵，提出了包含所有约束条件的计算能量函数表达式，并针对神经网络依赖初始解，提出了启发式算法与神经网络相结合的方法，并得到解决车间调度的Hopfield神经网络结构和权值解析表达式．实验仿真结果表明了该方法的有效性．     

基于机场群的航班选择机场模型分析研究

为了解决枢纽机场因容量限制而产生的航班延误,引入了一种新的概念——机场群,就是地理位置接近的多个机场构成一个超级大的机场,进行航班的共同调度,并且结合地面交通,解决空中交通运输需求问题。本文针对机场群问题进行研究,给出了机场选择模型的数学描述,并结合模糊综合评判方法思想,设计了启发式算法。通过对现实机场情况的仿真,表明了模型的可用性,减少了跑道空闲状态。     

A basic mathematical model for evacuation problems in urban areas

Real life situations like floods, hurricanes or chemical accidents may cause the evacuation of a certain area to rescue the affected population. To enable a fast and a safe evacuation a basic mixed-integer evacuation model has been developed that provides a reorganization of the traffic routing of a certain area for the case of an evacuation. This basic problem of evacuation minimizes the evacuation-time while prohibiting conflicts within intersections. Our evacuation model is a dynamic network flow problem with additional variables for the number and direction of used lanes and with additional complicating constraints.Because of the size of the time-expanded network, the computational effort required by standard software is already very high for tiny instances. To deal with realistic instances we propose a heuristic approach.     

Designing an integrated distribution system for catering services for high-speed railways: A three-echelon location routing model with tight time windows and time deadlines

An emerging task in catering services for high-speed railways (CSHR) is to design a distribution system for the delivery of high-quality perishable food products to trains in need. This paper proposes a novel model for integrating location decision making with daily rail catering operations, which are affected by various aspects of rail planning, to meet time-sensitive passenger demands. A three-echelon location routing problem with time windows and time budget constraints (3E-LRPTWTBC) is thus proposed toward formulating this integrated distribution system design problem. This model attempts to determine the capacities/locations of distribution centers and to optimize the number of meals delivered to stations. The model also attempts to generate a schedule for refrigerated cars traveling from distribution centers to rail stations for train loading whereby meals can be catered to trains within tight time windows and sold before a specified time deadline. By relaxing the time-window constraints, a relaxation model that can be solved using an off-the-shelf mixed integer programming (MIP) solver is obtained to provide a lower bound on the 3E-LRPTWTBC. A hybrid cross entropy algorithm (HCEA) is proposed to solve the 3E-LRPTWTBC. A small-scale case study is implemented, which reveals a 9.3% gap between the solution obtained using the HCEA and that obtained using the relaxation model (RM). A comparative analysis of the HCEA and an exhaustive enumeration algorithm indicates that the HCEA shows good performance in terms of computation time. Finally, a case study considering 156 trains on the Beijing-Shanghai high-speed corridor and a large-scale case study considering 1130 trains on the Chinese railway network are addressed in a comprehensive study to demonstrate the applicability of the proposed models and algorithm.     

求解QoS组播路由问题的改进蚂蚁算法

蚂蚁算法是一种相对较新的启发式方法,通过模拟蚂蚁的觅食行为,提出了求解Qos组播路由问题的改进蚂蚁算法。仿真实验表明,该算法能以较高速度收敛,有效地解决QoS组播路由问题。     

长方体布局问题的一种启发式算法

长方体布局问题属于NP完全问题,在串行机上解决这类问题只能依赖启发式算法。本文提出了一种对布局空间进行动态分解和对剩余空间进行合并和再利用的启发式算法。分解过程采用三叉树数据结构表示,深度优先原则搜索,根据一定的定序规则和定位规则快速求得问题的满意解。同时针对影响布局结果的"难布置的布局物体",设计剩余空间的合并规则,达到该类物体的布入,并通过算例说明了本算法的有效性,对长方体布局具有一定的指导意义,也为人机结合的优化布局提供了良好基础。     

启发式平面点定位策略研究

提出了一种适用于平面封闭曲线的启发式点定位策略。本文论述了该策略的原理及实现方法等关键技术。     

非合作下危险物品运输网络的双层模型及博弈研究

在政府和运输商的双层约束条件下,对危险物品运输网络的设计进行了分析,在此基础上兼顾政府期望的风险和运输商期望的成本上不同的利益目标,建立一个双层规划模型,根据非合作博弈论的相关理论设计启发式算法进行求解,最后利用算例验证模型和算法的可行性.     

编组站到发线运用计划优化

合理安排列车占用到发线计划是编制作业计划的关键。在满足列车使用到发线须遵守的作业要求的前提下,建立编组站到发线运用计划数学模型,使其能够求解出较优的到发线运用方案。建立的到发线运用模型是非线性的整数规划模型,如果直接求解会比较困难,采用启发式算法对其求解。在求得可行解后通过合并、交换及组合的方法对所有股道再次进行调整,使到发线运用更趋于合理,即求得较优的到发线运用方案。通过算例说明运用模型计算生成到发线运用计划,其优化结果有明显效果。     

Automatic two-dimensional layout using a rule-based heuristic algorithm

 Efficient layout strategies are introduced for automatic nesting using a rule-based heuristic approach to improve the layout efficiency. Since a large portion of the complexity of the parts layout problem results from the overlapping computation, geometric redesign techniques are also suggested to reduce the complexity of the problem for a fast and reliable means of performing overlapping computation. A new heuristic sliding technique is developed to find a near-optimum layout location from all the feasible arrangements in such a manner that two or more arbitrary parts do not overlap or intersect. An identification method with a pivoting point is suggested to calculate the boundary of the overlap region in a fast computation time-frame. Resource plate clipping using virtual memory, based on a polygon clipping algorithm, is also proposed as a technique to reduce the geometric conditions of the resource plate and the overlap computation time by updating a new stock boundary of the resource plate for the layout space of the next part after each part is placed. The aim of this article is to develop a rule-based heuristic nesting system to achieve a new automatic layout on the AutoCAD system. For this implementation, some nesting examples are demonstrated. A rule-based heuristic approach can be desirable in terms of the layout efficiency and considering the computational time for nesting problems, and is proposed as a real-time layout simulation method in the industrial field. Received: October 7, 2002 / Accepted: March 27, 2003 RID="*"