Ant colony optimization for real-world vehicle routing problems

Rizzoli, Andrea Emilio; Montemanni, Roberto; Lucibello, Enzo; Gambardella, Luca Maria

doi:10.1007/s11721-007-0005-x

Cited by 168 publications

(82 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Further case studies should take into account local search, elitist and rankbased ant systems as well as dynamic aspects (cf. (Eyckelhof and Snoek 2002), (Dorigo and Stützle 2004), (Montemanni et al 2005), (Reimann et al 2004) and (Rizzoli et al 2007) to mention only a few examples).…”

Section: Resultsmentioning

confidence: 99%

Autonomous Units for Solving the Traveling Salesperson Problem Based on Ant Colony Optimization

Kuske

Luderer

Tönnies

2011

Dynamics in Logistics

View full text Add to dashboard Cite

Communities of autonomous units are rule-based and graphtransformational systems with a well-defined formal semantics. The autonomous units of a community act and interact in a common environment while striving for their goals. Ant colony systems consist of a set of autonomously behaving ants and are often employed as a metaheuristics for NP-hard logistic problems. In this paper, we demonstrate how communities of autonomous units can be used as a formal graph-transformational framework for modeling ant colony systems. As a first example we model an ant colony system for the Traveling Salesperson Problem as a community of autonomous units.

show abstract

Section: Resultsmentioning

confidence: 99%

Autonomous Units for Solving the Traveling Salesperson Problem Based on Ant Colony Optimization

Kuske

Luderer

Tönnies

2011

Dynamics in Logistics

View full text Add to dashboard Cite

show abstract

“…Por su parte, Rizzoli, Montemanni, Lucibello & Gambardella (2007) desarrollaron casos de aplicación de VRP con TSP para el transporte y la distribución en una empresa de distribución en la ciudad italiana de Padua, en una cadena de supermercados y en una compañía de distribución en Lugano, Suiza (pp. 136-148).…”

Section: Contextualización Teórica Red De Distribución Y Transporte Dunclassified

Modelamiento de distribución de productos cárnicos como un TSP (Traveling Salesman Problem) con teoría de grafos

2015

View full text Add to dashboard Cite

Modelamiento de distribución de productos cárnicos como un TSP (Traveling Salesman Problem) con teoría de grafosRevista Clío América ISSN: 1909-941X Vol. 9 No. 17 Enero -Junio de 2015 Modelamiento de distribución de productos cárnicos como un TSP (Traveling Salesman Problem) con teoría de grafosResumen: El presente artículo tiene como objetivo utilizar el TSP (Traveling Salesman Problem) junto con la teoría de grafos para diseñar estrategias de ruteo en una red de distribución, buscando que ésta se realice de manera eficiente respecto a la distancia y tiempos utilizados en la atención de los pedidos de los clientes. Adicionalmente, se desarrolla un caso de aplicación de la metodología en una empresa de cárnicos ubicada en la ciudad de Medellín. Como resultado, se obtuvo que la utilización de TSP con grafos, permite obtener una ruta con la mínima distancia en la red de distribución, lo que se demuestra en el caso de aplicación.Palabras clave: Distribución, grafos, ruteo, transporte, TSP. JEL: L220, L6, L60, M1, M10Abstract: This paper has as its main objective the use of the TSP (Traveling Salesman Problem) with graph theory in order to design routing strategies in a distribution network, looking forward an efficient way to be made in regard to distance and time used for attending the customer's requirements. Additionally, the paper develops a case of application of the methodology in a Meat Company located in the city of Medellín. As a result, we find that the use of TSP with graph produces a route with the minimum distance in the distribution network; it was demonstrated in the case of application.

show abstract

“…Companies always tend to look for the most cost-efficient methods to distribute goods across logistic networks [1]. Traditionally, trucks have been used to handle these tasks and the corresponding transportation problem is modelled as a traveling salesman problem (TSP).…”

Section: Introductionmentioning

confidence: 99%

“…However, a new distribution 5 method has recently arisen in which small unmanned aerial vehicles (UAV), also known as drones, are deployed to support parcel delivery. On the one hand, there are four advantages of using a drone for delivery: (1) it can be operated without a human pilot, (2) it avoids the congestion of traditional road networks by flying over them, (3) it is faster than trucks, and (4) it has 10 much lower transportation costs per kilometre [2]. On the other hand, because the drones are powered by batteries, their flight distance and lifting power are limited, meaning they are restricted in both maximum travel distance and parcel size.…”

Section: Introductionmentioning

confidence: 99%