.png){kind=icon}
返回
Solving multitrip pickup and delivery problem with time windows and manpower planning using multiobjective algorithms
.png){kind=icon}
PRE
AI
DOI：10.1109/JAS.2020.1003204.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The multitrip pickup and delivery problem with time windows and manpower planning (MTPDPTW-MP) determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP (MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection (MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.
Keyword:
Adaptive neighborhood selection
manpower planning
multiobjective optimization
multitrip
pickup and delivery problem with time windows
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
I
IF:
19.2
论文数:
1.4K
被引数:
1.1W
机构
引用论文
暂无论文信息