Skip to main navigation Skip to search Skip to main content

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

  • Wenhua Zhao*
  • , Haoxun Chen
  • , Huifeng Li
  • *Corresponding author for this work
  • Université de technologie de Troyes

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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.

Original languageEnglish
Title of host publicationProceedings of 2012 9th IEEE International Conference on Networking, Sensing and Control, ICNSC 2012
Pages301-306
Number of pages6
DOIs
StatePublished - 2012
Event2012 9th IEEE International Conference on Networking, Sensing and Control, ICNSC 2012 - Beijing, China
Duration: 11 Apr 2012 → 14 Apr 2012

Publication series

NameProceedings of 2012 9th IEEE International Conference on Networking, Sensing and Control, ICNSC 2012

Conference

Conference2012 9th IEEE International Conference on Networking, Sensing and Control, ICNSC 2012
Country/TerritoryChina
CityBeijing
Period11/04/12 → 14/04/12

Keywords

  • Multiple traveling salesman problem
  • variable neighborhood search
  • vehicle routing and scheduling
  • wireless sensor and actor networks

Fingerprint

Dive into the research topics of 'A variable neighborhood search approach for multiple traveling salesman problem with deadlines'. Together they form a unique fingerprint.

Cite this