Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/11984
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Falcon, Rafael | - |
dc.contributor.author | DEPAIRE, Benoit | - |
dc.contributor.author | CARIS, An | - |
dc.date.accessioned | 2011-06-06T09:07:26Z | - |
dc.date.available | NO_RESTRICTION | - |
dc.date.available | 2011-06-06T09:07:26Z | - |
dc.date.issued | 2011 | - |
dc.identifier.citation | Wittevrongel, Sabine & Aghezzaf, El-Houssaine (Ed.) Proceedings of the 25th Annual Conference of the Belgian Operations Research Society. p. 67-68. | - |
dc.identifier.isbn | 978-94-9069-552-1 | - |
dc.identifier.uri | http://hdl.handle.net/1942/11984 | - |
dc.description.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. | - |
dc.language.iso | en | - |
dc.subject.other | traveling salesman problem, wireless sensor networks, genetic algorithm, ant colony optimization | - |
dc.title | The One-Commodity Traveling Salesman Problem with Selective Pickup and Delivery | - |
dc.type | Proceedings Paper | - |
local.bibliographicCitation.authors | Wittevrongel, Sabine | - |
local.bibliographicCitation.authors | Aghezzaf, El-Houssaine | - |
local.bibliographicCitation.conferencename | 25th Annual Conference of the Belgian Operations Research Society | - |
local.bibliographicCitation.conferenceplace | Gent 10-11/02/2011 | - |
dc.identifier.epage | 68 | - |
dc.identifier.spage | 67 | - |
local.bibliographicCitation.jcat | C1 | - |
local.type.specified | Proceedings Paper | - |
dc.bibliographicCitation.oldjcat | C3 | - |
local.bibliographicCitation.btitle | Proceedings of the 25th Annual Conference of the Belgian Operations Research Society | - |
item.accessRights | Open Access | - |
item.fullcitation | Falcon, Rafael; DEPAIRE, Benoit & CARIS, An (2011) The One-Commodity Traveling Salesman Problem with Selective Pickup and Delivery. In: Wittevrongel, Sabine & Aghezzaf, El-Houssaine (Ed.) Proceedings of the 25th Annual Conference of the Belgian Operations Research Society. p. 67-68.. | - |
item.contributor | Falcon, Rafael | - |
item.contributor | DEPAIRE, Benoit | - |
item.contributor | CARIS, An | - |
item.fulltext | With Fulltext | - |
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.