arrow
返回

Measuring instance difficulty for combinatorial optimization problems

delete2012-05-01
delete147
PRE
AI
K
Kate Smith‐Miles *
L
Leo Lopes
DOI:10.1016/j.cor.2011.07.006delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Discovering the conditions under which an optimization algorithm or search heuristic will succeed or fail is critical for understanding the strengths and weaknesses of different algorithms, and for automated algorithm selection. Large scale experimental studies - studying the performance of a variety of optimization algorithms across a large collection of diverse problem instances - provide the resources to derive these conditions. Data mining techniques can be used to learn the relationships between the critical features of the instances and the performance of algorithms. This paper discusses how we can adequately characterize the features of a problem instance that have impact on difficulty in terms of algorithmic performance, and how such features can be defined and measured for various optimization problems. We provide a comprehensive survey of the research field with a focus on six combinatorial optimization problems: assignment, traveling salesman, and knapsack problems, bin-packing, graph coloring, and timetabling. For these problems - which are important abstractions of many real-world problems - we review hardness-revealing features as developed over decades of research, and we discuss the suitability of more problem-independent landscape metrics. We discuss how the features developed for one problem may be transferred to study related problems exhibiting similar structures. (C) 2011 Elsevier Ltd. All rights reserved.
Keyword:
Algorithm selection
Combinatorial optimization
Hardness prediction
Instance difficulty
Landscape analysis
Phase transition
Traveling salesman problem
Assignment problem
Knapsack problem
Bin-packing
Graph coloring
Timetabling
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

M
Monash University
学者数:
5.4W
论文数: 5.4W
被引数: 79
引用论文

引用论文

Transendothelial Migration of Hematopoietic Progenitor Cells
err2006-01-25
err0
PREAI
errROBERT MÖHLE; FRANK BAUTZ; CLAUDIO DENZLINGER; LOTHAR KANZ
err分享
err收藏
err分享
err收藏
The TSP phase transition
err1996-12-01
err91
PREAI
errGent, IP; Walsh, T
err分享
err收藏
学者 查看更多内容