Benchmarking Classical and Quantum Optimization Approaches for Rider-Order Assignment
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910020474503168 |
|---|---|
| author | SAPV, Tharrmashastha Palanivel, Surya Prakash Gulati, Jasjyot Singh Pandi, M Maruthu |
| author_facet | SAPV, Tharrmashastha Palanivel, Surya Prakash Gulati, Jasjyot Singh Pandi, M Maruthu |
| contents | The logistics industry is widely regarded as a promising application domain for emerging optimization paradigms, including quantum computing. The Rider-Order Assignment problem is a practically motivated optimization problem arising in online food delivery and related logistics applications. While the problem is closely related to the classical matching problem, the inclusion of realistic operational constraints renders it computationally challenging. In this work, we formulate the Rider-Order Assignment problem as a constrained binary optimization problem and perform a comparative analysis of classical, quantum-inspired, and gate-based quantum solvers for this problem across multiple instance sizes. Solver performance is assessed using solution quality, computational runtime, and constraint satisfaction, with a consistent post-processing procedure applied to ensure feasibility. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2602_11895 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Benchmarking Classical and Quantum Optimization Approaches for Rider-Order Assignment SAPV, Tharrmashastha Palanivel, Surya Prakash Gulati, Jasjyot Singh Pandi, M Maruthu Quantum Physics The logistics industry is widely regarded as a promising application domain for emerging optimization paradigms, including quantum computing. The Rider-Order Assignment problem is a practically motivated optimization problem arising in online food delivery and related logistics applications. While the problem is closely related to the classical matching problem, the inclusion of realistic operational constraints renders it computationally challenging. In this work, we formulate the Rider-Order Assignment problem as a constrained binary optimization problem and perform a comparative analysis of classical, quantum-inspired, and gate-based quantum solvers for this problem across multiple instance sizes. Solver performance is assessed using solution quality, computational runtime, and constraint satisfaction, with a consistent post-processing procedure applied to ensure feasibility. |
| title | Benchmarking Classical and Quantum Optimization Approaches for Rider-Order Assignment |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2602.11895 |