Ant colony optimization approach for the capacitated vehicle routing problem with simultaneous delivery and pick-up
||The system is temporarily closed to updates for reporting purpose.
Çatay, Bülent (2006) Ant colony optimization approach for the capacitated vehicle routing problem with simultaneous delivery and pick-up. In: 11th Meeting of the EURO Working Group on Transportation, "Advances in Traffic and Transportation Systems Analysis",
We propose an Ant Colony Optimization (ACO) algorithm to the NPhard Vehicle Routing Problem with Simultaneous Delivery and Pick-up (VRPSDP). In VRPSDP, commodities are delivered to customers from a single depot utilizing a fleet of identical vehicles and empty packages are collected from the customers and transported back to the depot. The objective is to minimize the total distance traveled. The algorithm is tested with the well-known benchmark problems from the literature. The experimental study indicates that our approach produces comparable results to those of the benchmark problems in the literature.
|Item Type:||Papers in Conference Proceedings|
|Subjects:||Q Science > QA Mathematics|
|Deposited By:||Bülent Çatay|
|Deposited On:||13 Feb 2007 02:00|
|Last Modified:||08 Feb 2010 10:22|
Repository Staff Only: item control page