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

The new optimization algorithm for the vehicle routing problem with time windows using multi-objective discrete learnable evolution model

Moradi, Behzad*
SOFT COMPUTING2020-5DOI: 10.1007/s00500-019-04312-9
31被引10阅读
引用收藏
分享

摘要

This paper presents a new multi-objective discreet learnable evolution model (MODLEM) to address the vehicle routing problem with time windows (VRPTW). Learnable evolution model (LEM) includes a machine learning algorithm, like the decision trees, that can discover the correct directions of the evolution leading to significant improvements in the fitness of the individuals. We incorporate a robust strength Pareto evolutionary algorithm in the LEM presented here to govern the multi-objective property of this approach. A new priority-based encoding scheme for chromosome representation in the LEM as well as corresponding routing scheme is introduced. To improve the quality and the diversity of the initial population, we propose a novel heuristic manner which leads to a good approximation of the Pareto fronts within a reasonable computational time. Moreover, a new heuristic operator is employed in the instantiating process to confront incomplete chromosome formation. Our proposed MODLEM is tested on the problem instances of Solomon's VRPTW benchmark. The performance of this proposed MODLEM for the VRPTW is assessed against the state-of-the-art approaches in terms of both the quality of solutions and the computational time. Experimental results and comparisons indicate the effectiveness and efficiency of our proposed intelligent routing approach.

学科与关键词

关键词
Vehicle routing problem with time windows (VRPTW)Learnable evolution model (LEM)Multi-objective combinatorial optimization (MOCO)Strength Pareto evolutionary algorithm (SPEA)
相关
加载中…
  • 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
  • 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.
  • Multiobjective Vehicle Routing Optimization With Time Windows: A Hybrid Approach Using Deep Reinforcement Learning and NSGA-II
    Wu, Rixin; Wang, Ran*; Hao, Jie; Wu, Qiang; Wang, Ping; Niyato, DusitIEEE Transactions on Intelligent Transportation Systems, 2024.
查看全部 →

发表信息

论文状态
公开发表
期刊
SOFT COMPUTING
发表日期
2020-05
卷期
第 24 卷, 第 9 期
页码
6741-6769
DOI
10.1007/s00500-019-04312-9
语言
ENGLISH
期刊收录
NSL.SCIE
期刊等级
3区
成果收录
SCIE

作者

  • M

    Moradi, Behzad (通讯) (第一作者)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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