Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots

Dial-a-ride problems are concerned with the design of efficient vehicle routes for transporting individual persons from specific origin to specific destination locations. In real-life this operational planning problem is often complicated by several factors. Users may have special requirements (e.g. to be transported in a wheelchair) while service providers operate a heterogeneous fleet of vehicles from multiple depots in their service area. In this paper, a general dial-a-ride problem in which these three real-life aspects may simultaneously be taken into account is introduced: the Multi-Depot Heterogeneous Dial-A-Ride Problem (MD-H-DARP). Both a three- and two-index formulation are discussed. A branch-and-cut algorithm for the standard dial-a-ride problem is adapted to exactly solve small problem instances of the MD-H-DARP. To be able to solve larger problem instances, a new deterministic annealing meta-heuristic is proposed. Extensive numerical experiments are presented on different sets of benchmark instances for the homogeneous and the heterogeneous single depot dial-a-ride problem. Instances for the MD-H-DARP are introduced as well. The branch-and-cut algorithm provides considerably better results than an existing algorithm which uses a less compact formulation. All seven previously unsolved benchmark instances for the heterogeneous dial-a-ride problem could be solved to optimality within a matter of seconds. While computation times of the exact algorithm increase drastically with problem size, the proposed meta-heuristic algorithm provides near-optimal solutions within limited computation time for all instances. Several best known solutions for unsolved instances are improved and the algorithm clearly outperforms current state-of-the-art heuristics for the homogeneous and heterogeneous dial-a-ride problem, both in terms of solution quality and computation time.     

基于模拟退火算法的物流配送路径优化问题分析

模拟退火算法是解决NP完全组合优化问题的有效近似算法,将该算法应用于路径优化问题中,利用该算法对类似货郎担问题的路径问题进行求解。针对城市道路行走不同的目标条件（路径最短、时问最短）进行优化,选择最佳行走路径,并用该算法优化得到的计算结果,结果表明该算法在解类似货郎担交通路径方面问题时具有较高的精确性。因而,该算法在解决城市道路交通问题方面具有一定的实用价值。     

基于模拟退火算法的航母总体要素寻优

介绍了模拟退火算法的基本原理及迭代步骤,并将其引入到航空母舰的总体要素方案生成阶段,在综合考虑航空母舰的稳性、快速性、耐波性、作战效能和花费等的同时,建立了最小目标函数模型,通过FORTRAN语言编程对航空母舰总体要素进行全局寻优。算例结果表明,模拟退火算法能很好地找到全局最优解,而不受初始点的控制,优化后,航空母舰的稳性、快速性、耐波性、作战效能和花费等都得到了改善。     

基于组合优化算法的混合动力客车控制策略优化

结合模拟退火算法全局优化能力强和非线性二次规划算法能够快速寻优的特点,使用Isight优化软件将二者建立组合优化算法对建立的功率解析控制策略进行全局优化。优化结果表明,所提出的组合优化算法避免了模拟退火算法局部优化不强的缺点,提高了优化质量和计算效率;在保证整车动力性的前提下,使整车综合油耗下降了12%。     

Optimal subwork zone operational strategy for short‐term work zone projects in four‐lane two‐way freeways

Roadside trees in Singapore are regularly trimmed for the purpose of traffic safety and roadside tree‐trimming project is one typical type of short‐term work zone projects. To implement such a short‐term work zone project, contractors usually divide an entire work zone into multiple subwork zones with the uniform length. This paper aims to determine an optimal subwork zone strategy for the short‐term work zone projects in four‐lane two‐way freeways with time window and uniform subwork zone length constraints. The deterministic queuing model is employed to estimate total user delay caused by the work zone project by taking into account variable traffic speeds. Based on the user delay estimations, this paper proceeds to build a minimization model subject to time window and uniform length constraints for the optimal subwork zone strategy problem. This paper also presents a variation of the minimization model to examine the impact of unequal subwork zone length constraint. Since these minimization models belong to the mixed‐integer non‐differentiable optimization problems, an iterative algorithm embedding with the genetic simulated annealing method is thus proposed to solve these models. Finally, a numerical example is carried out to investigate the effectiveness of the proposed models. Copyright © 2010 John Wiley & Sons, Ltd.     

两种优化算法在螺旋桨优化设计中的应用与比较

为了获取合理且高效的船用螺旋桨,把数值优化算法引用到螺旋桨剖面设计中来。设计过程中以遗传算法和模拟退火算法为优化算法,以提高敞水效率为优化目标,通过优化算法的操作产生新翼型剖面,并结合面元法水动力性能预报程序进行原型桨与设计桨的水动力性能预报。由结果分析可知:结合优化算法的螺旋桨设计是可行的,且在算例中各算法的设置条件下,模拟退火算法无论在优化效果上还是在优化效率上都比遗传算法表现卓越。     

һ�ָĽ�ģ���˻������·��ѡ���㷨

合理的配送路线可以提高物流配送的效率。启发式的最优路径选择方法是目前研究的热点，本文针对模拟退火算法收敛速度慢的缺点，提出采用退火过程的导引知识（即上次退火过程节点的分布情况）作为下次选择节点的依据，从而提高模拟退火算法的速度。分别针对不同的配送节点进行实验，结果表明，基于导引知识的模拟退火算法能够获得更快的收敛速度，更快得到最优解。     

三峡葛洲坝联合通航调度的混合整数规划

联合通航调度计划问题就是如何保持长江三峡大坝和葛洲坝之间的船舶航行的通畅有序,它是一个十分复杂的多目标组合优化问题.文中采用一个具有双服务台5个批处理服务器的开放多类排队网络来描述该调度系统,在此基础上建立起一种基于离散时间域的多目标混合整数非线性规划模型,提出一种基于启发式变异策略的模拟退火算法,能在有限的计算时间内得到较优的调度计划,并针对实际通航数据的测算,验证了该算法的有效性.     

抗震结构时程可靠度的遗传模拟退火算法

针对抗震结构时程可靠度分析中功能函数为非线性程度较高的隐式函数的特点，将遗传模拟退火算法与时程分析法相结合，建立了抗震结构时程可靠度分析的遗传模拟退火算法．该算法可以充分考虑结构参数和地震动的双重随机性，可确定任意时刻结构的时程可靠指标．用此方法及Monte Callo法分析了分别受大震和小震作用的三质点钢筋混凝土结构的时程可靠度，结果表明了该方法的有效性．     

基于并行组合模拟退火算法的水泵汽蚀初生故障识别

针对水泵汽蚀初始阶段故障信号微弱,检测困难的特点,提出一种基于并行组合模拟退火算法对水泵"汽蚀初生"故障进行识别.阐述了算法的原理和实现方法,通过设计的实验台模拟水泵"汽蚀初生"故障,并获取了正常与模拟故障状态下水泵壳体的振动与出口压力信号的特征参数.利用该算法将上述特征参数自组织、自生成新的特征参数,达到了识别的目的.