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

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, Keke广东技术师范学院; 广州中医药大学; 深圳信息职业技术学院
IEEE Systems Journal2020-12DOI: 10.1109/JSYST.2019.2959664
14被引10阅读
引用收藏
分享

摘要

Vehicle routing problem with simultaneous delivery and pickup and time windows (VRPSDPTW) is an important logistics problem in supply chain network optimization. However, at present, existing approaches are only applied to solve small-scale many-objective VRPSDPTW. For the large-scale problem, to obtain high-quality solutions (effectively) and solve the problem in a short running time (efficiently), we focus on two issues: 1) how to handle many-objective property and 2) how to tackle large-scale property of the problem. For the first issue, to enhance the convergence property, a novel local search algorithm utilizing seven neighborhood operators is proposed. Meanwhile, to maintain the diversity property, the concept of decomposition is adopted. The problem is first decomposed into multiple single-objective problems, then local search is utilized to optimize these subproblems. For the second issue, since optimizing a subproblem by local search is time consuming for large-scale problems, the key point is how to allocate the computational resources and balance the convergence and diversity. To handle this problem, a weight space partition strategy is introduced. Finally, a decomposition-based local search algorithm is proposed for many-objective VRPSDPTW. Experimental results on the large-scale instances provided by Chinese logistic company show the effectiveness of the proposed algorithm.

学科与关键词

关键词
Search problemsOptimizationLogisticsTime factorsDelaysVehicle routingConvergenceLarge-scale problemmany-objective optimizationsimultaneous delivery and pickuptime windowsvehicle routing problem
相关
加载中…
  • 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
  • Decomposition Based Multi-Objective Variable Neighborhood Descent Algorithm for Logistics Dispatching
    Lan, Yu-Lin; Liu, Fagui*; Ng, Wing W. Y.*; Zhang, Jun; Gui, MengkeIEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2021, 5(5): 826-839.被引 10
  • 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 Systems Journal
发表日期
2020-12
卷期
第 14 卷, 第 4 期
页码
5253-5264
DOI
10.1109/JSYST.2019.2959664
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
2区
成果收录
SCIE
资助标注
Natural Science Foundation of Guangdong Province of China [2018A0303130055, 2018A030310664, 2018A030313746, 2019A1515012048]; Natural Science Foundation of Fujian Province of China [2018J01091, JCYJ20170817114239348]; Elite Youth Education Program of Guangzhou University of ChineseMedicine [QNYC20170204]

作者

  • Z

    Zhou, Ying (通讯) (第一作者)

    shenzhen inst informat technol

  • K

    Kong, Lingjing

    shenzhen inst informat technol

查看全部 7 位作者收起作者
  • C

    Cai, Yiqiao

    huaqiao univ

  • W

    Wu, Ziyan

  • L

    Liu, Shaopeng (通讯)

    guangdong polytech normal univ

  • H

    Hong, Jiaming

    guangzhou univ chinese med

  • W

    Wu, Keke

    shenzhen inst informat technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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