A variable neighborhood search approach for multiple traveling salesman problem with deadlines - Archive ouverte HAL Access content directly
Conference Papers Year :

A variable neighborhood search approach for multiple traveling salesman problem with deadlines

(1) , (1) , (2)
1
2

Abstract

One important issue for the management of mobile actors in a wireless sensor and actor network (WSAN) deployed in a safety-critical environment is to route and schedule the mobile actors in an energy-efficient way to timely respond to the events captured by sensors. This problem can be modeled as a multiple traveling salesman problem with time deadlines. In this paper, a variable neighborhood search (VNS) approach is used to solve the routing problem. We compare two variants of the approach: one only accepts a better solution in the search and the other also accepts a worse solution probabilistically. Numerical experiments show that the first method can get better solutions whereas the second one is much faster. Both methods can obtain satisfactory solutions.
Not file

Dates and versions

hal-02489776 , version 1 (24-02-2020)

Identifiers

Cite

Wenhua Zhao, Haoxun Chen, Huifeng Li. A variable neighborhood search approach for multiple traveling salesman problem with deadlines. 2012 9th IEEE International Conference on Networking, Sensing and Control (ICNSC), Apr 2012, Beijing, China. pp.301-306, ⟨10.1109/ICNSC.2012.6204934⟩. ⟨hal-02489776⟩

Collections

CNRS UTT LOSI
55 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More