Constraint-based local search for solving non-simple paths problems on graphs: application to the routing for network covering p

Routing problems have been considered as central problems in the fields of transportation, distribution and logistics. LS(Graph) is a generic framework allowing to model and solve constrained optimum paths problems on graphs by local search where paths are known to be elementary (i.e., edges, vertices cannot be repeated on paths). In many real-world situations, the paths to be determined are not known to be neither simple nor elementary. In this paper, we extend the LS(Graph) framework by designing and ting abstractions that allow to model and solve constrained paths problem where edges, vertices can be repeated on paths (call non-simple paths). We also propose an instance of such problem class: the routing for network covering (RNC) problem which arises in the context of rescue after a natural disaster in which we have to route a fleet of identical vehicles with limited capacity on a transportation network in order to collect the informations of the disaster. Given an undirected weig...

• Type: Journal
• Year: 2010
• Where: SOICT
• Authors: Pham Quang Dung, Phan-Thuan Do, Yves Deville, Tuong-Vinh Ho
• Keywords: Identical Vehicles, Information Technology, Paths Problem, Routing, SOICT 2010