Applying Ant Colony Optimisation to Dynamic Pickup and Delivery

摘要

We present an optimisation algorithm called "King of The Hill" ACO (KoTH-ACO) based on the MAX-MIN Ant System for a TSP problem extended for the dynamic pickup and delivery problem. The KoTH algorithm shows faster convergence and better solution qualities than the MAX-MIN Ant System in our benchmark instances. In addition, the runtime performance of ACO systems could be improved with approximate probability calculation.