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

A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants

Elshaer, Raafat*; Awad, Hadeer
COMPUTERS & INDUSTRIAL ENGINEERING2020-2DOI: 10.1016/j.cie.2019.106242
166被引9阅读
引用收藏
分享

摘要

Recently, a taxonomic review of the Vehicle Routing Problem (VRP) literature published between 2009 and June 2015 stated that most of the surveyed articles use metaheuristics for solving the problem and its variants. As extension to that work, this paper serves two-fold objectives: first, classifying the VRP and its variants solved using metaheuristic algorithms; second, investigating the contribution of each metaheuristic algorithm in solving the VRP problems. Based on a metaheuristic classification, we classify 299 VRP articles published between 2009 and 2017. The results are analyzed to reveal the usage trends of the algorithms and the solved VRP variants for showing the ones that are most popular, and those that are promising topics for future research.

学科与关键词

关键词
MetaheuristicsVehicle Routing ProblemTaxonomic review
相关
加载中…

文献加载失败,请重试

重试

发表信息

论文状态
公开发表
期刊
COMPUTERS & INDUSTRIAL ENGINEERING
发表日期
2020-02
卷期
第 140 卷
页码
106242
DOI
10.1016/j.cie.2019.106242
语言
MULTI-LANGUAGE
期刊收录
NSL.SCIE
期刊等级
2区
成果收录
SCIE

作者

  • E

    Elshaer, Raafat (通讯) (第一作者)

  • A

    Awad, Hadeer

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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