A heuristic method for the vehicle routing problem with mixed deliveries and pickups |
| |
| Authors: | Niaz A. Wassan Gábor Nagy Samad Ahmadi |
| |
| Affiliation: | (1) Centre for Heuristic Optimisation, Kent Business School, The University of Kent, Canterbury, UK;(2) School of Computing, De Montfort University, Leicester, UK |
| |
| Abstract: | The vehicle routing problem with deliveries and pickups is a challenging extension to the vehicle routing problem that lately attracted growing attention in the literature. This paper investigates the relationship between two versions of this problem, called “mixed” and “simultaneous”. In particular, we wish to know whether a solution algorithm designed for the simultaneous case can solve the mixed case. To this end, we implement a metaheuristic based on reactive tabu search. The results suggest that this approach can yield good results. |
| |
| Keywords: | Vehicle routing Deliveries and pickups Heuristic Reactive tabu search |
| 本文献已被 SpringerLink 等数据库收录！ |
|
