An Improved ACS Algorithm for the Solutions of Larger TSP Problems
Solving large traveling salesman problem (TSP) in an efficient way is a challenging area for the researchers of computer science. This paper presents a modified version of the ant colony system (ACS) algorithm called Red-Black Ant Colony System (RB-ACS) for the solutions of TSP which is the most prominent member of the combinatorial optimization problem. RB-ACS uses the concept of ant colony system together with the parallel search of genetic algorithm for obtaining the optimal solutions quickly. In this paper, it is shown that the proposed RB-ACS algorithm yields significantly better performance than the existing best-known algorithms.
Code (0)
등록된 구현이 없습니다.
Tasks
Combinatorial OptimizationTraveling Salesman ProblemSimilar Papers 제목 키워드 기반
Polynomial Solvers for Saturated Ideals
In this paper we present a new method for creating polynomial solvers for problems where a (possibly infinite) subset of the solutions are undesirable or uninteresting. These solutions typically arise from simplification…
Scaling Up Cartesian Genetic Programming through Preferential Selection of Larger Solutions
We demonstrate how efficiency of Cartesian Genetic Programming method can be scaled up through the preferential selection of phenotypically larger solutions, i.e. through the preferential selection of larger solutions am…
regressionApplying Partial-ACO to Large-scale Vehicle Fleet Optimisation
Optimisation of fleets of commercial vehicles with regards scheduling tasks from various locations to vehicles can result in considerably lower fleet traversal times. This has significant benefits including reduced expen…
SchedulingShape-constrained Symbolic Regression -- Improving Extrapolation with Prior Knowledge
We investigate the addition of constraints on the function image and its derivatives for the incorporation of prior knowledge in symbolic regression. The approach is called shape-constrained symbolic regression and allow…
Evolutionary AlgorithmsregressionSymbolic RegressionInteger linear programming for unsupervised training set selection in molecular machine learning
Integer linear programming (ILP) is an elegant approach to solve linear optimization problems, naturally described using integer decision variables. Within the context of physics-inspired machine learning applied to chem…