Show simple item record

dc.contributor.authorDavis, Lauren
dc.contributor.authorSamanlıoğlu, Funda
dc.contributor.authorJiang, Xiaochun
dc.contributor.authorMota, Daniel
dc.contributor.authorStanfield, Paul
dc.date.accessioned2021-02-13T17:21:04Z
dc.date.available2021-02-13T17:21:04Z
dc.date.issued2012
dc.identifier.issn0305-0548
dc.identifier.issn1873-765X
dc.identifier.urihttps://doi.org/10.1016/j.cor.2011.01.019en_US
dc.identifier.urihttps://hdl.handle.net/20.500.12469/3905
dc.description.abstractDurable products and their components are increasingly being equipped with one of several forms of automatic identification technology such as radio frequency identification (RFID). This technology enables data collection, storage, and transmission of product information throughout its life cycle. Ideally all available relevant information could be stored on RFID tags with new information being added to the tags as it becomes available. However, because of the finite memory capacity of RFID tags along with the magnitude of potential lifecycle data, users need to be more selective in data allocation. In this research, the data allocation problem is modeled as a variant of the nonlinear knapsack problem. The objective is to determine the number of items to place on the tag such that the value of the "unexplained" data left off the tag is minimized. A binary encoded genetic algorithm is proposed and an extensive computational study is performed to illustrate the effectiveness of this approach. Additionally, we discuss some properties of the optimal solution which can be effective in solving more difficult problem instances. (C) 2011 Elsevier Ltd. All rights reserved.en_US
dc.language.isoEnglishen_US
dc.publisherPergamon-Elsevier Science Ltden_US
dc.subjectRFID tagsen_US
dc.subjectData allocationen_US
dc.subjectKnapsack problemen_US
dc.titleA heuristic approach for allocation of data to RFID tags: A data allocation knapsack problem (DAKP)en_US
dc.typeArticleen_US
dc.identifier.startpage93en_US
dc.identifier.endpage104en_US
dc.relation.journalComputers & Operations Researchen_US
dc.identifier.issue1en_US
dc.identifier.volume39en_US
dc.identifier.wosWOS:000295310500013en_US
dc.identifier.doi10.1016/j.cor.2011.01.019en_US
dc.contributor.khasauthorSamanlıoğlu, Fundaen_US


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record