A new hybrid MMA-MGCMMA （HMM） algorithm for solving topology optimization problems is presented. This algorithm combines the method of moving asymptotes （MMA） algorithm and the modified globally convergent version...A new hybrid MMA-MGCMMA （HMM） algorithm for solving topology optimization problems is presented. This algorithm combines the method of moving asymptotes （MMA） algorithm and the modified globally convergent version of the method of moving asymptotes （MGCMMA） algorithm in the optimization process. This algorithm preserves the advantages of both MMA and MGCMMA. The optimizer is switched from MMA to MGCMMA automatically, depending on the numerical oscillation value existing in the calculation. This algorithm can improve calculation efficiency and accelerate convergence compared with simplex MMA or MGCMMA algorithms, which is proven with an example.展开更多
乘务交路计划的编制是乘务计划编制智能化的关键。简述客运专线乘务交路计划编制问题,在将其转化为一类特殊的旅行商问题(TSP)的基础上,建立了该问题的数学模型。改进了最大最小蚂蚁系统(MMAS,max-min ant system),提出用K-MMAS算法求...乘务交路计划的编制是乘务计划编制智能化的关键。简述客运专线乘务交路计划编制问题,在将其转化为一类特殊的旅行商问题(TSP)的基础上,建立了该问题的数学模型。改进了最大最小蚂蚁系统(MMAS,max-min ant system),提出用K-MMAS算法求解该数学模型。以京津城际客运专线相关数据为背景对该算法进行仿真,验证了算法的有效性。展开更多
基金This project is supported by National Basic Research Program of China(973Program, No.2003CB716207) and National Hi-tech Research and DevelopmentProgram of China(863 Program, No.2003AA001031).
文摘A new hybrid MMA-MGCMMA （HMM） algorithm for solving topology optimization problems is presented. This algorithm combines the method of moving asymptotes （MMA） algorithm and the modified globally convergent version of the method of moving asymptotes （MGCMMA） algorithm in the optimization process. This algorithm preserves the advantages of both MMA and MGCMMA. The optimizer is switched from MMA to MGCMMA automatically, depending on the numerical oscillation value existing in the calculation. This algorithm can improve calculation efficiency and accelerate convergence compared with simplex MMA or MGCMMA algorithms, which is proven with an example.
文摘乘务交路计划的编制是乘务计划编制智能化的关键。简述客运专线乘务交路计划编制问题,在将其转化为一类特殊的旅行商问题(TSP)的基础上,建立了该问题的数学模型。改进了最大最小蚂蚁系统(MMAS,max-min ant system),提出用K-MMAS算法求解该数学模型。以京津城际客运专线相关数据为背景对该算法进行仿真,验证了算法的有效性。
