针对动态不确定战场环境下多无人机对多区域、多目标的协同察打任务规划过程中存在的信息不确定、任务多约束及航迹强耦合的多目标优化与决策问题,结合Dubins航迹规划算法,提出了一种融合多种改进策略的灰狼优化算法(grey wolf optimiza...针对动态不确定战场环境下多无人机对多区域、多目标的协同察打任务规划过程中存在的信息不确定、任务多约束及航迹强耦合的多目标优化与决策问题,结合Dubins航迹规划算法,提出了一种融合多种改进策略的灰狼优化算法(grey wolf optimization algorithm incorporating multiple improvement strategies,IMISGWO).首先,针对动态环境带来的无人机巡航速度及察打任务消失时间的不确定性,基于可信性理论建立了以最大化任务收益为指标的任务规划数学模型;其次,为实现该问题的快速求解,设计了初始解均匀分布、个体通信机制调整、动态权重更新和跳出局部最优等策略,提升算法解搜索能力;最后,构建了多无人机察打一体典型任务仿真场景,通过数字仿真以及虚实结合半实物仿真试验验证了算法的可行性和有效性.仿真结果表明:算法在求解不确定环境下耦合航迹的多无人机察打一体任务规划问题时,能够生成多机高效的任务执行序列和满足无人机飞行性能约束的飞行轨迹,且能够适用于无人机数量增加导致问题复杂度增加情形下此类问题的求解.展开更多
In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based o...In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.展开更多
针对需求可拆分的多品种库存路径问题(multi-product inventory routing problem with split deliveries,MIRPSD),提出一种基于最小化库存持有成本、运输成本和车辆使用总成本的车辆路径优化模型。同时考虑每个客户的交货计划及每种货...针对需求可拆分的多品种库存路径问题(multi-product inventory routing problem with split deliveries,MIRPSD),提出一种基于最小化库存持有成本、运输成本和车辆使用总成本的车辆路径优化模型。同时考虑每个客户的交货计划及每种货物的运输数量。设计混合遗传算法进行求解,引入扰动策略以提高搜索效率,并通过实验选取合适的参数。探讨了平均日需求量与车辆载重量的比值、单位库存持有成本对需求拆分策略及总配送成本的影响。多组算例试验表明,本文提出的模型和算法可有效解决该问题。当需求量服从正态分布且平均日需求量为车辆载重量的55%时,采用需求拆分策略的效果最佳。本研究拓展了库存路径问题的相关理论,既可为解决MIRPSD问题提供一种新思路,也可为物流企业的相关决策提供理论依据。展开更多
文摘In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.
文摘针对需求可拆分的多品种库存路径问题(multi-product inventory routing problem with split deliveries,MIRPSD),提出一种基于最小化库存持有成本、运输成本和车辆使用总成本的车辆路径优化模型。同时考虑每个客户的交货计划及每种货物的运输数量。设计混合遗传算法进行求解,引入扰动策略以提高搜索效率,并通过实验选取合适的参数。探讨了平均日需求量与车辆载重量的比值、单位库存持有成本对需求拆分策略及总配送成本的影响。多组算例试验表明,本文提出的模型和算法可有效解决该问题。当需求量服从正态分布且平均日需求量为车辆载重量的55%时,采用需求拆分策略的效果最佳。本研究拓展了库存路径问题的相关理论,既可为解决MIRPSD问题提供一种新思路,也可为物流企业的相关决策提供理论依据。
