Paper Info
Title
A variable neighborhood search approach for multiple traveling salesman problem with deadlines
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.
Year
DOI
Venue
2012
10.1109/ICNSC.2012.6204934
ICNSC
Keywords
Field
DocType
multiple traveling salesman problem,mtsptd,vehicle routing and scheduling,vehicle scheduling,safety-critical environment,vehicle routing,travelling salesman problems,transportation,wireless sensor and actor networks,mobile actor management,wsan,search problems,computational complexity,variable neighborhood search approach,np-hard combinatorial optimization problems,time deadlines,variable neighborhood search,vns,wireless sensor-and-actor network,routing,mobile computer,traveling salesman problem,mobile communication,mobile computing,energy efficient,probabilistic logic
Traveling purchaser problem,Mobile computing,Mathematical optimization,Variable neighborhood search,Computer science,Travelling salesman problem,2-opt,Probabilistic logic,Mobile telephony,Computational complexity theory
Conference
ISBN
Citations 
PageRank 
978-1-4673-0388-0
3
0.40
References 
Authors
11
3
Name
Order
Citations
PageRank
Wenhua Zhao130.73
Haoxun Chen277360.23
Huifeng Li330.40