Show simple item record

dc.contributor.authorYazidi, Anis
dc.contributor.authorHammer, Hugo Lewi
dc.date.accessioned2019-04-29T11:44:46Z
dc.date.accessioned2019-04-30T06:56:52Z
dc.date.available2019-04-29T11:44:46Z
dc.date.available2019-04-30T06:56:52Z
dc.date.issued2018-06-23
dc.identifier.citationYazidi A, Hammer HL. Solving stochastic nonlinear resource allocation problems using continuous learning automata. Applied intelligence (Boston) . 2018:1-20en
dc.identifier.issn0924-669X
dc.identifier.issn0924-669X
dc.identifier.issn1573-7497
dc.identifier.urihttps://hdl.handle.net/10642/6990
dc.description.abstractThis paper deals with the Stochastic Non-linear Fractional Equality Knapsack (NFEK) problem which is a fundamental resource allocation problem based on incomplete and noisy information [7, 8]. The NFEK problem arises in many applications such as in web polling under polling constraints, and in constrained estimation. The primary contribution of this paper is a continuous Learning Automata (LA)-based, optimal, efficient and yet simple solution to the NFEK problem. Our solution is distinct from the first-reported optimal solution to the problem due to Granmo and Oommen [7, 8] which resorts to utilizing multiple two-action discretized LA, organized in a hierarchical manner which comes with extra implementation and computational complexity. In this work, we present an optimal solution to the problem using a continuous LA which does not involve mapping the materials onto a binary hierarchy. As opposed to the traditional family of Reward-Inaction (R-1) LA, our scheme is modified in order to accommodate non-absorbing barriers, thus guaranteeing convergence to the optimal allocation. The experimental results that we have presented for numerous simulations demonstrate the efficiency of our scheme and its superiority compared to the state-of-the-art in terms of peak performance.en
dc.language.isoenen
dc.publisherSpringer Verlagen
dc.relation.ispartofseriesApplied Intelligence;November 2018, Volume 48, Issue 11
dc.rightsThis is a post-peer-review, pre-copyedit version of an article published in Applied Intelligence.The final authenticated version is available online at: http://dx.doi.org/10.1007/s10489-018-1201-7en
dc.subjectContinuous learning automataen
dc.subjectStochastic non-linear fractional equality Knapsack problemsen
dc.subjectResource allocationsen
dc.titleSolving stochastic nonlinear resource allocation problems using continuous learning automataen
dc.typeJournal articleen
dc.typePeer revieweden
dc.date.updated2019-04-29T11:44:46Z
dc.description.versionacceptedVersionen
dc.identifier.doihttp://dx.doi.org/10.1007/s10489-018-1201-7
dc.identifier.cristin1608266
dc.identifier.cristin1608266
dc.source.journalApplied intelligence (Boston)


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record