dacosta2026multiobjective
Abstract
Vehicular Edge Computing (VEC) has emerged as a promising paradigm to address the growing demand for low-latency computation in vehicular applications, driven by the increasing number of connected vehicles and the massive volume of generated data. However, the highly dynamic nature of VEC environments poses significant challenges for efficient task scheduling. To meet these challenges, this work proposes MOMUS, a multiobjective optimization-based scheduler that leverages the Non-dominated Sorting Genetic Algorithm II (NSGA-II) algorithm to balance conflicting objectives, including maximizing the number of tasks completed within their deadlines, minimizing monetary cost, and reducing system latency. Simulation results show that MOMUS outperforms state-of-the-art VEC scheduling approaches, particularly under high-demand scenarios, achieving higher task completion rates while reducing monetary cost and maintaining acceptable latency.
Quick access
Contact
- Joahannes B. D. Da Costa
- Allan Souza
- Denis Rosario
- Christoph Sommer
- Leandro Aparecido Villas
BibTeX reference
@inproceedings{dacosta2026multiobjective,
author = {Da Costa, Joahannes B. D. and Souza, Allan and Rosario, Denis and Sommer, Christoph and Aparecido Villas, Leandro},
title = {{Multiobjective Optimization-driven Task Scheduling in Vehicular Cloud Environments}},
booktitle = {104th IEEE Vehicular Technology Conference (VTC2026-Fall)},
address = {Boston, MA},
month = {September},
note = {to appear},
publisher = {IEEE},
year = {2026},
}
Copyright notice
Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.
The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.
The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.
The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.