首页|期刊导航|自动化学报（英文版）|Solving Multitrip Pickup and Delivery Problem With Time Windows and Manpower Planning Using Multiobjective Algorithms

Solving Multitrip Pickup and Delivery Problem With Time Windows and Manpower Planning Using Multiobjective Algorithms

Jiahai Wang Yuyan Sun Zizhen Zhang Shangce Gao

自动化学报（英文版）2020，Vol.7Issue(4)：1134-1153,20.

自动化学报（英文版）2020，Vol.7Issue(4)：1134-1153,20.DOI:10.1109/JAS.2020.1003204

Solving Multitrip Pickup and Delivery Problem With Time Windows and Manpower Planning Using Multiobjective Algorithms

Jiahai Wang ¹Yuyan Sun ²Zizhen Zhang ²Shangce Gao³

作者信息

1. Guangdong Key Laboratory of Big Data Analysis and Processing, Sun Yat-sen University, Guangzhou 510275, China
2. Department of Computer Science,Sun Yat-sen University, Guangzhou 510275, China
3. Faculty of Engineering, University of Toyama,Toyama-shi 930-8555, Japan
折叠

摘要

关键词

Adaptive neighborhood selection/manpower planning/multiobjective optimization/multitrip/pickup and delivery problem with time windows

Key words

Adaptive neighborhood selection/manpower planning/multiobjective optimization/multitrip/pickup and delivery problem with time windows

引用本文复制引用

Jiahai Wang,Yuyan Sun,Zizhen Zhang,Shangce Gao..Solving Multitrip Pickup and Delivery Problem With Time Windows and Manpower Planning Using Multiobjective Algorithms[J].自动化学报（英文版）,2020,7(4):1134-1153,20.

基金项目

This work was supported by the National Key R&D Program of China (2018AAA0101203), the National Natural Science Foundation of China (61673403, 71601191), and the JSPS KAKENHI(JP17K12751). （2018AAA0101203）

自动化学报（英文版）

OACSCDCSTPCDEI

ISSN：2329-9266

访问量0

下载量0

段落导航