Scatter search for the vehicle routing problem with time windows |
| |
| Affiliation: | 1. Liverpool Business School, Liverpool John Moores University, Liverpool L3 5UG, UK;2. School of Business, Stevens Institute of Technology, Hoboken, NJ 07030, USA;3. School of Business, Athens University of Economics & Business, Athens 104 34, Greece;1. Department of Industrial and Systems Engineering, Isfahan University of Technology, Isfahan, Iran;2. Young Researchers and Elite Club, Ayatollah Amoli Branch, Islamic Azad University, Amol, Iran;3. School of Computing Science and Engineering, Vellore Institute of Technology (VIT), Vellore-632014, India;1. CORAL - Cluster for Operations Research, Analytics, and Logistics, Department of Economics and Business Economics, Aarhus University, Fuglesangs Allé 4, Aarhus V DK-8210, Denmark;2. GERAD and Canada Research Chair in Distribution Management, HEC Montréal, 3000, chemin de la Côte-Sainte-Catherine, Montréal H3T 2A7, Canada |
| |
| Abstract: | ![]()
In this paper we use a scatter search framework to solve the vehicle routing problem with time windows (VRPTW). Our objective is to achieve effective solutions and to investigate the effects of reference set design parameters pertaining to size, quality and diversity. Both a common arc method and an optimization-based set covering model are used to combine vehicle routing solutions. A reactive tabu search metaheuristic and a tabu search with an advanced recovery feature, together with a set covering procedure are used for solution improvement. Our approach led to a robust solution method, generating solution quality that is competitive with the current best metaheuristics. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
