Firstly, two satisfaction degree indices are provided for each edge by considering the influences of the distance and the cost weight. In order to efficiently solve the problem, a hybrid genetic algorithm is proposed. In the present paper, a bi- objective traveling salesman problem (BOTSP) is taken into account, where both the distance and the cost are taken as optimization objectives. When more than one optimization objective arises, the problem is known as a multi- objective TSP. The traveling salesman problem (TSP) is a typical combinatorial optimization problem, in a traditional TSP only tour distance is taken as a unique objective to be minimized.
Results of applying the algorithm to real data from telescopic observations of a star field are presented.Ī hybrid genetic algorithm for solving bi- objective traveling salesman problems This application of genetic algorithms is unusual in that it uses a powerful domain-specific operation as a genetic operator. Schulenburg, N.Ī hybrid genetic algorithm is described for performing the difficult optimization task of resolving closely spaced objects appearing in space based and ground based surveillance data.
A hybrid genetic algorithm for resolving closely spaced objectsĪbbott, R.
0 kommentar(er)
