Research Article | | Peer-Reviewed

Quantum-inspired Optimization for Efficient Vehicular Edge Computing Resource Allocation in Intelligent Transportation Systems

Received: 29 June 2025     Accepted: 9 July 2025     Published: 28 July 2025
Views:       Downloads:
Abstract

The increasing adoption of smart mobility and connected vehicles necessitates significant improvements in underlying infrastructure, particularly in real-time data processing and decision-making. Vehicular Edge Computing (VEC) has emerged as a vital solution by enabling computation closer to data sources, thereby reducing latency and reliance on centralized cloud systems. However, efficient allocation of edge resources (processing power, bandwidth, and storage) remains a critical challenge due to the highly dynamic, decentralized nature of vehicular networks. Traditional optimization techniques often fall short under these conditions. This study explores a quantum-inspired optimization framework designed to enhance resource management in VEC environments by leveraging principles of quantum computing such as superposition and probabilistic state selection within classical hardware. Extensive simulations involving 10 vehicles and 3 edge servers were conducted to evaluate the framework's performance. The dynamic resource demand fluctuated between 7 and 18 units, and server utilization ranged from 0.2% to 1.4%, illustrating diverse operational conditions. The proposed quantum-inspired model showed superior efficiency, achieving up to 35% improvement in fitness gain compared to traditional algorithms, with convergence to optimal fitness in just 45 iterations. The solution space was explored effectively using quantum state amplitude representations, which improved solution diversity and robustness in decision-making. Furthermore, fairness in resource distribution was evaluated using Jain’s Fairness Index, yielding a high score of 0.914, demonstrating equitable allocation among vehicles. Additional results revealed that task completion times ranged from 1.5 to 3.5 seconds, with processing delays being the major contributor. The system exhibited sublinear scalability, performing well up to 50 vehicles but declining as the vehicle count increased to 200, indicating a need for further optimization strategies. Although the model operates in a classical environment without quantum hardware, it offers substantial performance benefits. This research highlights the potential of quantum-inspired optimization for real-time, fair, and scalable resource management in vehicular networks. Future work should incorporate real-world vehicular trace data, expand scalability tests, and explore integration with 5G and energy harvesting mechanisms. These advancements will further support intelligent, secure, and sustainable transportation systems driven by edge computing technologies.

Published in American Journal of Networks and Communications (Volume 14, Issue 2)
DOI 10.11648/j.ajnc.20251402.13
Page(s) 47-58
Creative Commons

This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited.

Copyright

Copyright © The Author(s), 2025. Published by Science Publishing Group

Keywords

Vehicular Edge Computing (VEC), Quantum-inspired Optimization, Resource Allocation, Task Offloading, Scalability

1. Introduction
The underlying infrastructure that supports smart mobility and connected vehicles must change to keep up with the rapid integration of these innovations into daily life. Leading this change is Vehicular Edge Computing (VEC) which makes it possible to process data in real time and make wise decisions nearer to the networks edge where data is generated . Critical applications like intelligent navigation traffic safety systems and autonomous driving are supported by VEC because it lowers latency and lessens dependency on centralized cloud systems. Allocating scarce edge resources effectively has become a critical issue though as a result of the growing complexity of vehicular networks and the rapid expansion of data demand . Allocating resources in VEC environments is a complex process. Among moving vehicles with different demands connectivity conditions and service priorities it entails dynamically allocating processing power storage and bandwidth . Although helpful traditional optimization techniques frequently fall short of the demands of these decentralized extremely dynamic systems. Usually based on linear models or static assumptions these approaches are inadequate in settings that call for scalable and adaptable solutions. The requirement to maintain low latency high reliability and equitable resource distribution in real-time makes the task even more difficult. A new area of study called quantum-inspired optimization uses ideas from quantum computing to improve on traditional algorithmic techniques . Quantum-inspired algorithms use standard computing hardware to simulate some aspects of quantum behavior even though actual quantum computers are still in their infancy and not yet generally available. These include ideas that are modified to enhance the exploration and exploitation capabilities of optimization techniques such as quantum tunneling entanglement and superposition . A new class of algorithms that can solve intricate combinatorial problems more quickly than many conventional techniques is the end result . There are exciting new possibilities when VEC resource allocation is approached using quantum-inspired optimization. When vehicles must choose between processing data locally and offloading it to edge servers for example these algorithms are better able to manage the large solution space involved in dynamic task offloading . Moreover, they can facilitate predictive resource management and improve load balancing among several edge nodes by adjusting to network and traffic conditions in real time. Quantum-inspired techniques have the ability to quickly investigate several solutions at once in contrast to traditional methods increasing the possibility of finding globally optimal or nearly optimal solutions in a substantially shorter amount of time. The ability of quantum-inspired optimization to handle the trade-offs between performance scalability and adaptability is what makes it especially attractive for VEC. When hundreds or even thousands of vehicles interact with roadside units and mobile edge nodes in a typical urban traffic scenario the system needs to respond quickly to changing demands . For instance, a model inspired by quantum mechanics can allocate resources to safety-critical tasks like collision avoidance while guaranteeing that infotainment or entertainment services are provided without sacrificing system performance. Intelligent transportation systems cannot operate smoothly without this degree of responsive resource management . Furthermore, the more general objectives of intelligent and sustainable mobility are well served by these sophisticated optimization techniques. Greener transportation networks are a result of efficient resource use which lowers energy consumption and operating expenses. The incorporation of quantum-inspired techniques into VEC frameworks is a forward-thinking approach that strikes a balance between technological advancement and practical viability as cities work to become smarter and more connected . To find out how these cutting-edge algorithms can change how edge resources are managed in vehicular networks this study investigates the relationship between quantum-inspired optimization and vehicular edge computing. We intend to accomplish this in order to illustrate the approaches technical potential as well as its wider ramifications for the future of urban planning mobility and real-time data-driven services. The key to releasing the full potential of connected vehicle ecosystems may lie in resource optimization inspired by quantum mechanics as we continue to push the limits of smart transportation.
2. Literature Review
In order to satisfy the demanding needs of latency-sensitive applications Vehicular Edge Computing (VEC) has become a paradigm shift in intelligent transportation systems . VEC aims to bring computational resources closer to vehicles. The need for real-time data processing and making decision has increased as cars become more autonomous and networked which calls for effective resource allocation techniques in VEC environments. Classical optimization techniques have been the mainstay of traditional resource allocation methods in VEC. Similarly, reinforcement learning-based algorithms have been investigated to adaptively allocate resources in dynamic VEC scenarios. Although these methods have demonstrated promise they frequently struggle with scalability issues and may find it difficult to quickly adapt to the highly dynamic and stochastic nature of vehicular networks . For example, game-theoretical approaches such as BARGAIN-MATCH have been proposed to model the interactions between vehicles and edge servers optimizing resource allocation and task offloading decisions dot. Recently there has been interest in quantum-inspired optimization methods as possible answers to the intricate resource allocation problems in VEC. Compared to classical algorithms these techniques explore solution spaces more quickly by utilizing quantum computing concepts like superposition and entanglement . In network optimization problems for instance quantum-inspired genetic algorithms have shown improved performance in terms of energy efficiency and latency reduction. Similarly, quantum-inspired particle swarm optimization techniques have been suggested for energy-efficient task offloading in edge computing environments exhibiting better convergence rates and solution quality . There is great potential for incorporating quantum-inspired optimization into VEC resource allocation. Even in highly dynamic situations VEC systems may be able to achieve more efficient and balanced resource distribution by utilizing the probabilistic nature of quantum-inspired algorithms . Additionally, these techniques can improve the system capacity to adjust to changing network topologies and workloads which are typical of automotive environments . Nevertheless, VEC is still in its infancy when it comes to the use of quantum-inspired optimization . Simulations or theoretical models in controlled settings have been the subject of the majority of previous research . Empirical research that assesses these algorithms performance in actual VEC scenarios-taking into account variables like vehicle mobility patterns fluctuating network conditions and a range of application requirements is desperately needed. Furthermore, issues with quantum-inspired algorithms computational overhead and integration with current VEC infrastructures must be resolved . In summary the introduction of quantum-inspired optimization presents a promising approach to tackling the intricate and ever-changing problems present in vehicular networks even though conventional optimization techniques have established the foundation for resource allocation in VEC . To fully utilize these novel strategies and guarantee effective scalable and flexible resource management in upcoming VEC systems more study and development are necessary . Consequently edge-based allocation has gained popularity as a research topic in recent years. The resource constraints study for the IoT-Edge-Fog-Cloud architecture is shown in Figure 1.
Figure 1. Quantum Bit vs Classic Bit .
3. Methods
3.1. Resource Demand Model
This equation models the dynamic resource demandDit of vehicle i at time t, influenced by its workload Lit and communication needs Cit. Coefficients αi and βi weigh the impact of each factor.
Dit=αi.Lit+βi.Cit+γiMi(t)(1)
Dit: Resource demand of vehicle i at time t
Lit: Computational workload of vehicle i at time t
Ci(t): Communication data rate for vehicle i at time t
αiβi,γi: Weighting coefficients
Mi(t): Determination of contributions of each component.
3.2. Edge Server Utilization
This equation calculates the utilization Uj(t) of edge server j at time t, where total demand from connected vehicles Nj is divided by the server’s total resource capacity Rj.
Ujt=i=1NjDitRj(2)
Uj(t): Utilization of edge server j at time t
Nj: Number of vehicles connected to edge server j
Di(t): Resource demand of vehicle i
Rj: Resource capacity of edge server j
3.3. Quantum-inspired State Representation
The state vector |ψ⟩ is a superposition of M possible resource allocation solutions |xk⟩ weighted by amplitudes ak: This allows simultaneous exploration of multiple solutions.
|ψ =k=1Mak|xk (3)
|ψ⟩: Quantum-inspired state vector
|xk⟩: Basis state representing a solution k
ak: Amplitude (weight) of state k
3.4. Fitness Function for Optimization
Explanation: The fitness function F(x) evaluates solution x by combining latency, energy consumption, and fairness using weighted coefficients w1,w2,w3. Higher values indicate better resource allocations.
Fx=w1.1Latency(x)+w2.1Energy(x)+w3Fairness(x)(4)
F(x): Fitness of solution x
Latency(x): Average latency under solution x
Energy(x): Energy consumed under solution x
Fairness(x): Fairness index of resource distribution
w1,w2,w3: Weights for each criterion
3.5. Rate of Packet Loss
Packet loss rate Ploss(t) at time t is calculated as the ratio of lost packets over sent packets, indicating communication reliability in simulations.
Ploss=1-Nreceived(t)Nsent(t)(5)
Ploss: Packet loss rate at time t
Nreceived(t): Number of packets received successfully at time t
Nsent(t): Number of packets sent at time t
3.6. Average Task Completion Time
This computes the average completion time Tcomp for tasks across N vehicles, summing task start delay, processing time, and communication delay.
Tcomp=1Ni=1N(Tstart,i+TProc,i+Tcomm,i)(6)
Tcomp: Average task completion time
Tstart,i: Start delay for vehicle i
Tproc,i: Processing time for vehicle i
Tcomm,i: Communication delay for vehicle i
N: Number of vehicles
Table 1. Quantum State Dataset .

S.No.

State

Probability

1

1

16-Mar

2

101

16-Mar

3

110

16-Jan

4

11

16-Mar

5

100

16-Jan

6

0

16-Jan

7

111

16-Mar

8

10

16-Jan

The figure 2 diagram illustrates a quantum-inspired optimization model for resource allocation in vehicular edge computing (VEC). Vehicles dynamically generate tasks with varying computational and communication demands. These requests are sent to the edge resource manager, which uses a quantum-inspired algorithm to evaluate optimal allocations. The algorithm encodes multiple resource allocation solutions using quantum amplitude encoding, selects the best-fit solution based on latency, energy, and fairness metrics, and dispatches tasks to edge servers. Feedback loops monitor server utilization and update quantum states accordingly. The compact design captures the integration of VEC architecture, real-time optimization, and adaptive resource distribution in a scalable system.
Figure 2. Quantum inspired Optimization.
3.7. Efficiency Ratio
Efficiency ratio Er compares the fitness values of quantum-inspired Fquantum and traditional Ftraditionalsolutions, showing relative performance improvement.
Er=FquantumFtraditional(7)
Er: Efficiency ratio
Fquantum: Fitness value from quantum-inspired method
Ftraditional: Fitness value from traditional method
3.8. Scalability Index
Scalability index S evaluates how computation time changes when the system scales from Nbase to Nscaledvehicles, with times Tbase and Tscaled. A higher S indicates better scalability.
S=TbaseTscaled×NscaledNbase(8)
S: Scalability index
Tbase, Tscaled: Computation times before and after scaling
Nbase, Nscaled: Number of vehicles before and after scaling
3.9. Responsiveness (Convergence Time)
Explanation: Responsiveness R measures the minimum time t for the optimization algorithm to converge within an error margin ϵ of the optimal fitness F*.
R=min{t:|Ft-F*|<ϵ}(9)
R: Responsiveness time
F(t): Fitness value at time t
F*: Optimal fitness value
ϵ: Small error threshold
3.10. Resource Utilization Fairness (Jain’s Index)
Jain’s fairness index J measures how evenly resources Ui are distributed among N vehicles; values close to 1, indicating fair allocation.
J=i=1NUi2Ni=1NUi2(10)
J: Fairness index
Ui: Resource utilization of vehicle i
N: Number of vehicles
4. Results and Discussion
4.1. Vehicle Resource Demand over Time
Figure 3 illustrates how the resource demands of 10 vehicles fluctuate over 100 times step. Each vehicle displays unique demand patterns based on dynamically generated workload and communication needs. At peak moments, demand levels reach up to approximately 18 units, while the minimum observed demand is about 7 units. These oscillations reflect the interplay of periodic workload and communication requirements in the dynamic resource model (Equation (1)). Notably, some vehicles, such as Vehicle 5 and Vehicle 8, show more pronounced volatility, indicating higher variability in their operational resource usage over time.
Figure 3. Vehicle Resource Demand over Time.
4.2. Edge Server Utilization over Time
Figure 4 presents a 3D surface plot of utilization ratios across three edge servers over time, based on Equation (2). Server utilization ranges from about 0.2 to 1.4%, relative to each server's individual capacity. Peak utilization is evident in Server 2, indicating a higher aggregation of vehicle demand in that server’s domain. The surface height and color intensity depict higher load periods and potential overload risks. Variations arise due to both random assignment of vehicles to servers and time-varying resource demands, which cause uneven server loads, especially noticeable at time steps around t = 60–80 seconds.
Figure 4. Edge Server Utilization over Time.
4.3. Quantum State Representation
Figure 5 displays quantum-inspired state amplitudes of 50% solution states using bar and polar plots, as described by Equation (3). The normalized amplitudes range from 0.001 to 0.05 weights, with the highest amplitude observed around solution index 12. This quantum representation supports probabilistic selection of solution candidates, emphasizing those with higher amplitudes. The polar plot provides a circular view of these amplitudes, where outer points indicate more probable solutions. This approach mimics quantum computing behavior, offering better diversity in solution space compared to deterministic methods, which is advantageous for solving complex optimization tasks in edge computing.
Figure 5. Quantum State Amplitudes.
4.4. Fitness Function Landscape
Figure 6 showcases a 3D landscape of the fitness function described in Equation (4), based on latency, energy, and fairness. The fitness value spans from 2.0 to 4.0%, peaking in regions with moderate latency and low energy costs. This surface illustrates how optimal combinations of these three objectives lead to improved system performance. Regions of steep gradients indicate sensitive zones where small changes in factors result in significant performance shifts. This visual representation helps identify balance points among competing metrics, with peak performance achieved when latency and energy usage are both efficiently managed.
Figure 6. Fitness Function Landscape.
4.5. Packet Loss Rate Analysis
Figure 7 analyzes packet loss over time using Equation (5). The packet loss rate fluctuates between 0.0 and 0.18%, with the number of lost packets ranging from 0 to 9% per time step. The highest packet loss rate occurs around t = 45, possibly due to poor communication conditions or high demand congestion. The dual-axis plot clearly distinguishes the proportion (loss rate) and the absolute number (lost packets). This visualization emphasizes how both metrics contribute to evaluating communication reliability and how performance degrades when too many packets are dropped during transmission.
Figure 7. Packet Loss Rate Analysis.
4.6. Task Completion Time Breakdown
Figure 6 illustrates the total task completion time and its components using Equation (6). The average task completion time ranges between 1.5 and 3.5 seconds, peaking around t = 40–60. Start delay, processing time, and communication delay are shown as broken lines, with communication delay being the least and processing time the most dominant contributor. The area plot highlights how cumulative delays evolve over time. This breakdown provides insights into which task phases contribute most to latency, helping in optimizing processing algorithms or improving communication infrastructure for better responsiveness.
Figure 8. Task Completion Time Breakdown.
4.7. Quantum vs Traditional Efficiency
Figure 9 compares fitness gains from quantum-inspired and traditional optimization algorithms as per Equation (7). The quantum approach accumulates fitness values faster, reaching around 60% at t = 100, while the traditional method trails slightly below 100 seconds. The efficiency ratio (quantum/traditional) peaks at 1.35, indicating up to 35% better performance using the quantum method. This comparison validates the improved adaptability and exploration ability of quantum algorithms, especially in dynamic and resource-constrained environments. The visual clearly supports the hypothesis that quantum-inspired models outperform traditional counterparts in long-term optimization tasks.
Figure 9. Quantum vs Traditional Efficiency.
4.8. Scalability Analysis
Figure 10 demonstrates how well the system scales using Equation (8). For vehicle counts of 20, 50, 100, and 200, the scalability index declines from 0.95 to 0.55, indicating sublinear scalability. The log-log plot compares the system's actual performance (blue line) to ideal linear scaling (red dashed line). Although the system maintains good performance up to 50 vehicles, performance degrades noticeably beyond that, especially at 200 vehicles. This drop suggests the need for better resource allocation or more efficient scheduling algorithms to maintain performance as demand scales up significantly.
Figure 10. Scalability Analysis.
4.9. Algorithm Convergence
Figure 11 shows the responsiveness of the optimization algorithm in reaching optimal fitness as modeled in Equation (9). The fitness curve rises sharply and converges to the optimal value F = 10 at around iteration 45. The convergence point is visually marked by a vertical dashed line, indicating that the algorithm achieves near-optimal performance after 45 iterations. The exponential growth pattern reflects a rapid improvement phase early in the process, followed by stabilization. This indicates efficient optimization behavior, where the solution space is explored quickly and effectively before settling into a high-quality result.
Figure 11. Algorithm Convergence.
4.10. Jain’s Fairness Index
Figure 12 visualizes the fairness in resource allocation using Jain’s Index from Equation (10). The calculated fairness index is J = 0.914, signifying highly equitable distribution of resources among the 10 vehicles. The pie chart highlights that approximately 91.4% of the allocation is fair, while the remaining 8.6% accounts for minor disparities. This index is vital in edge computing systems where fairness ensures all vehicles receive a reasonable share of computational and communication resources, reducing the likelihood of bottlenecks or service denials. The high fairness score confirms that the system maintains a balanced allocation strategy.
Figure 12. Jains Fairness Index.
5. Conclusions
A quantum-inspired optimization framework for dynamic resource allocation in Vehicular Edge Computing (VEC) environments was proposed and assessed in this study. The growing complexity of real-time computation and communication resource management across extremely mobile and uncertain vehicular networks served as the driving force. In comparison to conventional optimization techniques the suggested method showed notable gains in system performance by combining quantum-state representation with a multi-objective fitness function that takes latency energy efficiency and fairness into account. The main findings demonstrated that quantum-inspired approaches increased optimization efficiency by up to 35% achieving faster convergence (45 iterations to reach optimal fitness) and more equitable resource distribution (one vehicle Jains Fairness Index was 0. 914). The framework also showed insights into the dynamics of task demand with resource usage ranging from 7 to 18 units and edge server utilization between 0 and 2 to 1 and 4 normalized units. These findings support the applicability of quantum-inspired strategies for addressing the multifaceted and dynamic nature of VEC resource allocation problems. But there are some restrictions on the study. Even though the simulation environment was reliable it only had ten cars and three servers which might not accurately represent the size and complexity of the real world. Moreover, the quantum-inspired model does not make use of real quantum hardware and functions in a hybrid classical environment which could result in scalability issues as the number of cars or computing nodes increases dramatically. The absence of integration with security-aware scheduling which is essential in vehicular networks where data sensitivity is high is another drawback. Additionally, the study points out gaps that need to be filled by more research. One such gap is the lack of actual vehicle trace data which is necessary to validate the model in scenarios of network congestion and realistic mobility patterns. Also, incorporating energy harvesting methods with 5G-capable VEC infrastructures may enhance resource optimization in the context of upcoming smart transportation paradigms.
Abbreviations

VEC

Vehicular Edge Computing

Acknowledgments
Rivers State University Port Harcourt. University of Port Harcourt and Kenule Beeson Saro-Wiwa Polytechnic Bori, University of Port-Harcourt Nigeria all in Rivers State are highly appreciated for providing the platform for which the authors gained experience that made this research possible. We are grateful.
Author Contributions
Friday Oodee Philip-Kpae: Data curation, Investigation, Methodology, Resources, Software, Visualizatio, Writing – review & editing
Nwazor Nkolika: Investigation, Methodolog, Project administration, Resources, Software, Writing – review & editing
Boona Stanley Toobari: Investigation, Methodology, Resources, Writing – original draft, Writing – review & editing
Funding
The authors received no funding from any external source.
Conflicts of Interest
The authors declare no conflicts of interests.
References
[1] Amgoth T. and Adhikari Mdot. A heuristic algorithm for allocating load in cloud environments that use Infrastructure as a Service (IaaS). 156–165 in Future Generation Computer Systems 81. 2018.
[2] Ajmal and M. S. Iqbal Z. Khan F. Z. Ahmad I. Ahmad Mdot. and Gupta B. B. An improved hybrid ant-genetic strategy for effective1 task scheduling in cloud data centers. Electrical & Computer Engineering 95 107419. 2021.
[3] Belgaum M. R. Soomro Z. Alansari S. D. and M. Alam. For real-time cloud scheduling load balancing with checkpointing and service prioritization are used. *Advances in Intelligent Engineering and Advanced Computing (pp. 667–676., 2018. Springer.
[4] Sood S. K. and Bhatia Mdot. IoT network optimization based on quantum computing ideas. Journal of the Internet of Things 7(6) 5590–5598, 2020.
[5] Sood M. Bhatia and S. K. & Kaur S. Predictive IoT analytics using fog scheduling with a quantum twist. 51–67, 2019. Computers in Industry 111.
[6] Sood M. Bhatia and S. K. S. Kaur & Kaur. IoT applications using quantum-inspired scheduling for fog computing. Computing 1097–1115 102. 2020.
[7] A. Burns, R. I. Davis, S. Baruah, I. J. Bate. Robust Mixed Criticality Systems. IEEE Transactions on Computers 67(10), (2018) 1478-1491.
[8] E. Capota. A. Stangaciu C. Micea M. V Sdot. & D. I. Curiac. Organizing tasks and new developments in mixed-criticality cyber-physical systems. Systems and Software 156 204–216, 2019.
[9] Chawla A. and Ghumman N. A cloud computing load balancing technique based on task bundling. Big Data Analytics (pp. 71 77). 2018. Publisher: Springer.
[10] Chegini H. Naha R. K. A. Mahanti. & Thulasiraman P. Automation of IoT fog and cloud ecosystems is categorized and investigated. 2(1) 92–118, 2021. IoT.
[11] Chen J. & Ran X. Deep Neural learning in edge computing: a survey. 107(8) 1655–1674 2019. IEEE Proceedings. JPROC
[12] H. Gershengorn et al. Assessing the equity of COVID-19 care resource allocation algorithms in two U. S. S. Medical facilities. 4(3) e214149, 2021, JAMA Network Open.
[13] T. Ghazal. M. et al. Machine learnings role in IoT-powered smart city healthcare. Future Internet 13(8) 218. 2021,
[14] L. Gyongyosi & S. Imre. An extensive examination of quantum computing advancements. Computer Science Review 31 51–71. 2019.
[15] Hajjaji Y. Boulila W. I am Farah. Romdhani I. Rdot. & Hussain A. A thorough analysis of big data and the Internet of Things in smart settings. 100318 Computer Science Review 39. 2021,
[16] N. Hassan. Yau K. L. An. & Wu C. A review of 5G networks edge computing. 127289. IEEE Access 7 127276. 2019.
[17] A. Jamali. J. The U. & R. R. Mondal. A method for resolving imbalanced transportation issues using weighted opportunity costs. Journal of Engineering Science 12, 119–131, (2021).
[18] Kaur K. Kaur N. and Kaur K. A genetic algorithm with system context awareness for cloud scheduling. *Data Engineering and Intelligent Computing (pp. (521–531), 2018. The Springer.
[19] K. Mala. Madhumathi R. & Priyadharshini S. An enhanced Max-Min algorithm for allocating cloud resources optimally. 23rd International Conference on Computing Communication and Networking Technologies (ICCCNT) (pp. 1-5). 2021. The IEEE.
[20] Manocha A., M. Bhatia. A dew computing framework for forecasting asthma based on meteorological and health data. Network and Computer Applications Journal 179 102995. 2021.
[21] A. Manocha. & M. Bhatia. Using multimodal data and deep learning to predict COVID-19. Electrical & Computer Engineering 103 108274. 2022, Dot Compeleceng
[22] Portilla J. mujica G. Lee (J.). S. and Riesgo T. Edge computing solutions for IoT sensing that use extremely little power. Journal of IEEE Sensors 19(9) 3179–3190. 2019.
[23] Ren J. He S. Zhang Y Zhang Ddot. and Li T. An examination of cloudlet fog and edge viewpoints in orchestrated computing. Surveys of ACM Computing 52*(6) 1–36. 2019.
[24] A. Roth. Wüstefeld K., Weichert F. Improved segmentation methods for sensor images with noise. Journal of Imaging 7(11) 206. 2021.
[25] Singh S. and Srivastava S. D. Partition-based load distribution improves cloud computing performance. Computer and Computational Sciences Advances (pp. 301–311), 2018. A Springer.
[26] Z. Tang. X Zhang. K. Li. Li K. and. A load-balancing Spark data placement strategy. 78 287–301, 2018. Future Generation Computer Systems.
[27] Weiqing G. & Yanru C. Cloud task scheduling using a genetic algorithm augmentation. Recent Developments in Electrical and Electronic Engineering 14(1) 13–19. 2021.
[28] Ahanger T. A. Dahan F. Tariq U., Ullah I. A quantum computing-inspired task optimization model for IoT edge and fog setting. Mathematics 11(1) 156. 2022.
Cite This Article
  • APA Style

    Philip-Kpae, F. O., Nkolika, N., Toobari, B. S. (2025). Quantum-inspired Optimization for Efficient Vehicular Edge Computing Resource Allocation in Intelligent Transportation Systems. American Journal of Networks and Communications, 14(2), 47-58. https://doi.org/10.11648/j.ajnc.20251402.13

    Copy | Download

    ACS Style

    Philip-Kpae, F. O.; Nkolika, N.; Toobari, B. S. Quantum-inspired Optimization for Efficient Vehicular Edge Computing Resource Allocation in Intelligent Transportation Systems. Am. J. Netw. Commun. 2025, 14(2), 47-58. doi: 10.11648/j.ajnc.20251402.13

    Copy | Download

    AMA Style

    Philip-Kpae FO, Nkolika N, Toobari BS. Quantum-inspired Optimization for Efficient Vehicular Edge Computing Resource Allocation in Intelligent Transportation Systems. Am J Netw Commun. 2025;14(2):47-58. doi: 10.11648/j.ajnc.20251402.13

    Copy | Download

  • @article{10.11648/j.ajnc.20251402.13,
      author = {Friday Oodee Philip-Kpae and Nwazor Nkolika and Boona Stanley Toobari},
      title = {Quantum-inspired Optimization for Efficient Vehicular Edge Computing Resource Allocation in Intelligent Transportation Systems
    },
      journal = {American Journal of Networks and Communications},
      volume = {14},
      number = {2},
      pages = {47-58},
      doi = {10.11648/j.ajnc.20251402.13},
      url = {https://doi.org/10.11648/j.ajnc.20251402.13},
      eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajnc.20251402.13},
      abstract = {The increasing adoption of smart mobility and connected vehicles necessitates significant improvements in underlying infrastructure, particularly in real-time data processing and decision-making. Vehicular Edge Computing (VEC) has emerged as a vital solution by enabling computation closer to data sources, thereby reducing latency and reliance on centralized cloud systems. However, efficient allocation of edge resources (processing power, bandwidth, and storage) remains a critical challenge due to the highly dynamic, decentralized nature of vehicular networks. Traditional optimization techniques often fall short under these conditions. This study explores a quantum-inspired optimization framework designed to enhance resource management in VEC environments by leveraging principles of quantum computing such as superposition and probabilistic state selection within classical hardware. Extensive simulations involving 10 vehicles and 3 edge servers were conducted to evaluate the framework's performance. The dynamic resource demand fluctuated between 7 and 18 units, and server utilization ranged from 0.2% to 1.4%, illustrating diverse operational conditions. The proposed quantum-inspired model showed superior efficiency, achieving up to 35% improvement in fitness gain compared to traditional algorithms, with convergence to optimal fitness in just 45 iterations. The solution space was explored effectively using quantum state amplitude representations, which improved solution diversity and robustness in decision-making. Furthermore, fairness in resource distribution was evaluated using Jain’s Fairness Index, yielding a high score of 0.914, demonstrating equitable allocation among vehicles. Additional results revealed that task completion times ranged from 1.5 to 3.5 seconds, with processing delays being the major contributor. The system exhibited sublinear scalability, performing well up to 50 vehicles but declining as the vehicle count increased to 200, indicating a need for further optimization strategies. Although the model operates in a classical environment without quantum hardware, it offers substantial performance benefits. This research highlights the potential of quantum-inspired optimization for real-time, fair, and scalable resource management in vehicular networks. Future work should incorporate real-world vehicular trace data, expand scalability tests, and explore integration with 5G and energy harvesting mechanisms. These advancements will further support intelligent, secure, and sustainable transportation systems driven by edge computing technologies.},
     year = {2025}
    }
    

    Copy | Download

  • TY  - JOUR
    T1  - Quantum-inspired Optimization for Efficient Vehicular Edge Computing Resource Allocation in Intelligent Transportation Systems
    
    AU  - Friday Oodee Philip-Kpae
    AU  - Nwazor Nkolika
    AU  - Boona Stanley Toobari
    Y1  - 2025/07/28
    PY  - 2025
    N1  - https://doi.org/10.11648/j.ajnc.20251402.13
    DO  - 10.11648/j.ajnc.20251402.13
    T2  - American Journal of Networks and Communications
    JF  - American Journal of Networks and Communications
    JO  - American Journal of Networks and Communications
    SP  - 47
    EP  - 58
    PB  - Science Publishing Group
    SN  - 2326-8964
    UR  - https://doi.org/10.11648/j.ajnc.20251402.13
    AB  - The increasing adoption of smart mobility and connected vehicles necessitates significant improvements in underlying infrastructure, particularly in real-time data processing and decision-making. Vehicular Edge Computing (VEC) has emerged as a vital solution by enabling computation closer to data sources, thereby reducing latency and reliance on centralized cloud systems. However, efficient allocation of edge resources (processing power, bandwidth, and storage) remains a critical challenge due to the highly dynamic, decentralized nature of vehicular networks. Traditional optimization techniques often fall short under these conditions. This study explores a quantum-inspired optimization framework designed to enhance resource management in VEC environments by leveraging principles of quantum computing such as superposition and probabilistic state selection within classical hardware. Extensive simulations involving 10 vehicles and 3 edge servers were conducted to evaluate the framework's performance. The dynamic resource demand fluctuated between 7 and 18 units, and server utilization ranged from 0.2% to 1.4%, illustrating diverse operational conditions. The proposed quantum-inspired model showed superior efficiency, achieving up to 35% improvement in fitness gain compared to traditional algorithms, with convergence to optimal fitness in just 45 iterations. The solution space was explored effectively using quantum state amplitude representations, which improved solution diversity and robustness in decision-making. Furthermore, fairness in resource distribution was evaluated using Jain’s Fairness Index, yielding a high score of 0.914, demonstrating equitable allocation among vehicles. Additional results revealed that task completion times ranged from 1.5 to 3.5 seconds, with processing delays being the major contributor. The system exhibited sublinear scalability, performing well up to 50 vehicles but declining as the vehicle count increased to 200, indicating a need for further optimization strategies. Although the model operates in a classical environment without quantum hardware, it offers substantial performance benefits. This research highlights the potential of quantum-inspired optimization for real-time, fair, and scalable resource management in vehicular networks. Future work should incorporate real-world vehicular trace data, expand scalability tests, and explore integration with 5G and energy harvesting mechanisms. These advancements will further support intelligent, secure, and sustainable transportation systems driven by edge computing technologies.
    VL  - 14
    IS  - 2
    ER  - 

    Copy | Download

Author Information
  • Abstract
  • Keywords
  • Document Sections

    1. 1. Introduction
    2. 2. Literature Review
    3. 3. Methods
    4. 4. Results and Discussion
    5. 5. Conclusions
    Show Full Outline
  • Abbreviations
  • Acknowledgments
  • Author Contributions
  • Funding
  • Conflicts of Interest
  • References
  • Cite This Article
  • Author Information