The traveling salesman problem with backhauls
Computers and Operations Research
Vehicle routing with pick-up and delivery: tour-partitioning heuristics
Computers and Industrial Engineering
Heuristics for the traveling salesman problem with pickup and delivery
Computers and Operations Research
An Exact Method for the Vehicle Routing Problem with Backhauls
Transportation Science
The single vehicle routing problem with deliveries and selective pickups
Computers and Operations Research
A heuristic method for the vehicle routing problem with mixed deliveries and pickups
Journal of Scheduling
A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
Computers and Operations Research
Expert Systems with Applications: An International Journal
An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup
Computers and Operations Research
Online scheduling of pick-up and delivery tasks in hospitals
Journal of Biomedical Informatics
A hybrid genetic algorithm for the vehicle routing problem with simultaneous pickup and delivery
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Computers and Operations Research
EvoCOP'08 Proceedings of the 8th European conference on Evolutionary computation in combinatorial optimization
Expert Systems with Applications: An International Journal
Simulation evaluation for on-demand bus system with electrical vehicles
Intelligent Decision Technologies - Special issue on design of intelligent environment
Computers and Operations Research
New lower bounds for the vehicle routing problem with simultaneous pickup and delivery
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
EvoCOP'12 Proceedings of the 12th European conference on Evolutionary Computation in Combinatorial Optimization
Scatter Search Applied to the Vehicle Routing Problem with Simultaneous Delivery and Pickup
International Journal of Applied Metaheuristic Computing
Journal of Intelligent Manufacturing
Hi-index | 0.01 |
The vehicle routing problem with simultaneous pick-up and delivery (VRP_SPD) is a variant of the classical vehicle routing problem (VRP) where clients require simultaneous pick-up and delivery service. Deliveries are supplied from a single depot at the beginning of the vehicle's service, while pick-up loads are taken to the same depot at the conclusion of the service. One important characteristic of this problem is that a vehicle's load in any given route is a mix of pick-up and delivery loads.In this paper we develop a tabu search algorithm to solve VRP_SPD. This algorithm uses three types of movements to obtain inter-route adjacent solutions: the relocation, interchange and crossover movements. A 2-opt procedure is used to obtain alternative intra-route solutions. Four types of neighbourhoods were implemented, three of them defined by the use of each of the single inter-route movements and the fourth by using a combination of these movements. Two different search strategies were implemented for selecting the next movement: first admissible movement and best admissible movement. Intensification and diversification of the search were achieved through frequency penalization. Computational results are reported for a set of 87 test problems with between 50 and 400 clients.