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

Decomposition based hybrid metaheuristics

Raidl, Guenther R.*
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH2015-7-1DOI: 10.1016/j.ejor.2014.12.005
38被引4阅读
引用收藏
分享

摘要

Difficult combinatorial optimization problems coming from practice are nowadays often approached by hybrid metaheuristics that combine principles of classical metaheuristic techniques with advanced methods from fields like mathematical programming, dynamic programming, and constraint programming. If designed appropriately, such hybrids frequently outperform simpler "pure" approaches as they are able to exploit the underlying methods' individual advantages and benefit from synergy. This article starts with a general review of design patterns for hybrid approaches that have been successful on many occasions. More complex practical problems frequently have some special structure that might be exploited. In the field of mixed integer linear programming, three decomposition techniques are particularly well known for taking advantage of special structures: Lagrangian decomposition, Dantzig-Wolfe decomposition (column generation), and Benders' decomposition. It has been recognized that these concepts may also provide a very fruitful basis for effective hybrid metaheuristics. We review the basic principles of these decomposition techniques and discuss for each promising possibilities for combinations with metaheuristics. The approaches are illustrated with successful examples from literature.

学科与关键词

关键词
Combinatorial optimizationMetaheuristicsMixed integer programmingHybrid optimization approachesDecomposition techniques
相关
加载中…
  • 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.
  • Combining metaheuristics with mathematical programming, constraint programming and machine learning
    Talbi, El-Ghazali*4OR-A Quarterly Journal of Operations Research, 2013, 11(2): 101-150.被引 20
查看全部 →

发表信息

论文状态
公开发表
期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
发表日期
2015-07-01
卷期
第 244 卷, 第 1 期
页码
66-76
DOI
10.1016/j.ejor.2014.12.005
语言
ENGLISH
期刊收录
SCIE
期刊等级
Q1
成果收录
SCIE
资助标注
Vienna Science and Technology Fund (WWTF) [ICT10-027]; Austrian Science Fund, Austria (FWF) [P24660]; Austrian Science Fund (FWF) [P24660] Funding Source: Austrian Science Fund (FWF)

作者

  • R

    Raidl, Guenther R. (通讯) (第一作者)

登录解锁更多功能

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

产品服务

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

服务支持

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

联系方式

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

关注或下载科研之友

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

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

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