9,612 research outputs found

    Sequential and parallel local search for the time-constrained travelling salesman problem

    Get PDF
    Local search has proven to be an effective solution approach for the traveling salesman problem. We consider variants of the TSP in which each city is to be visited within one or more given time windows. The travel times are symmetric and satisfy the triangle inequality; therobjective is to minimize the tour duration. We develop efficient sequential and parallel algorithms for the verification of local optimality of a tour with respect to k-exchanges

    Parallel ACO with a Ring Neighborhood for Dynamic TSP

    Full text link
    The current paper introduces a new parallel computing technique based on ant colony optimization for a dynamic routing problem. In the dynamic traveling salesman problem the distances between cities as travel times are no longer fixed. The new technique uses a parallel model for a problem variant that allows a slight movement of nodes within their Neighborhoods. The algorithm is tested with success on several large data sets.Comment: 8 pages, 1 figure; accepted J. Information Technology Researc

    A hybrid heuristic solving the traveling salesman problem

    Get PDF
    This paper presents a new hybrid heuristic for solving the Traveling Salesman Problem, The algorithm is designed on the frame of a general optimization procedure which acts upon two steps, iteratively. In first step of the global search, a feasible tour is constructed based on insertion approach. In the second step the feasible tour found at the first step, is improved by a local search optimization procedure. The second part of the paper presents the performances of the proposed heuristic algorithm, on several test instances. The statistical analysis shows the effectiveness of the local search optimization procedure, in the graphical representation.peer-reviewe

    A parallel implementation of ant colony optimization

    Get PDF
    Ant Colony Optimization is a relatively new class of meta-heuristic search techniques for optimization problems. As it is a population-based technique that examines numerous solution options at each step of the algorithm, there are a variety of parallelization opportunities. In this paper, several parallel decomposition strategies are examined. These techniques are applied to a specific problem, namely the travelling salesman problem, with encouraging speedup and efficiency results.Full Tex

    Multiple local neighbourhood search for extremal optimisation

    Get PDF
    • …
    corecore