Optimization Strategies for Integrated Knapsack and Traveling Salesman Problems

被引：10

作者：

Beham, Andreas ^{[1
,2
]}

Fechter, Judith ^{[1
,2
]}

Kommenda, Michael ^{[1
,2
]}

Wagner, Stefan ^{[1
]}

Winkler, Stephan M. ^{[1
]}

Affenzeller, Michael ^{[1
,2
]}

机构：

[1] Univ Appl Sci Upper Austria, Heurist & Evolutionary Algorithms Lab, Sch Informat Commun & Media, Hagenberg Campus,Softwarepk 11, A-4232 Hagenberg, Austria

[2] Johannes Kepler Univ Linz, Inst Formal Models & Verificat, A-4040 Linz, Austria

来源：

COMPUTER AIDED SYSTEMS THEORY - EUROCAST 2015 | 2015年 / 9520卷

关键词：

ORIENTEERING PROBLEM;

D O I：

10.1007/978-3-319-27340-2_45

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

In the optimization of real-world activities the effects of solutions on related activities need to be considered. The use of isolated problem models that do not adequately consider related processes does not allow addressing system-wide consequences. However, sometimes the complexity of the real-world model and its interplay with related activities can be described by a combination of simple, existing, problems. In this work we aim to discuss strategies to combine existing algorithms for simple problems in order to solve a more complex master problem. New challenges arise in such an integrated optimization approach.

引用

页码：359 / 366

页数：8

共 7 条

[1] A fast and effective heuristic for the orienteering problem [J].