2,037 research outputs found

    An ACO-Inspired, Probabilistic, Greedy Approach to the Drone Traveling Salesman Problem

    Get PDF
    In recent years, major companies have done research on using drones for parcel delivery. Research has shown that this can result in significant savings, which has led to the formulation of various truck and drone routing and scheduling optimization problems. This paper explains and analyzes a new approach to the Drone Traveling Salesman Problem (DTSP) based on ant colony optimization (ACO). The ACO-based approach has an acceptance policy that maximizes the usage of the drone. The results reveal that the pheromone causes the algorithm to converge quickly to the best solution. The algorithm performs comparably to the MIP model, CP model, and EA of Rich & Ham (2018), especially in instances with a larger number of stops

    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

    Routing design for less-than-truckload motor carriers using ant colony techniques

    Get PDF
    One of the most important challenges for Less-Than-Truck-Load carriers consists of determining how to consolidate flows of small shipments to minimize costs while maintaining a certain level of service. For any origin-destination pair, there are several strategies to consolidate flows, but the most usual ones are: peddling/collecting routes and shipping through one or more break-bulk terminals. Therefore, the target is determining a route for each origin-destination pair that minimizes the total transportation and handling cost guaranteeing a certain level of service. Exact resolution is not viable for real size problems due to the excessive computational time required. This research studies different aspects of the problem and provides a metaheuristic algorithm (based on Ant Colonies Optimization techniques) capable of solving real problems in a reasonable computational time. The viability of the approach has been proved by means of the application of the algorithm to a real Spanish case, obtaining encouraging results

    ROUTING DESIGN FOR LESS-THAN-TRUCKLOAD MOTOR CARRIERS USING ANT COLONY TECHNIQUES

    Get PDF
    One of the most important challenges for Less-Than-Truck-Load carriers consists of determining how to consolidate flows of small shipments to minimize costs while maintaining a certain level of service. For any origin-destination pair, there are several strategies to consolidate flows, but the most usual ones are: peddling/collecting routes and shipping through one or more break-bulk terminals. Therefore, the target is determining a route for each origin-destination pair that minimizes the total transportation and handling cost guaranteeing a certain level of service. Exact resolution is not viable for real size problems due to the excessive computational time required. This research studies different aspects of the problem and provides a metaheuristic algorithm (based on Ant Colonies Optimization techniques) capable of solving real problems in a reasonable computational time. The viability of the approach has been proved by means of the application of the algorithm to a real Spanish case, obtaining encouraging results.

    Anti-pheromone as a tool for better exploration of search space

    Get PDF
    Many animals use chemical substances known as pheromones to induce behavioural changes in other members of the same species. The use of pheromones by ants in particular has lead to the development of a number of computational analogues of ant colony behaviour including Ant Colony Optimisation. Although many animals use a range of pheromones in their communication, ant algorithms have typically focused on the use of just one, a substance that encourages succeeding generations of (artificial) ants to follow the same path as previous generations. Ant algorithms for multi-objective optimisation and those employing multiple colonies have made use of more than one pheromone, but the interactions between these different pheromones are largely simple extensions of single criterion, single colony ant algorithms. This paper investigates an alternative form of interaction between normal pheromone and anti-pheromone. Three variations of Ant Colony System that apply the anti-pheromone concept in different ways are described and tested against benchmark travelling salesman problems. The results indicate that the use of anti-pheromone can lead to improved performance. However, if anti-pheromone is allowed too great an influence on ants' decisions, poorer performance may result

    Ant colony optimization with direct communication for the traveling salesman problem

    Get PDF
    This article is posted here with permission from IEEE - Copyright @ 2010 IEEEAnts in conventional ant colony optimization (ACO) algorithms use pheromone to communicate. Usually, this indirect communication leads the algorithm to a stagnation behaviour, where the ants follow the same path from early stages. This occurs because high levels of pheromone are developed, which force the ants to follow the same corresponding trails. As a result, the population gets trapped into a local optimum solution which is difficult to escape from it. In this paper, a direct communication (DC) scheme is proposed where ants are able to exchange cities with other ants that belong to their communication range. Experiments show that the DC scheme delays convergence and improves the solution quality of conventional ACO algorithms regarding the traveling salesman problem, since it guides the population towards the global optimum solution. The ACO algorithm with the proposed DC scheme has better performance, especially on large problem instances, even though it increases the computational time in comparison with a conventional ACO algorithm
    corecore