Ant Colony System for a Problem in Reverse Logistic

STUDIES IN INFORMATICS AND CONTROL(2015)

引用 4|浏览6
暂无评分
摘要
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 bio-inspired 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.
更多
查看译文
关键词
vehicle routing problem with simultaneous delivery and pickup,ant colony system,reverse logistic
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要