Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/30986
Full metadata record
DC FieldValueLanguage
dc.contributor.authorXiao, X-J-
dc.contributor.authorWang, Y-
dc.contributor.authorHuang, P-Q-
dc.contributor.authorWang, K-
dc.date.accessioned2025-03-28T10:43:45Z-
dc.date.available2025-03-28T10:43:45Z-
dc.date.issued2025-03-03-
dc.identifierORCiD: Yong Wang https://orcid.org/0000-0001-7670-3958-
dc.identifierORCiD: Pei-Qiu Huang https://orcid.org/0000-0001-6278-4566-
dc.identifierORCiD: Kezhi Wang https://orcid.org/0000-0001-8602-0800-
dc.identifier.citationXiao, X._j. et al. (2025) 'Neural Combinatorial Optimization for Multiobjective Task Offloading in Mobile Edge Computing', IEEE Transactions on Vehicular Technology, 0 (early access), pp. 1 - 12. doi: 10.1109/tvt.2025.3546914.en_US
dc.identifier.issn0018-9545-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/30986-
dc.description.abstractTask offloading is crucial in supporting resource-intensive applications in mobile edge computing. This paper explores multiobjective task offloading, aiming to minimize energy consumption and latency simultaneously. Although learning-based algorithms have been used to address this problem, they train a model based on one a priori preference to make the offloading decision. When the preference changes, the trained model may not perform well and needs to be retrained. To address this issue, we propose a neural combinatorial optimization method that combines an encoder-decoder model with reinforcement learning. The encoder captures task relationships, while the decoder, equipped with a preference-based attention mechanism, determines offloading decisions for various preferences. Additionally, reinforcement learning is employed to train the encoder-decoder model. Since the proposed method can infer the offloading decision for each preference, it eliminates the need to retrain the model when the preference changes, thus improving real-time performance. Experimental studies demonstrate the effectiveness of the proposed method by comparison with three algorithms on instances of different scales.en_US
dc.description.sponsorship10.13039/501100001809-National Natural Science Foundation of China (Grant Number: U23A20347); Royal Society International Exchange (Grant Number: IEC-NSFC-211264).en_US
dc.format.extent1 - 12-
dc.format.mediumPrint-Electronic-
dc.language.isoen_USen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.rightsCopyright © 2025 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. See: https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/.-
dc.rights.urihttps://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/-
dc.subjectmobile edge computingen_US
dc.subjecttask offloadingen_US
dc.subjectmultiobjectiveen_US
dc.subjectneural combinatorial optimizationen_US
dc.subjectencoder-decoder modelen_US
dc.titleNeural Combinatorial Optimization for Multiobjective Task Offloading in Mobile Edge Computingen_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1109/tvt.2025.3546914-
dc.relation.isPartOfIEEE Transactions on Vehicular Technology-
pubs.publication-statusPublished-
dc.identifier.eissn1939-9359-
dc.rights.holderInstitute of Electrical and Electronics Engineers (IEEE)-
Appears in Collections:Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright © 2025 Institute of Electrical and Electronics Engineers (IEEE). Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. See: https://journals.ieeeauthorcenter.ieee.org/become-an-ieee-journal-author/publishing-ethics/guidelines-and-policies/post-publication-policies/.8.8 MBAdobe PDFView/Open


Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.