首页> 外文会议>International Conference on Learning and Intelligent Optimization >A Cooperative Learning Approach for the Quadratic Knapsack Problem
【24h】

A Cooperative Learning Approach for the Quadratic Knapsack Problem

机译:二次背包问题的合作学习方法

获取原文

摘要

The Quadratic Knapsack Problem (QKP) is a well-known optimization problem aimed to maximize a quadratic objective function subject to linear capacity constraints. It has several applications in different fields such as telecommunications, graph theory, logistics, hydrology and data allocation, among others. In this paper, we propose the application of a novel population-based metaheuristic referred to as Multi-leader Migrating Birds Optimization (MMBO), which exploits the concepts of cooperation and communication along the search leading to a collective learning, to solve a wide range of well-known QKP instances.
机译:二次背包问题(QKP)是众所周知的优化问题,旨在最大化受线性容量约束的二次目标函数。它在电信,图论,物流,水文学和数据分配等不同领域中具有多种应用。在本文中,我们提出了一种新颖的基于人群的元启发式方法(称为多领导者迁移鸟优化(MMBO))的应用,该方法利用合作和交流的概念进行搜索,从而实现集体学习,从而解决了广泛的问题。著名的QKP实例。

著录项

  • 来源
  • 会议地点 Kalamata(GR)
  • 作者单位

    Institute of Information Systems University of Hamburg Hamburg Germany Department of Industrial Engineering and Business Information Systems University of Twente 7522NB Enschede The Netherlands;

    School of Computing Edinburgh Napier University Edinburgh UK Dpto. de Ingenieria Informatica y de Sistemas Universidad de La Laguna San Cristobal de La Laguna Spain;

    Institute of Information Systems University of Hamburg Hamburg Germany;

  • 会议组织
  • 原文格式 PDF
  • 正文语种
  • 中图分类
  • 关键词

  • 入库时间 2022-08-26 14:35:52

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号