ScholarMate
English简体中文繁體中文
客服热线:400-1616-289
登录注册
期刊论文

Decomposition Based Multi-Objective Variable Neighborhood Descent Algorithm for Logistics Dispatching

Lan, Yu-Lin; Liu, Fagui*; Ng, Wing W. Y.*; Zhang, Jun; Gui, Mengke
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE2021-10DOI: 10.1109/TETCI.2020.3002228
10被引23阅读
引用收藏
分享

摘要

Vehicle routing problem with time window (VRPTW) is the most representative optimization problem in logistics researches, which appears to be a multi-objective optimization problem in essence. However, most previous studies transform it into a single objective optimization problem to deal with. Also, the vehicle routing models in related studies focus on minimizing the cost. However, the efficiency (e.g., the waiting time due to early arrivals) and customer satisfaction equally important as the cost for the long-term development of logistics companies. In this article, a corresponding tri-objective VRPTW model for logistics dispatching is introduced, and a decomposition-based multi-objective variable neighborhood descent algorithm (D-VND) is proposed to solve the tri-objective VRPTW. In D-VND, the tri-objective VRPTW is decomposed into multiple single-objective sub-problems via a set of uniformly distributed weight vectors and then the route-based evolutionary operator is used to generate the offspring. Meanwhile, the objective-wise neighborhood operators are incorporated into the variable neighborhood descent method as local searches to improve qualities of sub-problems. Moreover, we adopt a heuristic initialization strategy and an external archive mechanism based on fast sorting and crowding distance methods to improve the performance of D-VND. Experimental results on benchmarking datasets with different scales show that D-VND outperforms two other representative algorithms regarding convergence and diversity and yields better solutions.

学科与关键词

关键词
OptimizationLogisticsSearch problemsDispatchingMicrosoft WindowsCustomer satisfactionEvolutionary computationDecompositionmulti-objective optimizationvariable neighborhood descentvehicle routing problem with time window (VRPTW)
相关
加载中…
  • A Decomposition-Based Local Search for Large-Scale Many-Objective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows
    Zhou, Ying*; Kong, Lingjing; Cai, Yiqiao; Wu, Ziyan; Liu, Shaopeng*; Hong, Jiaming; Wu, KekeIEEE Systems Journal, 2020, 14(4): 5253-5264.被引 14
  • Multiobjective Vehicle Routing Problems With Simultaneous Delivery and Pickup and Time Windows: Formulation, Instances, and Algorithms
    Wang, Jiahai*; Zhou, Ying; Wang, Yong; Zhang, Jun; Chen, C. L. Philip; Zheng, ZibinIEEE Transactions on Cybernetics, 2016, 46(3): 582-594.被引 146
  • Solving many-objective delivery and pickup vehicle routing problem with time windows with a constrained evolutionary optimization algorithm
    Ou, Junwei; Liu, Xiaolu*; Xing, Lining; Lv, Jimin; Hu, Yaru; Zheng, Jinhua; Zou, Juan; Li, MengjunEXPERT SYSTEMS WITH APPLICATIONS, 2024, 255: 124712.
查看全部 →

发表信息

论文状态
公开发表
期刊
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE
发表日期
2021-10
卷期
第 5 卷, 第 5 期
页码
826-839
DOI
10.1109/TETCI.2020.3002228
成果收录
SCIE
资助标注
Major Program of Guangdong Basic and Applied Research [2019B030302002]; Engineering and Technology Research Center of Guangdong Province for Logistics Supply Chain and Internet of Things [GDDST[2016]176]; Key Laboratory of Cloud Computing for Super-Integration Cloud Computing in Guangdong Province [610245048129]; Engineering and Technology Research Center of Guangdong Province for Big Data Intelligent Processing [GDDST[2013]1513-1-11]; "Made in China 2025" Industrial Development Fund Project of Guangzhou [x2jsD8183470]; National Natural Science Foundation of China [61876066]; Guangdong Province Science and Technology Plan Project (Collaborative Innovation and Platform Environment Construction) [2019A050510006]

作者

  • L

    Lan, Yu-Lin (第一作者)

  • L

    Liu, Fagui (通讯)

查看全部 5 位作者收起作者
  • N

    Ng, Wing W. Y. (通讯)

  • Z

    Zhang, Jun

  • G

    Gui, Mengke

登录解锁更多功能

  • 收藏这篇,随时在“我的 · 收藏”找回
  • 认领你的成果,生成推广素材
  • 关注作者获取最新成果
  • 加入项目组、协同写作
注册 / 登录

产品服务

  • 科研之友
  • 创新城
  • 科创云

服务支持

  • 帮助中心
  • 隐私政策
  • 服务条款

联系方式

在线客服:【】
客服热线:400-1616-289
电子邮箱:support@scholarmate.com

关注或下载科研之友

微信二维码
微信公众号
客户端下载二维码
下载客户端
科研成果科研人员科研机构科研动态爱瑞思软件

©2026 深圳市科研之友网络服务有限公司

公安备案图标粤公网安备 44030502000213
粤ICP备 16046710 号粤B2-20110417