z-logo
open-access-imgOpen Access
Ant Colony System for a Problem in Reverse Logistic
Author(s) -
Franklin Johnson,
Jorge R. Vega,
G. Cabrera-Vives,
Enrique Cabrera
Publication year - 2015
Publication title -
studies in informatics and control
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.321
H-Index - 22
eISSN - 1841-429X
pISSN - 1220-1766
DOI - 10.24846/v24i2y201501
Subject(s) - computer science , ant , ant colony , ant colony optimization algorithms , artificial intelligence , operating system
Distribution, redistribution, recycling and repacking have become an important issue in logistic planning during the last decades. While keeping operational cost as low as possible still the main goal for logistic planners, other aspects such as recycling are getting more attention from industry. In this article the well known Ant Colony System (ACS), a bioinspired algorithm, is implemented to solve a problem arising in Reverse Logistic namely Vehicle Routing Problem with Simultaneous Delivery and Pickup (VRPSDP). To solve this problem we need to find the optimal set of paths that meet, at the same time, customer delivery and pickup demands. In order to solve this problem, our ACS implementation makes use of a strategy that mimics the effect of the pheromone in the natural Ants behaviour. To do that, each vehicle is viewed as an individual agent (ant) and consequently its behaviour is driven by pheromone strategy, i.e. it tends to choose the route for which the pheromone level is higher. Results show that our ACS implementation provides good quality solutions within an acceptable time. Furthermore, obtained solutions are quite competitive when compared to other stochastic techniques previously studied in literature.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom