置换优化的k-交换技术的有向图描述及自适应算法系统
Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system
摘要：
本文介绍了一个一般的一瞥使用元素交换技术的优化排列。提出了问题的多层次描述，这是理解排列上优化问题的性质和复杂性的基础（例如，排序、调度、旅行商问题）。该描述基于几种类型的置换邻域（例如，通过目标函数的改进）。我们提出的运算有向图及其类型可以被认为是理解置换上组合优化问题的凸性和多项式可解性的一种方法。讨论了问题分析和层次结构设计的问题。讨论导致一个多层次的自适应算法系统，分析一个单独的问题，并选择/设计一个解决策略（轨迹）。
英文摘要：
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fundamental to understand nature and complexity of optimization problems over permutations (e.g., ordering, scheduling, traveling salesman problem). The description is based on permutation neighborhoods of several kinds (e.g., by improvement of an objective function). Our proposed operational digraph and its kinds can be considered as a way to understand convexity and polynomial solvability for combinatorial optimization problems over permutations. Issues of an analysis of problems and a design of hierarchical heuristics are discussed. The discussion leads to a multi-level adaptive algorithm system which analyzes an individual problem and selects/designs a solving strategy (trajectory).
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
