Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/11984
Title: | The One-Commodity Traveling Salesman Problem with Selective Pickup and Delivery | Authors: | Falcon, Rafael DEPAIRE, Benoit CARIS, An |
Issue Date: | 2011 | Source: | Wittevrongel, Sabine & Aghezzaf, El-Houssaine (Ed.) Proceedings of the 25th Annual Conference of the Belgian Operations Research Society. p. 67-68. | Abstract: | This paper discusses a novel combinatorial optimization problem which arises in the domain of wireless sensor networks. A mobile robot with limited cargo capacity replaces damaged sensors, previously deployed over an area of interest, with passive ones so as to preserve the network coverage. The one-commodity traveling salesman problem with selective pickup an delivery is strongly related to the pickup and delivery traveling salesman problem and the prize-collecting travelling salesman problem. The problem is characterized by the fact that the demand of any delivery customer can be met by a relatively large number of pickup customers. While all delivery spots are to be visited, only profitable pickup locations will be included in the tour. A hybrid meta-heuristic approach between genetic algorithms and ant colony optimization is put forward. | Keywords: | traveling salesman problem, wireless sensor networks, genetic algorithm, ant colony optimization | Document URI: | http://hdl.handle.net/1942/11984 | ISBN: | 978-94-9069-552-1 | Category: | C1 | Type: | Proceedings Paper |
Appears in Collections: | Research publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Carisorbel25abs.pdf | Non Peer-reviewed author version | 60.14 kB | Adobe PDF | View/Open |
Page view(s)
22
checked on Sep 7, 2022
Download(s)
4
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.