求解多目标流水车间调度Pareto最优解的遗传强化算法.pdfVIP

计算机系统应用

ISSN

1003-3254,

CODEN

CSAOBNE-mail:

csa@

Computer

Systems

Applications,2024,33(2):239−245

[doi:

10.15888/ki.csa.009428]

©中国科学院软件研究所版权所有.Tel:

+86-10

求解多目标流水车间调度Pareto最优解的

遗传强化算法①

刘宇,

陈永灿,

周艳平

(青岛科技大学

信息科学技术学院,

青岛

266061)

通信作者:

周艳平,

E-mail:

ypzhou@

摘要:

针对多目标流水车间调度Pareto最优问题,

本文建立了以最大完工时间和最大拖延时间为优化目标的多

目标流水车间调度问题模型,

并设计了一种基于Q-learning的遗传强化学习算法求解该问题的Pareto最优解.

该算

法引入状态变量和动作变量,

通过Q-learning算法获得初始种群,

以提高初始解质量.

在算法进化过程中,

利用Q表

指导变异操作,

扩大局部搜索范围.

采用Pareto快速非支配排序以及拥挤度计算提高解的质量以及多样性,

逐步获

得Pareto最优解.

通过与遗传算法、NSGA-II算法和Q-learning算法进行对比实验,

验证了改进后的遗传强化算法

在求解多目标流水车间调度问题Pareto最优解的有效性.

关键词:

多目标流水车间调度;

Q-learning;

遗传算法;

Pareto

引用格式:

刘宇,陈永灿,周艳平.求解多目标流水车间调度Pareto最优解的遗传强化算法.计算机系统应用,2024,33(2):239–245.

http://www.c-s-

/1003-3254/9428.html

GeneticReinforcementAlgorithmforSolvingParetoOptimalSolutionsforMulti-objective

FlowShopScheduling

LIU

Yu,

CHEN

Yong-Can,

ZHOU

Yan-Ping

(School

of

Information

Science

Technology,

Qingdao

University

of

Science

and

Technology,

Qingdao

266061,

China)

Abstract:

Aiming

at

the

Pareto

optimal

problem

for

multi-objective

flow

shop

scheduling,

this

study

builds

a

multi-

objective

flow

shop

scheduling

problem

model

with

maximum

completion

time

and

maximum

delay

time

as

the

optimization

objectives.

Meanwhile,

the

study

designs

a

genetic

reinforcement

learning

algorithm

based

on

Q-learning

for

the

Pareto

optimal

solution

of

the

problem.

The

algorithm

introduces

state

variables

and

action

variables

and

obtains

the

initial

population

by

Q-learning

algorithm

to

improve

the

initial

solution

quality.

During

the

evolution

of

the

algorithm,

the

Q-table

is

applied

to

guide

the

mutation

operation

to

expand

the

local

search

range.

The

Pareto

fast

non-dominated

sorting

and

co