Micro-mobility dispatch optimization via quantum annealing incorporating historical data

• URL: http://arxiv.org/abs/2601.20887v1
• Date: Wed, 28 Jan 2026 02:19:54 GMT
• Title: Micro-mobility dispatch optimization via quantum annealing incorporating historical data
• Authors: Takeru Goto, Masayuki Ohzeki,
• Abstract summary: This paper proposes a novel dispatch formulation for micro-mobility vehicles using a Quantum Annealer (QA)<n>The proposed formulation incorporates historical usage data to enhance operational efficiency.
• Score: 0.7734726150561088
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This paper proposes a novel dispatch formulation for micro-mobility vehicles using a Quantum Annealer (QA). In recent years, QA has gained increasing attention as a high-performance solver for combinatorial optimization problems. Meanwhile, micro-mobility services have been rapidly developed as a promising means of realizing efficient and sustainable urban transportation. In this study, the dispatch problem for such micro-mobility services is formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem, enabling efficient solving through QA. Furthermore, the proposed formulation incorporates historical usage data to enhance operational efficiency. Specifically, customer arrival frequencies and destination distributions are modeled into the QUBO formulation through a Bayesian approach, which guides the allocation of vacant vehicles to designated stations for waiting and charging. Simulation experiments are conducted to evaluate the effectiveness of the proposed method, with comparisons to conventional formulations such as the vehicle routing problem. Additionally, the performance of QA is compared with that of classical solvers to reveal its potential advantages for the proposed dispatch formulation. The effect of reverse annealing on improving solution quality is also investigated.

Related papers

• PASS-Enhanced MEC: Joint Optimization of Task Offloading and Uplink PASS Beamforming [67.78883135636657]
  pinching-antenna system (PASS)-enhanced mobile edge computing (MEC) architecture is investigated.<n>PASS establishes short-distance line-of-sight (LoS) links while effectively mitigating the significant path loss and potential signal blockage.<n>We formulate a network latency minimization problem to joint optimize uplink PASS beamforming and task offloading.
  arXiv  Detail & Related papers  (2025-10-27T03:04:46Z)
• Joint Optimization of Electric Vehicle Routes and Charging Locations Learning Charge Constraints Using QUBO Solver [5.616693462159185]
  We focus on the joint optimization of the location of charging stations and the routing of electric vehicles (EVs)<n>We propose a sequential optimization method utilizing the Bayesian inference and QUBO solvers, in which method the battery capacity constraints are automatically learned.<n>Applying this method to a routing problem of 20 locations, we confirmed that the learning process works well and efficient searches find good solutions.
  arXiv  Detail & Related papers  (2025-06-05T07:08:19Z)
• Preference Optimization for Combinatorial Optimization Problems [54.87466279363487]
  Reinforcement Learning (RL) has emerged as a powerful tool for neural optimization, enabling models learns that solve complex problems without requiring expert knowledge.<n>Despite significant progress, existing RL approaches face challenges such as diminishing reward signals and inefficient exploration in vast action spaces.<n>We propose Preference Optimization, a novel method that transforms quantitative reward signals into qualitative preference signals via statistical comparison modeling.
  arXiv  Detail & Related papers  (2025-05-13T16:47:00Z)
• An Advanced Hybrid Quantum Tabu Search Approach to Vehicle Routing Problems [8.542666941016572]
  Hybrid approaches where QC and classical computing work together have shown the most potential for solving real-world scale problems.<n>We present a new hybrid quantum-classical tabu search (HQTS) algorithm to solve the capacitated vehicle routing problem (RPCV)<n>HQTS achieved optimal or near-optimal solutions for several CVRP problems, outperforming other hybrid CVRP algorithms.
  arXiv  Detail & Related papers  (2025-01-22T05:29:27Z)
• Preventing Local Pitfalls in Vector Quantization via Optimal Transport [77.15924044466976]
  We introduce OptVQ, a novel vector quantization method that employs the Sinkhorn algorithm to optimize the optimal transport problem.<n>Our experiments on image reconstruction tasks demonstrate that OptVQ achieves 100% codebook utilization and surpasses current state-of-the-art VQNs in reconstruction quality.
  arXiv  Detail & Related papers  (2024-12-19T18:58:14Z)
• Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem [0.0]
  The Tail Assignment Problem (TAP) is a critical optimization challenge in airline operations.<n>This work applies the Quantum Approximate Optimization Algorithm (QAOA) to the TAP.<n>The analysis reveals the current limitations of quantum hardware but suggests potential advantages as technology advances.
  arXiv  Detail & Related papers  (2024-12-17T10:35:26Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• A Feasibility-Preserved Quantum Approximate Solver for the Capacitated Vehicle Routing Problem [3.0567007573383678]
  The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO) that arises in various fields including transportation and logistics. We present a new binary encoding for the CVRP, with an objective function of minimizing the shortest path that bypasses the vehicle capacity constraint of the CVRP. We discuss the effectiveness of the proposed encoding under the framework of the variant of the Quantum Alternating Operator Ansatz.
  arXiv  Detail & Related papers  (2023-08-17T05:14:43Z)
• Quantum computing for transport optimization [1.181206257787103]
  We explore the near-term intersection of quantum computing with the transport sector. We introduce a framework for assessing the suitability of transport optimization problems for obtaining potential performance enhancement using quantum algorithms. We present a workflow for obtaining valuable transport solutions using quantum computers, articulate the limitations on contemporary systems, and describe newly available performance-enhancing tools.
  arXiv  Detail & Related papers  (2022-06-15T05:56:22Z)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Data Freshness and Energy-Efficient UAV Navigation Optimization: A Deep Reinforcement Learning Approach [88.45509934702913]
  We design a navigation policy for multiple unmanned aerial vehicles (UAVs) where mobile base stations (BSs) are deployed. We incorporate different contextual information such as energy and age of information (AoI) constraints to ensure the data freshness at the ground BS. By applying the proposed trained model, an effective real-time trajectory policy for the UAV-BSs captures the observable network states over time.
  arXiv  Detail & Related papers  (2020-02-21T07:29:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.