The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain inde...The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain independent general purpose GA was used,which was an add-in to the spreadsheet software.An adaptation of the propritary GA software was demonstrated to the problem of minimizing the total completion time or makespan for simultaneous scheduling of machines and vehicles in flexible manufacturing systems.Computational results are presented for a benchmark with 82 test problems,which have been constructed by other researchers.The achieved results are comparable to the previous approaches.The proposed approach can be also applied to other problems or objective functions without changing the GA routine or the spreadsheet model.展开更多
This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-object...This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.展开更多
随着“双碳”目标下新型电力系统的发展,微电网规模日益增加,基于柔性互联的微电网群可实现微电网间互联互济,提高供电可靠性和经济性。针对柔性互联微电网群的优化调度问题,提出基于加速-鲁棒性目标级联法的微网群分层协同调度策略。首...随着“双碳”目标下新型电力系统的发展,微电网规模日益增加,基于柔性互联的微电网群可实现微电网间互联互济,提高供电可靠性和经济性。针对柔性互联微电网群的优化调度问题,提出基于加速-鲁棒性目标级联法的微网群分层协同调度策略。首先,分别制定峰、平、谷不同时刻调度策略,建立微网群双层模型,上层是以微网群运营为主体的经济调度模型,下层是以子微网为主体的经济调度模型。其次,将智能软开关(soft open point,SOP)连在子微网末端的公共点,通过SOP实现子微网之间的互联,将微网与主网之间的交换功率作为耦合变量,采用加速-鲁棒性目标级联法实现上、下层模型的优化求解。最后,由算例分析表明:基于加速-鲁棒性目标级联法的优化调度方案能减少系统运行成本,实现整个微网群系统的协同优化调度。展开更多
文摘The problem of simultaneous scheduling of machines and vehicles in flexible manufacturing system (FMS) was addressed.A spreadsheet based genetic algorithm (GA) approach was presented to solve the problem.A domain independent general purpose GA was used,which was an add-in to the spreadsheet software.An adaptation of the propritary GA software was demonstrated to the problem of minimizing the total completion time or makespan for simultaneous scheduling of machines and vehicles in flexible manufacturing systems.Computational results are presented for a benchmark with 82 test problems,which have been constructed by other researchers.The achieved results are comparable to the previous approaches.The proposed approach can be also applied to other problems or objective functions without changing the GA routine or the spreadsheet model.
基金supported by the National Key Research and Development Program of China(2016YFD0700605)the Fundamental Research Funds for the Central Universities(JZ2016HGBZ1035)the Anhui University Natural Science Research Project(KJ2017A891)
文摘This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.
文摘随着“双碳”目标下新型电力系统的发展,微电网规模日益增加,基于柔性互联的微电网群可实现微电网间互联互济,提高供电可靠性和经济性。针对柔性互联微电网群的优化调度问题,提出基于加速-鲁棒性目标级联法的微网群分层协同调度策略。首先,分别制定峰、平、谷不同时刻调度策略,建立微网群双层模型,上层是以微网群运营为主体的经济调度模型,下层是以子微网为主体的经济调度模型。其次,将智能软开关(soft open point,SOP)连在子微网末端的公共点,通过SOP实现子微网之间的互联,将微网与主网之间的交换功率作为耦合变量,采用加速-鲁棒性目标级联法实现上、下层模型的优化求解。最后,由算例分析表明:基于加速-鲁棒性目标级联法的优化调度方案能减少系统运行成本,实现整个微网群系统的协同优化调度。
