An Optimization Case Study for solving a Transport Robot Scheduling Problem on Quantum-Hybrid and Quantum-Inspired Hardware
Preprint
Abstract
We present a comprehensive case study comparing the performance of D-Waves' quantum-classical hybrid framework, Fujitsu's quantum-inspired digital annealer, and Gurobi's state-of-the-art classical solver in solving a transport robot scheduling problem. This problem originates from an industrially relevant real-world scenario. We provide three different models for our problem following different design philosophies. In our benchmark, we focus on the solution quality and end-to-end runtime of different model and solver combinations. We find promising results for the digital annealer and some opportunities for the hybrid quantum annealer in direct comparison with Gurobi. Our study provides insights into the workflow for solving an application-oriented optimization problem with different strategies, and can be useful for evaluating the strengths and weaknesses of different approaches.Keywords
All Related Versions
This publication has 51 references indexed in Scilit:
- Quantum Computing Techniques for Multi-knapsack Problems2023
- Solving the Extended Job Shop Scheduling Problem with AGVs – Classical and Quantum Approaches2022
- Foundations for Workflow Application Scheduling on D-Wave System2020
- Embedding Algorithms for Quantum Annealers with Chimera and Pegasus Connection Topologies2020
- Scheduling2016
- Throughput Optimization in Robotic Cells2007
- Scheduling Algorithms2007
- Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithmJournal of Optimization Theory and Applications, 1985
- Some new results in flow shop schedulingMathematical Methods of Operations Research, 1984
- An integer linear‐programming model for machine schedulingNaval Research Logistics Quarterly, 1959