Lie Yan
Abstract
The framework is given for solving combinatorial optimization problems with Line up Competition Algorithm (LCA), and the two principles of determining mutation neighbor region is presented. By using LCA to solve traveling salesman problem , satisfactory results are obtained. Examples show that LCA has good global search characteristic.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
The framework is given for solving combinatorial optimization problems with Line up Competition Algorithm (LCA), and the two principles of determining mutation neighbor region is presented. By using LCA to solve traveling salesman problem , satisfactory results are obtained. Examples show that LCA has good global search characteristic.
Key concepts: Travelling salesman problem, Mathematical optimization, 2-opt, Line (geometry), Computer science, Combinatorial optimization, Algorithm, Competition (biology)