Best-Match in a Set of Single-Vehicle Dynamic Pickup and Delivery Problem Using Ant Colony Optimization
Authors:
Open Access
- 31 January 2020
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 126-131
Abstract
The Pickup and Delivery problem (PDP) is an optimization problem used in logistics, where goods must be transported in a certain order. This paper proposes the Set of Single-Vehicle Dynamic Pickup and Delivery Problem (SVPDP), which extends PDP to a set of vehicles that are already on the road when a new pickup and delivery order arrives. A ranking is created to determine, which vehicles are best suited to fulfill this order with the smallest detour. A modified Ant Colony Optimization algorithm (ACO) dynamically defines for each vehicle new routes while minimizing the overall costs when integrating the additional locations. The problem is modeled, different sizes are examined and suitable parameter sets for the ACO are proposed to solve this particular SVPDP.Keywords
This publication has 7 references indexed in Scilit:
- An ant colony system solving the travelling salesman region problem2016
- A heuristic comparison framework for solving the Two-Echelon Vehicle Routing Problem2016
- A survey on dynamic and stochastic vehicle routing problemsInternational Journal of Production Research, 2015
- Ant Colony Optimization for the Single Vehicle Pickup and Delivery Problem with Time Window2010
- The way to an open-source software for automated optimization and learning — OpenOpal2010
- Ant colony optimizationIEEE Computational Intelligence Magazine, 2006
- The General Pickup and Delivery ProblemTransportation Science, 1995