空运装载问题求解方法研究

针对空运装载问题,重点研究多目标多载具装载问题的数学模型,并提出基于重量差优先的禁忌邻域搜索优化算法来求解模型。实验结果表明该算法不仅保证目标函数值不恶化,还使得解空间搜索时间大大减少,极大地提高了模型求解速度。     

基于成组技术的汽车零件分类管理与检索

利用成组技术对汽车零件进行了分类,建立零件信息数据库,并实现了零件信息的检索。     

油罐底板渗漏的修补

某油罐底板发生了渗漏,采用AE声发射技术在油罐在用状态下检测出底板渗漏点的大致位置后,倒空油罐,对油罐内部管壁和底板进行热水循环清洗。用N2置换内部的油气,用轴流风机强制通风,检测罐内气体符合呼吸和防爆要求后,从人孔进入罐内。通过渗透检测和真空箱检测的方法精确找出缺陷位置,采用充N2隔离油气、浇水降温、钻孔等一系列措施挖除缺陷,更换底板下缺陷附件的含油沥青砂层。最后,在缺陷所在位置上焊接补丁钢板,成功地进行了易燃易爆油罐底板渗漏的修补。     

Optimal solution to the vehicle routing problem by adopting a meta-heuristic algorithm

The delivery service provided by large-scale retailers continues to grow as online sales occupy an increasingly large share of the market. This study aims to tease out efficient vehicle scheduling times as well as optimal delivery routes by applying meta-heuristic algorithms. Monthly data on existing routes were obtained from a branch of Korea’s leading large-scale online retailer. The first task was to examine the status of existing routes by comparing delivery routes created using Dijkstra’s algorithm with existing delivery routes and their vehicle scheduling. The second task was to identify optimal delivery routes through a comparative analysis of the genetic algorithm and Tabu search algorithm, known for its superior applicability amongst other meta-heuristic algorithms. These findings demonstrate that the optimal vehicle routing problem not only has the potential to reduce distribution costs for operators and expedite delivery for consumers, but also the added social benefit of reduced carbon emissions.     

Revisiting the application of simultaneous perturbation stochastic approximation towards signal timing optimization

Simultaneous Perturbation Stochastic Approximation (SPSA) has gained favor as an efficient optimization method for calibrating computationally intensive, “black box” traffic flow simulations. Few recent studies have investigated the efficiency of SPSA for traffic signal timing optimization. It is important for this to be investigated, because significant room for improvement exists in the area of signal optimization. Some signal timing methods and products perform optimization very quickly, but deliver mediocre solutions. Other methods and products deliver high-quality solutions, but at a very slow rate. When using commercialized desktop signal timing products, engineers are often forced to choose between speed and solution quality. Real-time adaptive control products, which must optimize timings within seconds on a cycle-by-cycle basis, have limited time to reach a high-quality solution. The existing literature indicates that SPSA provides the potential for upgrading both off-line and on-line solutions alike, by delivering high-quality solutions within seconds. This article describes an extensive set of optimization tests involving SPSA and genetic algorithms (GAs). The final results suggest that GA was slightly more efficient than SPSA. Moreover, the results suggest today's signal timing solutions could be improved significantly by incorporating GA, SPSA, and “playbooks” of preoptimized starting points. However, it may take another 5–10 years before our computers become fast enough to simultaneously optimize coordination settings (i.e., cycle length, phasing sequence, and offsets) at numerous intersections, using the most powerful heuristic methods, at speeds that are compatible with real-time adaptive solutions.     

多箱型内河集装箱船舶配载决策研究

内河集装箱运输具有其独特性,船舶配载时更强调船舶舱容利用率.考虑特殊箱型影响,以最小化堆栈占用数量为目标,构建内河集装箱船舶配载决策的整数规划模型.为实现快速寻优,设计包含构造部分和优化部分的启发式算法求解.算法中,构造部分基于启发式规则快速构造初始解,优化部分基于邻域搜索策略实现初始解优化.算例研究表明,模型可实现内河集装箱船舶配载决策问题的有效求解,但随着算例规模增加所需求解时间大幅增加.与模型精确求解相比,启发式算法在求解时间方面表现要远优于模型,可在0.25 s内实现所有算例的高效求解,为内河集装箱船舶实际配载决策提供一定参考.     

公交司机排班问题的混合元启发算法研究

针对我国公交企业中司机在1 个工作日内驾驶同一辆车的“人车绑定”管理模式, 提出混合元启发算法求解司机排班问题.首先建立以车辆数为目标的车辆调度模型,获得仅 满足司机休息时间的非可行解;接着迭代地使用局部搜索算子、破坏重建扰动等方法对解进 行调整,使其满足司机工作时间和吃饭时间等约束,并尽可能地降低排班成本;在迭代搜索 过程中记录发现的可行排班链集合,迭代结束后构建集合覆盖问题(SCP)模型对其进行改 进,以获得最佳的司机排班方案.在13 条公交线路案例上进行测试,实验结果验证了本文算 法的有效性.     

集装箱码头装船顺序和场桥行驶路径联合优化

为降低倒箱量、缩短场桥作业时间,在已知船舶配载图和堆场堆存状况的条件下,研究了出口箱装船顺序及场桥行驶路径联合优化问题.以作业时间衡量装船顺序产生的倒箱量及场桥行驶路径,建立作业时间最短为目标的整数规划模型,设计均衡倒箱量和场桥作业时间的启发式算法对模型进行求解,提出了问题下界的求解方法,同时,设计算例比较了启发式算法与下界的差异,为码头调度人员提供决策支持.     

带时间窗的地铁配送网络路径优化问题

为应对人们日益增加的货物需求与货车进城难题,提出整合地铁网和道路交通网,形成以地铁列车和城市配送车辆为载体的地铁配送网络.考虑列车开行时间表、客户服务时间窗、城市配送车辆容量等限制条件,构建带时间窗的地铁配送网络路径优化模型,综合优化地铁列车班次的客户分配、出站点的客户分配及末端配送路径.设计随机变邻域的迭代搜索算法(ILS-RVND)进行求解,以成都市地铁3号线运输货物为例,验证了模型和算法的实用性和有效性.结果表明,地铁配送网络配送成本低,准时性高,配送车辆行驶距离短,能满足比货车单独配送更精准的服务需求.     

基于人因的深海载人潜水器航控界面的优化设计

深海载人潜水器的航控界面存在信息复杂、操作复杂的特征,需通过优化航控软件界面的设计流程,提升软件界面的设计质量,提高驾驶环境下人机交互的可靠性,改善潜航员的驾控体验。以某型深海载人潜水器的实际任务场景为例建立典型航行工况,阐述其航行驾控的人因需求与功能需求,对软件界面的输入端与输出端展开重要性分析,提出以功能构架、交互逻辑、视觉设计、应用开发、评估迭代为指导的系统设计方法。形成了深海载人潜水器航控软件界面方案的人因评价指标,为深海载人潜水器航控软件界面方案的设计提供优选方法,为方案后续全工况覆盖的交互界面设计提供支撑。