调度(生产过程)
计算机科学
旅行时间
编码(内存)
作业车间调度
实时计算
数学优化
响应时间
运筹学
计算机网络
人工智能
工程类
数学
运输工程
布线(电子设计自动化)
计算机图形学(图像)
作者
Wenjun Lin,Paul Babyn,Yan Yan,Wenjun Zhang
标识
DOI:10.1080/17517575.2023.2188124
摘要
This paper proposes a new scheduling problem for patient visits with two objectives: minimizing patient waiting time and travel time. It also presents a novel encoding method for Genetic Algorithms (GA) that is well-suited for this problem. Experiments demonstrate that the proposed encoding method reduces optimization iterations by 17% compared to conventional methods, and the GA can decrease waiting time by up to 58.2% and travel time by up to 89.3% for specific examples. The novel scheduling problem and the encoding method are two main contributions of this work.
科研通智能强力驱动
Strongly Powered by AbleSci AI