The most basic heuristic algorithms are the Random, Degree, and Centrality heuristic algorithms proposed by Kempe et al. [23]. Based on the degree of the heuristic algorithm, Chen et al. [41] proposed a heuristi
The main objective of the current chapter is to investigate and compare the coverage, success rate (SR), and stability of various heuristic algorithms in software structural test generation. To achieve this, the effectiveness of seven algorithms, genetic algorithm (GA), simulated annealing (SA), ...
A computational study of lp-based heuristic algorithms for two-dimensional guillotine cutting stock problems. OR Spectrum, 24(2):179-192, 2002.Ramon Alvarez-Valdes,Antonio Parajon,Tamarit J M. A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock ...
The multiprocessor scheduling is one of the NP-complete scheduling problems. This problem comes when a known parallel program must be executed on a parallel computer. Different methods and algorithmsdoi:10.1007/978-3-642-12538-6_25Pascal RebreyendCedric ClugeryEmmanuel Hily...
In addition, the Particle Swarm Optimization and Rao algorithms are improved to obtain the optimal PV array configuration under PSC. The operation of switching is enhanced by simultaneously considering the total switching times and the operation of highly active switches. The simulation results on the...
The heuristic algorithms thus developed are tested by controlling problem size, setup time, demand variability, and capacity change costs in test problems. The empirical results indicate that the proposed heuristic algorithms reduce CPU time as well as the number of iterations with only a slight ...
Due to the computational intractability in getting optimal solution for large scale real-life sized problems, we propose nine variants of Apparent Tardiness Cost (ATC) based greedy heuristic algorithms (GHA). From the series of computational experiments carried out it is observed that out of nine ...
关键词: Algorithms; Efficiency; Garages (parking); Heuristic algorithms; Parking; Remote control; Software engineering; Heuristic model; Higher efficiency; Parking guidance systems; Parking lots; Priority Heuristic; Search process; Selection systems; Theory model; Game theory; ...
a heuristic algorithm which combines the taboo search algorithm with the gradient descent method based on the adaptive step length and dichotomous search is proposed. 50 equal sphere instances are tested. The proposed algorithm approves the results of 44 instances obtained by previous algorithms. The ...
Several GA-based algorithms [7], [8], [9], [10], [11] have been proposed for solving Steiner tree problem without QoS constraints. Also, Sun [18] has extended the algorithm proposed in [10] for the least-cost multicast routing problem with one QoS constraint (delay). For deploying ...