Heuristics for the traveling salesman problem with pickup and delivery
Computers and Operations Research
ACO algorithms for the quadratic assignment problem
New ideas in optimization
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
SavingsAnts for the Vehicle Routing Problem
Proceedings of the Applications of Evolutionary Computing on EvoWorkshops 2002: EvoCOP, EvoIASP, EvoSTIM/EvoPLAN
A Savings Based Ant System For The Vehicle Routing Problem
GECCO '02 Proceedings of the Genetic and Evolutionary Computation Conference
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
INFORMS Journal on Computing
D-Ants: savings based ants divide and conquer the vehicle routing problem
Computers and Operations Research
Computers and Operations Research
Analyzing a unified ant system for the VRP and some of its variants
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
New best solutions to VRPSPD benchmark problems by a perturbation based algorithm
Expert Systems with Applications: An International Journal
Computers and Operations Research
Computers and Industrial Engineering
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
A Genetic Algorithm-based optimization model for supporting green transportation operations
Expert Systems with Applications: An International Journal
| Hi-index | 12.06 |
The Vehicle Routing Problem with Pickup and Delivery (VRPPD) is a variant of the Vehicle Routing Problem where the vehicles are not only required to deliver goods but also to pick up some goods from the customers. Given a fleet of vehicles and a set of customers with known delivery and/or pickup demands for one commodity VRPPD determines a set of vehicle routes originating and ending at a single depot and visiting all customers exactly once. The objective is to minimize the total distance traversed. In this paper, we consider a special case of the VRPPD where each customer has both a delivery and a pickup demand to be satisfied simultaneously. For this problem, we propose an ant colony algorithm employing a new saving-based visibility function and pheromone updating procedure. The numerical tests with the well-known benchmark problems from the literature show that the proposed approach provides competitive results and improves several best-known solutions.