 |
Press room | Events | News |
 |
 |
 |
 |
 |  |
 |
 |
Press room
|
 |  |
 |
 |
 |
 |  |
 |
 |
 | Ant Colony Optimization for Real-World Vehicle Routing
Metaheuristics like ant colony optimization (ACO) can be used to solve combinatorial optimization problems. In this paper we refer on its successful application to the vehicle routing problem (VRP). At the beginning, we introduce the VRP and some of its variants. The variants of VRP were designed to reproduce the kind of situations faced in the real-world. Further, we introduce the fundamentals of ant colony optimization, and we present in few words its application to the solution of the VRP. At the end, we discuss the applications of ACO to a number of real-world problems: a VRP with time windows for a major supermarket chain in Switzerland; a VRP with pickup and delivery for a leading distribution company in Italy and an on-line VRP in the city of Lugano, Switzerland, where clients’ orders arrive during the delivery process.

| | 
 |
 SIGEVOlution Summer 2007 |
 |  |
 |
 | EURONEWS: Ants show the way in improving freight transport
EURONEWS (http://www.euronews.net), the multilingual European TV channel, reports that scientists in Lugano, Switzerland have been developing a way to optimise the movement of a fleet of trucks to make delivery services more efficient. Their unlikely source of inspiration has been the master of logistics in the natural world- the ant.
Watch the video

| | 
 |  PDF not available |
 |  |
 |
 | National Geographic July 2007 - Swarm Behavior
A single ant or bee isn't smart, but their colonies are. The study of swarm intelligence is providing insights that can help humans manage complex systems, from truck routing to military robots.
Link to article

| | 
 |
 July 2007 |
 |  |
 |
 | LOGFORUM.net - December 2006: AntRoute – Large scale dynamic optimisation
With AntRoute AntOptima implements this technology for Logistics provider to speed up their business in terms of time and efficiency. The integrated high performance Tour Optimiser of AntRoute based on ACO and is automatically able to optimise thousands of daily orders in a few minutes considering the company related constraints like truck fleet, client time windows, unit load, access limitation, etc. (Published on Logforum.net)

| | 
 |
 LOGFORUM.NET – 2006, Vol.2, Issue 3, Nr. 4 |
 |  |
 |
 | IDSIA - January 2002: "Metaheuristics for Transport and Logistic"
IDSIA, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale is a research institute active in both theoretical and applied research in the field of Operations Research and Artificial Intelligence. Since 1996 IDSIA has capitalized on the results obtained in the theoretical field applying them to real world logistics and transport application.

| | 
 |
 IDSIA 01/02 (PDF 106Kb) |
 |  |
 |
 | Harvard Business Review - May 2001:
"For years, scientists have been studying ants, bees, and wasps because of the amazing efficiency of social insect. Now companies like Southwest Airlines and Unilever are actually putting that research to work, with impressive paybacks".

| | 
 |
 Harvard Business 05/01 (PDF 390Kb) |
 |  |
 |
 | Nature - 6 July 2000: "Inspiration for optimization from social insect behaviour"
"Research in social insect behaviour has provided computer scientists with powerful methods for designing distributed control and optimization algorithms. These techniques are being applied successfully to a variety of scientific and engineering problems. In addition to achieving good performance on a wide spectrum of "static" problems, such techniques tend to exhibit a high degree of flexibility and robustness in a dynamic environment".

| | 
 |
 Nature 07/00 (PDF 148Kb) |
 |  |
 |
 | Journal of Scheduling - January 2000: "Effective Neighborhood Functions for the Flexible Job Shop Problem"
“The Flexible Job Shop Problem is an extension of the classical job shop scheduling problem which allows an operation to be performed by one machine out of a set of machines. The problem is to assign each operation to a machine (routing problem) and to order the operations on the machines (sequencing problem), such that the maximal completion time (makespan) of all operations is minimized. To solve the Flexible Job Shop problem approximately, we use local search techniques and present two neighborhood functions”.

| | 
 |
 Journal of Scheduling 01/00 (PDF 413Kb) |
 |  |
 |
 |
 |