To diagnose the feasibility of the solution of a job-shop scheduling problem（JSSP）,a test algorithm based on diagraph and heuristic search is developed and verified through a case study.Meanwhile,a new repair algori...To diagnose the feasibility of the solution of a job-shop scheduling problem（JSSP）,a test algorithm based on diagraph and heuristic search is developed and verified through a case study.Meanwhile,a new repair algorithm for modifying an infeasible solution of the JSSP to become a feasible solution is proposed for the general JSSP.The computational complexity of the test algorithm and the repair algorithm is both O（n） under the worst-case scenario,and O（2J＋M） for the repair algorithm under the best-case scenario.The repair algorithm is not limited to specific optimization methods,such as local tabu search,genetic algorithms and shifting bottleneck procedures for job shop scheduling,but applicable to generic infeasible solutions for the JSSP to achieve feasibility.展开更多
针对配电网规划中分布式新能源出力随机性大、规划复杂度高的问题,提出一种含分布式新能源的配电网风险规划模型。该模型以网络综合费用最小为目标函数,通过网络支路负荷容量确定新建分布式新能源出力最大值,综合考虑系统供电不足等网...针对配电网规划中分布式新能源出力随机性大、规划复杂度高的问题,提出一种含分布式新能源的配电网风险规划模型。该模型以网络综合费用最小为目标函数,通过网络支路负荷容量确定新建分布式新能源出力最大值,综合考虑系统供电不足等网络风险因素,进行含分布式新能源的配电网风险规划。在求解过程中提出一种类比通信网络广播方式修复遗传算法不可行解的方法。通过在含分布式光伏发电和径流式水电站的安徽某地区10 k V网架规划中的实际应用,验证了该风险规划模型的有效性。展开更多
基金The US National Science Foundation (No. CMMI-0408390, CMMI-0644552)the Research Fellowship for International Young Scientists (No. 51050110143)+2 种基金the Fok Ying-Tong Education Foundation(No. 114024)the Natural Science Foundation of Jiangsu Province (No.BK2009015)the Postdoctoral Science Foundation of Jiangsu Province (No.0901005C)
文摘To diagnose the feasibility of the solution of a job-shop scheduling problem（JSSP）,a test algorithm based on diagraph and heuristic search is developed and verified through a case study.Meanwhile,a new repair algorithm for modifying an infeasible solution of the JSSP to become a feasible solution is proposed for the general JSSP.The computational complexity of the test algorithm and the repair algorithm is both O（n） under the worst-case scenario,and O（2J＋M） for the repair algorithm under the best-case scenario.The repair algorithm is not limited to specific optimization methods,such as local tabu search,genetic algorithms and shifting bottleneck procedures for job shop scheduling,but applicable to generic infeasible solutions for the JSSP to achieve feasibility.
文摘针对配电网规划中分布式新能源出力随机性大、规划复杂度高的问题,提出一种含分布式新能源的配电网风险规划模型。该模型以网络综合费用最小为目标函数,通过网络支路负荷容量确定新建分布式新能源出力最大值,综合考虑系统供电不足等网络风险因素,进行含分布式新能源的配电网风险规划。在求解过程中提出一种类比通信网络广播方式修复遗传算法不可行解的方法。通过在含分布式光伏发电和径流式水电站的安徽某地区10 k V网架规划中的实际应用,验证了该风险规划模型的有效性。
