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

Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances

Rahman, Md Ashikur*; Sokkalingam, Rajalingam; Othman, Mahmod; Biswas, Kallol; Abdullah, Lazim; Abdul Kadir, Evizal
Mathematics2021-10DOI: 10.3390/math9202633
29被引10阅读
引用收藏
分享

摘要

Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution. As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been implemented in a wide area of combinatorial optimization problems. Metaheuristic algorithms have been evolved and modified with respect to the problem nature since it was recommended for the first time. As there is a growing interest in incorporating necessary methods to develop metaheuristics, there is a need to rediscover the recent advancement of metaheuristics in combinatorial optimization. From the authors' point of view, there is still a lack of comprehensive surveys on current research directions. Therefore, a substantial part of this paper is devoted to analyzing and discussing the modern age metaheuristic algorithms that gained popular use in mostly cited combinatorial optimization problems such as vehicle routing problems, traveling salesman problems, and supply chain network design problems. A survey of seven different metaheuristic algorithms (which are proposed after 2000) for combinatorial optimization problems is carried out in this study, apart from conventional metaheuristics like simulated annealing, particle swarm optimization, and tabu search. These metaheuristics have been filtered through some key factors like easy parameter handling, the scope of hybridization as well as performance efficiency. In this study, a concise description of the framework of the selected algorithm is included. Finally, a technical analysis of the recent trends of implementation is discussed, along with the impacts of algorithm modification on performance, constraint handling strategy, the handling of multi-objective situations using hybridization, and future research opportunities.

学科与关键词

关键词
combinatorial optimizationmetaheuristic optimizationvehicle routing problemstravelling salesman problemssupply chain design optimizationconstraint handling
相关
加载中…
  • Metaheuristics in combinatorial optimization
    Gendreau, M; Potvin, JYAnnals of Operations Research, 2005, 140(1): 189-213.被引 179
  • Hybrid metaheuristics in combinatorial optimization: A survey
    Blum, Christian*; Puchinger, Jakob; Raidl, Guenther R.; Roli, AndreaAPPLIED SOFT COMPUTING, 2011, 11(6): 4135-4151.被引 534
  • Hybrid Metaheuristics in Combinatorial Optimization: A Tutorial
    Christian, BlumTheory and Practice of Natural Computing, Springer Berlin Heidelberg, 1-10, 2012.
查看全部 →

发表信息

论文状态
公开发表
期刊
Mathematics
发表日期
2021-10
卷期
第 9 卷, 第 20 期
页码
2633
DOI
10.3390/math9202633
期刊收录
NSL
期刊等级
4区
成果收录
SCIE
资助标注
Center of Graduate Studies of Universiti Teknologi PETRONAS; YUTP research fund [015LCO-296]; Department of Fundamental and Applied Sciences of the Universiti Teknologi PETRONAS

作者

  • R

    Rahman, Md Ashikur (通讯) (第一作者)

  • S

    Sokkalingam, Rajalingam

查看全部 6 位作者收起作者
  • O

    Othman, Mahmod

  • B

    Biswas, Kallol

  • A

    Abdullah, Lazim

  • A

    Abdul Kadir, Evizal

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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