Large Neighborhood Search Using Constraint Satisfaction Techniques in Vehicle Routing Problem

Authors:
Hyun-Jin Lee;Sang-Jin Cha;Young-Hoon Yu;Geun-Sik Jo
Affiliations:
Department of Computer Science & Information Engineering, Inha University,;Department of Computer Science & Information Engineering, Inha University,;Department of Computer Science & Information Engineering, Inha University,;Department of Computer Science & Information Engineering, Inha University,
Venue:
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
Year:
2009

Citing 3
Cited 0

Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems

CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows

Transportation Science
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms

Transportation Science

Quantified Score

Hi-index	0.02

Visualization

Abstract

Vehicle Routing Problem(VRP) is a well known NP-hard problem, where an optimal solution to the problem cannot be achieved in reasonable time, as the problem size increases. Due to this problem, many researchers have proposed a heuristic using a local search. In this paper, we propose the Constraint Satisfaction Problem(CSP) model in Large Neighborhood Search. This model enables us to reduce the size of local search space. In addition, it enables the easy handling of many constraints in the real-world.