143 research outputs found

    Traveling Salesman Problem

    Get PDF
    The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance

    Population-Based Optimization Algorithms for Solving the Travelling Salesman Problem

    Get PDF
    [Extract] Population based optimization algorithms are the techniques which are in the set of the nature based optimization algorithms. The creatures and natural systems which are working and developing in nature are one of the interesting and valuable sources of inspiration for designing and inventing new systems and algorithms in different fields of science and technology. Evolutionary Computation (Eiben& Smith, 2003), Neural Networks (Haykin, 99), Time Adaptive Self-Organizing Maps (Shah-Hosseini, 2006), Ant Systems (Dorigo & Stutzle, 2004), Particle Swarm Optimization (Eberhart & Kennedy, 1995), Simulated Annealing (Kirkpatrik, 1984), Bee Colony Optimization (Teodorovic et al., 2006) and DNA Computing (Adleman, 1994) are among the problem solving techniques inspired from observing nature. In this chapter population based optimization algorithms have been introduced. Some of these algorithms were mentioned above. Other algorithms are Intelligent Water Drops (IWD) algorithm (Shah-Hosseini, 2007), Artificial Immune Systems (AIS) (Dasgupta, 1999) and Electromagnetism-like Mechanisms (EM) (Birbil & Fang, 2003). In this chapter, every section briefly introduces one of these population based optimization algorithms and applies them for solving the TSP. Also, we try to note the important points of each algorithm and every point we contribute to these algorithms has been stated. Section nine shows experimental results based on the algorithms introduced in previous sections which are implemented to solve different problems of the TSP using well-known datasets

    Algorithms for Combinatorial Optimization Problems

    Get PDF

    Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization

    Get PDF
    This paper addresses the parallel machine scheduling problem with family dependent setup times and total weighted completion time minimization. In this problem, when two jobs j and k are scheduled consecutively on the same machine, a setup time is performed between the finishing time of j and the starting time of k if and only if j and k belong to different families. The problem is strongly NP-hard and is commonly addressed in the literature by heuristic approaches and by branch-and-bound algorithms. Achieving proven optimal solution is a challenging task even for small size instances. Our contribution is to introduce five novel mixed integer linear programs based on concepts derived from one-commodity, arc-flow and set covering formulations. Numerical experiments on more than 13000 benchmark instances show that one of the arc-flow models and the set covering model are quite efficient, as they provide on average better solutions than state-of-the-art approaches, with shorter computation times, and solve to proven optimality a large number of open instances from the literature

    Lightning search algorithm: a comprehensive survey

    Full text link
    The lightning search algorithm (LSA) is a novel meta-heuristic optimization method, which is proposed in 2015 to solve constraint optimization problems. This paper presents a comprehensive survey of the applications, variants, and results of the so-called LSA. In LSA, the best-obtained solution is defined to improve the effectiveness of the fitness function through the optimization process by finding the minimum or maximum costs to solve a specific problem. Meta-heuristics have grown the focus of researches in the optimization domain, because of the foundation of decision-making and assessment in addressing various optimization problems. A review of LSA variants is displayed in this paper, such as the basic, binary, modification, hybridization, improved, and others. Moreover, the classes of the LSA’s applications include the benchmark functions, machine learning applications, network applications, engineering applications, and others. Finally, the results of the LSA is compared with other optimization algorithms published in the literature. Presenting a survey and reviewing the LSA applications is the chief aim of this survey paper

    Sine Cosine Algorithm for Optimization

    Get PDF
    This open access book serves as a compact source of information on sine cosine algorithm (SCA) and a foundation for developing and advancing SCA and its applications. SCA is an easy, user-friendly, and strong candidate in the field of metaheuristics algorithms. Despite being a relatively new metaheuristic algorithm, it has achieved widespread acceptance among researchers due to its easy implementation and robust optimization capabilities. Its effectiveness and advantages have been demonstrated in various applications ranging from machine learning, engineering design, and wireless sensor network to environmental modeling. The book provides a comprehensive account of the SCA, including details of the underlying ideas, the modified versions, various applications, and a working MATLAB code for the basic SCA
    • …
    corecore