Search

INTRODUCTION: Traveling Salesman Problem (TSP) is one of the vast research areas and has been considered as subproblems in many fields apart from computer science and also in the field of computer science.OBJECTIVES: This paper deals with the comparison of Ant System Ant System (AS) which is a variant of Ant ColonyOptimization.METHODS: The performance of the Ant System is analysed by applying it on the Travelling Salesman Problem (TSP).The optimal results found on TSP using AS has been analysed with the elapsed time taken to find the optimal results, itsmean, median, variance and the standard deviation.RESULTS: And also, the quality of solutions has been made by calculating the percentage of the optimality and thedeviation of the solutions from the TSPLIB provides best known solutions. For instances, TSPLIB data sets have beenused.CONCLUSION: Totally, 7 instances have been executed with three different set of parameters for AS and the results areanalysed in terms of different parameter settings and performance metrics on each of it. The role of parameters has alsobeen discussed along with the experimental results.

Multi-Depot Vehicle Routing Problem (MDVRP) is a familiar combinative optimization problem that simultaneously determines the direction for different vehicles from over one depot to a collection of consumers. Researchers have suggested variety of meta-heuristic and heuristic algorithms to elucidate MDVRP, but none of the existing technique hasimproved the fitness of the solution at the time of initial population generation. This motivates to propose an enhanced ODV based population initialization for Genetic Algorithm (GA) to solve MDVRP effectively. The Ordered Distance Vector (ODV) based population seeding method is a current and effective population initialization method for Genetic Algorithm to produce an early population with quality, individual diversity and randomness. In the proposed model, the customers are first grouped based on distance to their nearest depots and then routes are scheduled and optimized usingenhanced ODV based GA. The experiments are performed based on different types of instances of Cordeau. From the experimental results, it is very clear that the proposed technique outperforms the existing techniques in terms of convergence rate, error rate and convergence diversity.

The usage of the internet has increased rapidly from the past few years. Thus it automatically increases the internet traffic. In the internet, a web server always responds to the client or web browser's requests. The major feature of a web server is to be available, scalable and predictable. So the core part to be concentrated is web server load balancing. Load balancing plays a vital role in allocating the jobs to the web server based on its status. There are various policies available for web server load balancing. Each of these policies came into existence based on the certain needs. In this paper, we have examined the latest policies of web server load balancing.