A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems' another feature lies in oversubscription, namely no...A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems' another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.展开更多
针对带时间窗的同时取送货车辆路径问题(vehicle routing problem with simultaneous pickup-delivery and time windows,VRPSPDTW),构建了以车辆使用成本、车辆行驶距离成本总支出最小化的路径优化数学模型,提出自适应头脑风暴算法(ada...针对带时间窗的同时取送货车辆路径问题(vehicle routing problem with simultaneous pickup-delivery and time windows,VRPSPDTW),构建了以车辆使用成本、车辆行驶距离成本总支出最小化的路径优化数学模型,提出自适应头脑风暴算法(adaptive brain storm optimization,ABSO)进行求解。全局搜索阶段,采用多项惩罚方式扩大搜索区域,并使用聚类及三种路径搜索策略进行全局搜索;局部搜索阶段,将六种破坏-修复算子作为备选集合,进而设计自适应动态选择邻域搜索机制,增强局部搜索效能。选取测试数据集和实际案例对算法性能进行测试,实验结果表明针对小规模标准算例,所提算法全部取得了当前已知最优解;对于大规模标准算例,通过与遗传算法、并行模拟退火算法、离散布谷鸟算法对比,所提算法实验计算结果有7.52%~12.03%的提升;对于实际案例,所提算法在收敛速度和寻优能力方面均展示出优越性,充分验证了所提算法对解决VRPSPDTW问题的有效性。展开更多
随着电子商务的蓬勃发展,海量客户需求和高频率、多品种、小批量的订单特性为订单拣选业务带来巨大挑战。在物流智能化的趋势下,大量电商企业采用移动机器人拣货系统(Robotic Mobile Fulfillment System,RMFS)进行订单拣选。订单分配和...随着电子商务的蓬勃发展,海量客户需求和高频率、多品种、小批量的订单特性为订单拣选业务带来巨大挑战。在物流智能化的趋势下,大量电商企业采用移动机器人拣货系统(Robotic Mobile Fulfillment System,RMFS)进行订单拣选。订单分配和拣选路径规划是影响仓库订单拣选效率的关键决策。为了提高电商RMFS系统拣选效率,降低仓库运营成本,基于电商企业多订单、多货架、多拣选站下的拣选业务场景,以最小化机器人负载距离为目标,构建订单分配与路径规划联合优化模型,设计两阶段的A*算法和自适应大领域搜索算法(Adaptive Large Neighborhood Search,ALNS),在ALNS算法原有框架的基础上提出新的移除和修复算子以适应订单分配问题,并针对30个不同规模算例进行计算分析。计算结果表明,所提出的优化方法收敛快、性能稳定,能够有效缩短机器人行走距离,相比先到先拣选策略最大可缩短47.6%的机器人负载距离。同时,也可在更短时间内获得与CPLEX求解质量相近的解。尤其是当订单数量增长时,相比CPLEX具有突出时间优势,可以实现电商仓储资源的合理调度和配置,从而为电商企业仓储智能化提供有效决策指导。展开更多
基金supported by the National Natural Science Foundation of China (7060103570801062)
文摘A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems' another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.
文摘针对带时间窗的同时取送货车辆路径问题(vehicle routing problem with simultaneous pickup-delivery and time windows,VRPSPDTW),构建了以车辆使用成本、车辆行驶距离成本总支出最小化的路径优化数学模型,提出自适应头脑风暴算法(adaptive brain storm optimization,ABSO)进行求解。全局搜索阶段,采用多项惩罚方式扩大搜索区域,并使用聚类及三种路径搜索策略进行全局搜索;局部搜索阶段,将六种破坏-修复算子作为备选集合,进而设计自适应动态选择邻域搜索机制,增强局部搜索效能。选取测试数据集和实际案例对算法性能进行测试,实验结果表明针对小规模标准算例,所提算法全部取得了当前已知最优解;对于大规模标准算例,通过与遗传算法、并行模拟退火算法、离散布谷鸟算法对比,所提算法实验计算结果有7.52%~12.03%的提升;对于实际案例,所提算法在收敛速度和寻优能力方面均展示出优越性,充分验证了所提算法对解决VRPSPDTW问题的有效性。
文摘随着电子商务的蓬勃发展,海量客户需求和高频率、多品种、小批量的订单特性为订单拣选业务带来巨大挑战。在物流智能化的趋势下,大量电商企业采用移动机器人拣货系统(Robotic Mobile Fulfillment System,RMFS)进行订单拣选。订单分配和拣选路径规划是影响仓库订单拣选效率的关键决策。为了提高电商RMFS系统拣选效率,降低仓库运营成本,基于电商企业多订单、多货架、多拣选站下的拣选业务场景,以最小化机器人负载距离为目标,构建订单分配与路径规划联合优化模型,设计两阶段的A*算法和自适应大领域搜索算法(Adaptive Large Neighborhood Search,ALNS),在ALNS算法原有框架的基础上提出新的移除和修复算子以适应订单分配问题,并针对30个不同规模算例进行计算分析。计算结果表明,所提出的优化方法收敛快、性能稳定,能够有效缩短机器人行走距离,相比先到先拣选策略最大可缩短47.6%的机器人负载距离。同时,也可在更短时间内获得与CPLEX求解质量相近的解。尤其是当订单数量增长时,相比CPLEX具有突出时间优势,可以实现电商仓储资源的合理调度和配置,从而为电商企业仓储智能化提供有效决策指导。