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

Explicit Evolutionary Multitasking for Combinatorial Optimization: A Case Study on Capacitated Vehicle Routing Problem

Feng, Liang*; Huang, Yuxiao; Zhou, Lei; Zhong, Jinghui; Gupta, Abhishek; Tang, Ke; Tan, Kay Chen重庆大学
IEEE Transactions on Cybernetics2021-6DOI: 10.1109/TCYB.2019.2962865
80被引6阅读
引用收藏
分享

摘要

Recently, evolutionary multitasking (EMT) has been proposed in the field of evolutionary computation as a new search paradigm, for solving multiple optimization tasks simultaneously. By sharing useful traits found along the evolutionary search process across different optimization tasks, the optimization performance on each task could be enhanced. The autoencoding-based EMT is a recently proposed EMT algorithm. In contrast to most existing EMT algorithms, which conduct knowledge transfer across tasks implicitly via crossover, it intends to perform knowledge transfer explicitly among tasks in the form of task solutions, which enables the employment of task-specific search mechanisms for different optimization tasks in EMT. However, the autoencoding-based explicit EMT can only work on continuous optimization problems. It will fail on combinatorial optimization problems, which widely exist in real-world applications, such as scheduling problem, routing problem, and assignment problem. To the best of our knowledge, there is no existing effort working on explicit EMT for combinatorial optimization problems. Taking this cue, in this article, we thus embark on a study toward explicit EMT for combinatorial optimization. In particular, by using vehicle routing as an illustrative combinatorial optimization problem, the proposed explicit EMT algorithm (EEMTA) mainly contains a weighted l(1)-normregularized learning process for capturing the transfer mapping, and a solution-based knowledge transfer process across vehicle routing problems (VRPs). To evaluate the efficacy of the proposed EEMTA, comprehensive empirical studies have been conducted with the commonly used vehicle routing benchmarks in multitasking environment, against both the state-of-the-art EMT algorithm and the traditional single-task evolutionary solvers. Finally, a real-world combinatorial optimization application, that is, the package delivery problem (PDP), is also presented to further confirm the efficacy of the proposed algorithm.

学科与关键词

关键词
Evolutionary optimizationknowledge transfermultitask optimizationrouting problem
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
IEEE Transactions on Cybernetics
发表日期
2021-06
卷期
第 51 卷, 第 6 期
页码
3143-3156
DOI
10.1109/TCYB.2019.2962865
语言
ENGLISH
期刊收录
NSL
期刊等级
1区
成果收录
SCIE
资助标注
National Natural Science Foundation of China [61876025, 61602181]; Venture and Innovation Support Program for Chongqing Overseas Returnees [cx2018044, cx2019020]; City University of Hong Kong Research Fund [9610397]; Research Grants Council of the Hong Kong Special Administrative Region, China [CityU11202418, CityU11209219]; Shenzhen Scientific Research and Development Funding Program [JCYJ20180307123637294]; Scientific and Technological Innovation Foundation of Chongqing [cstc2019yszx-jscxX0001]; Fundamental Research Funds for the Central Universities [D2191200]

作者

  • F

    Feng, Liang (通讯) (第一作者)

    chongqing univ

  • H

    Huang, Yuxiao

    chongqing univ

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

    Zhou, Lei

    chongqing univ

  • Z

    Zhong, Jinghui

  • G

    Gupta, Abhishek

  • T

    Tang, Ke

  • T

    Tan, Kay Chen

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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