Article ID: | iaor20072904 |
Country: | Germany |
Volume: | 14 |
Issue: | 2 |
Start Page Number: | 193 |
End Page Number: | 207 |
Publication Date: | Jun 2006 |
Journal: | Central European Journal of Operations Research |
Authors: | Srensen Kenneth |
Keywords: | heuristics |
In this paper, we argue that vehicle routing solutions are often tactical decisions, that should not be changed too often or too much. For marketing or other reasons, vehicle routing solutions should be stable, i.e. a new solution (when e.g. new customers require service) should be as similar as possible to a solution already in use. Simultaneously however, this new solution should still have a good quality in the traditional sense (e.g. small total travel cost). In this paper, we develop a way to meaure the difference between two vehicle routing solutions. We use this distance measure to create a metaheuristic approach that will find solutions that are ‘close’ (in the solution space) to a given baseline solution and at the same time have a high quality in the sense that their total distance traveled is small. By using this approach the dispatcher is offered a choice of Pareto-optimal solutions, allowing him to make a trade-off between changing his existing solution and allowing a longer travel distance. Some experiments are performed to show the effectiveness of the approach.