Due to the limited transmission resources for data relay in the tracking and data relay satellite system （TDRSS）, there are many job requirements in busy days which will be discarded in the conventional job scheduli...Due to the limited transmission resources for data relay in the tracking and data relay satellite system （TDRSS）, there are many job requirements in busy days which will be discarded in the conventional job scheduling model. Therefore, the improvement of scheduling efficiency in the TDRSS can not only help to increase the resource utilities, but also to reduce the scheduling failure ratio. A model of nonhomogeneous parallel machines scheduling problems with time window （NPM-TW） is firstly built up for the TDRSS, considering the distinct features of the variable preparation time and the nonhomogeneous transmission rates for different types of antennas on each tracking and data relay satellite （TDRS）. Then, an adaptive subsequence adjustment （ASA） framework with evolutionary asymmetric path-relinking （EvAPR） is proposed to solve this problem, in which an asymmetric progressive crossover operation is involved to overcome the local optima by the conventional job inserting methods. The numerical results show that, compared with the classical greedy randomized adaptive search procedure （GRASP） algorithm, the scheduling failure ratio of jobs can be reduced over 11% on average by the proposed ASA with EvAPR.展开更多
The p-center problem consists of choosing a subset of vertices in an undirected graph as facilities in order to minimize the maximum distance between a client and its closest facility. This paper presents a greedy ran...The p-center problem consists of choosing a subset of vertices in an undirected graph as facilities in order to minimize the maximum distance between a client and its closest facility. This paper presents a greedy randomized adaptive search procedure with path-relinking （GRASP/PR） algorithm for the p-center problem, which combines both GRASP and path-relinking. Each iteration of GRASP/PR consists of the construction of a randomized greedy solution, followed by a tabu search procedure. The resulting solution is combined with one of the elite solutions by path-relinking, which consists in exploring trajectories that connect high-quality solutions. Experiments show that GRASP/PR is competitive with the state-of-the-art algorithms in the literature in terms of both solution quality and computational efficiency. Specifically, it virtually improves the previous best known results for 10 out of 40 large instances while matching the best known results for others.展开更多
制造供应链计划是制造供应链管理的关键问题,它不仅需要分配生产任务和控制库存,还需要解决不同工厂(企业)间的运输配套问题.为统一描述具有复杂产品生产过程(包括装配型、分解型和多输入多输出型等)的生产任务、存储任务和不同模式(包...制造供应链计划是制造供应链管理的关键问题,它不仅需要分配生产任务和控制库存,还需要解决不同工厂(企业)间的运输配套问题.为统一描述具有复杂产品生产过程(包括装配型、分解型和多输入多输出型等)的生产任务、存储任务和不同模式(包括单种物料独立运输模式和多种物料组合运输模式)的运输任务,提出了扩展状态任务网(extended state task network,简称ESTN).扩展状态任务网用比例转化任务统一描述生产任务、存储任务和单种物料独立运输任务,用虚比例转化任务和组合移动任务共同描述多种物料组合运输任务.应用扩展状态任务网,meta启发式方法在求解制造供应链问题时更容易编码和操作.为求解基于ESTN的制造供应链计划模型,提出了具有多样性检测的参考解集更新策略与分散性解变异策略的路径重连算法.路径重连算法维护一个由高质量解(精英解)组成的参考解集,将一个向导精英解的属性逐步引入一个起始精英解而形成的中间解序列(路径),并用此中间解序列更新参考解集以获得进化.计算实例表明,该路径重连算法比标准遗传算法、标准Tabu搜索算法以及普通路径重连算法能够获得更好的解,证明了多样性检测对参考解集更新的关键作用以及分散性解变异策略在提高解的质量上的能力.展开更多
基金supported by the National Natural Science Foundation of China(6113200291338101+3 种基金91338108)the National S&T Major Project(2011ZX03004-001-01)the Research Fund of Tsinghua University(2011Z05117)the Co-innovation Laboratory of Aerospace Broadband Network Technology
文摘Due to the limited transmission resources for data relay in the tracking and data relay satellite system （TDRSS）, there are many job requirements in busy days which will be discarded in the conventional job scheduling model. Therefore, the improvement of scheduling efficiency in the TDRSS can not only help to increase the resource utilities, but also to reduce the scheduling failure ratio. A model of nonhomogeneous parallel machines scheduling problems with time window （NPM-TW） is firstly built up for the TDRSS, considering the distinct features of the variable preparation time and the nonhomogeneous transmission rates for different types of antennas on each tracking and data relay satellite （TDRS）. Then, an adaptive subsequence adjustment （ASA） framework with evolutionary asymmetric path-relinking （EvAPR） is proposed to solve this problem, in which an asymmetric progressive crossover operation is involved to overcome the local optima by the conventional job inserting methods. The numerical results show that, compared with the classical greedy randomized adaptive search procedure （GRASP） algorithm, the scheduling failure ratio of jobs can be reduced over 11% on average by the proposed ASA with EvAPR.
基金The research was supported by the National Natural Science Foundation of China under Grant Nos. 61370183 and 61262011.
文摘The p-center problem consists of choosing a subset of vertices in an undirected graph as facilities in order to minimize the maximum distance between a client and its closest facility. This paper presents a greedy randomized adaptive search procedure with path-relinking （GRASP/PR） algorithm for the p-center problem, which combines both GRASP and path-relinking. Each iteration of GRASP/PR consists of the construction of a randomized greedy solution, followed by a tabu search procedure. The resulting solution is combined with one of the elite solutions by path-relinking, which consists in exploring trajectories that connect high-quality solutions. Experiments show that GRASP/PR is competitive with the state-of-the-art algorithms in the literature in terms of both solution quality and computational efficiency. Specifically, it virtually improves the previous best known results for 10 out of 40 large instances while matching the best known results for others.
文摘制造供应链计划是制造供应链管理的关键问题,它不仅需要分配生产任务和控制库存,还需要解决不同工厂(企业)间的运输配套问题.为统一描述具有复杂产品生产过程(包括装配型、分解型和多输入多输出型等)的生产任务、存储任务和不同模式(包括单种物料独立运输模式和多种物料组合运输模式)的运输任务,提出了扩展状态任务网(extended state task network,简称ESTN).扩展状态任务网用比例转化任务统一描述生产任务、存储任务和单种物料独立运输任务,用虚比例转化任务和组合移动任务共同描述多种物料组合运输任务.应用扩展状态任务网,meta启发式方法在求解制造供应链问题时更容易编码和操作.为求解基于ESTN的制造供应链计划模型,提出了具有多样性检测的参考解集更新策略与分散性解变异策略的路径重连算法.路径重连算法维护一个由高质量解(精英解)组成的参考解集,将一个向导精英解的属性逐步引入一个起始精英解而形成的中间解序列(路径),并用此中间解序列更新参考解集以获得进化.计算实例表明,该路径重连算法比标准遗传算法、标准Tabu搜索算法以及普通路径重连算法能够获得更好的解,证明了多样性检测对参考解集更新的关键作用以及分散性解变异策略在提高解的质量上的能力.
