基于混合禁忌搜索算法的分时电价下并行机调度优化  

Hybrid Tabu Search Algorithm for Parallel-Machine Scheduling Optimization under Time-of-Use Tariffs

作　　者：吴宇娟 WU Yu-juan(School of Management Science & Engineering, Anhui University of Technology, Ma'anshan 243032)

机构地区：[1]安徽工业大学管理科学与工程学院,马鞍山243032

出　　处：《现代计算机》2019年第13期26-31,共6页Modern Computer

摘　　要：研究分时电价下以最小化总用电成本为目标的相同并行机调度问题。为了解决这个问题,构建一个连续时间混合整数线性规划(MILP)模型,同时设计一个禁忌搜索-多级过滤贪婪插入启发式混合算法。该算法中多级过滤启发式对加工序列进行过滤和计算,禁忌搜索算法对加工序列进行迭代优化。实验结果证明模型及算法的有效性。Studies the identical parallel machines scheduling problem with the goal of minimizing total electricity costs under time-of-use tariffs. In order to solve this problem, constructs a continuous time mixed integer linear programming (MILP) model, and designs a Tabu searchmulti- level filtering greedy insertion heuristic hybrid algorithm. In this algorithm, the multi-stage filtering heuristic algorithm is used to filter and calculate the processing sequence, the Tabu search algorithm iteratively optimization the processing sequence. Experimental results demonstrate the effectiveness of the model and algorithm.

关 键 词：分时电价 相同并行机 调度 电力成本 

分 类 号：F426.61[经济管理—产业经济] TP301.6[自动化与计算机技术—计算机系统结构]