Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
A tabu search heuristic for the vehicle routing problem
Management Science
Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
Transportation Science
INFORMS Journal on Computing
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Computers and Operations Research
Expert Systems with Applications: An International Journal
A distribution network optimization problem for third party logistics service providers
Expert Systems with Applications: An International Journal
Pickup and delivery problem using metaheuristics techniques
Expert Systems with Applications: An International Journal
Business analytics in supply chains - The contingent effect of business process maturity
Expert Systems with Applications: An International Journal
New best solutions to VRPSPD benchmark problems by a perturbation based algorithm
Expert Systems with Applications: An International Journal
Computers and Operations Research
Agent-based guided local search
Expert Systems with Applications: An International Journal
Scatter Search Applied to the Vehicle Routing Problem with Simultaneous Delivery and Pickup
International Journal of Applied Metaheuristic Computing
Computers and Industrial Engineering
Bi-Objective Bus Routing: An Application to School Buses in Rural Areas
Transportation Science
Hi-index | 12.06 |
This article addresses a vehicle routing problem variant which considers customers to require simultaneous delivery and pick-up service (VRPSPD). The objective of this problem is to determine the optimal set of routes to totally satisfy both the delivery and pick-up demand of the customer population. VRPSPD is an NP-hard combinatorial optimization problem; therefore exact methods are incapable of dealing with large scale VRPSPD instances arising in a wide variety of practical operations. We propose a hybrid solution approach incorporating the rationale of two well-known metaheuristics which have proven to be effective for routing problem variants, namely tabu search and guided local search. The intelligence of the proposed hybrid was designed to achieve a vast exploration of the search space, by escaping from local optima and intensifying at promising solution regions. The performance of our metaheuristic algorithm was tested on benchmark instances involving from 50 to 400 customers. It produced high quality results, improving several best solutions previously reported.