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

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, Mengjun西安电子科技大学; 湘潭大学
EXPERT SYSTEMS WITH APPLICATIONS2024-12-1DOI: 10.1016/j.eswa.2024.124712
25阅读
引用收藏
分享

摘要

Vehicle routing problems (VRP) are a kind of typical combinational optimization problem, particularly in the logistics industry. This paper proposes a constrained evolutionary optimization algorithm, called CEOA, for solving many-objective VRP with simultaneous delivery, pickup, and time windows (VRPSDPTW). Specifically, we first define the weight value vectors based on the constraint satisfaction situation, which can adaptively adjust according to the feedback of population solutions during the search process. Subsequently, based on the feedback from the weight value vectors, the environmental selection strategy is employed to identify promising solutions for both infeasible and feasible situations. Furthermore, considering the data characteristics of the problem at hand, the crossover and mutation operations are tailored to better align with the VRPSDPTW, which is further explained and illustrated in detail regarding solution construction. The experimental results demonstrate the effectiveness of the proposed algorithm for VRPSDPTW in comparison with other state-of-the-art methods.

学科与关键词

关键词
Vehicle routing problemConstrained evolutionary optimizationalgorithmMany-objective optimizationConstraint satisfaction
相关
加载中…
  • 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
  • A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
    Tan, KC; Chew, YH; Lee, LHComputational Optimization and Applications, 2006, 34(1): 115-151.被引 162
  • 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
查看全部 →

发表信息

论文状态
公开发表
期刊
EXPERT SYSTEMS WITH APPLICATIONS
发表日期
2024-12-01
卷期
第 255 卷
页码
124712
DOI
10.1016/j.eswa.2024.124712
语言
ENGLISH
成果收录
SCIE
资助标注
Postdoctoral Fellowship Program of CPSF, China [GZC20241429]; National Natural Science Foundation of China [62176228, 62276224, 62306262]; Natural Science Foundation of Hunan Province, China [2022JJ40452, 2023JJ40637]; Project of Hunan Education Department, China [21C0077, 21A0444, 22B0139]; Xiaohe Sci-Tech Talents Special Funding under Hunan Provincial Sci-Tech Talents Sponsorship Program, China [2023TJ-X77]

作者

  • O

    Ou, Junwei (第一作者)

    natl univ def technol · xiangtan univ

  • L

    Liu, Xiaolu (通讯)

    natl univ def technol

查看全部 8 位作者收起作者
  • X

    Xing, Lining

    xidian univ

  • L

    Lv, Jimin

    natl univ def technol

  • H

    Hu, Yaru

    xiangtan univ

  • Z

    Zheng, Jinhua

    xiangtan univ

  • Z

    Zou, Juan

    xiangtan univ

  • L

    Li, Mengjun

    natl univ def technol

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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