Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system

Computer Science – Data Structures and Algorithms

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

11 pages, 6 figures

Scientific paper

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).

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-559132

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.