Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing

DOI10.1007/S11128-022-03670-YOpenAlexW4297997184MaRDI QIDQ2104772FDOQ2104772

Authors Krzysztof Domino, Akash Kundu, Özlem Salehi, Krzysztof Krawiec

Publication date 7 December 2022

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2107.03234

zbMATH Keywords

D-wave annealerhigher-order binary optimizationquantum-classical hybrid procedurerailway reroutingrailway rescheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Quantum computation (81P68) Boolean programming (90C09)

Recommendations

• Unconstrained binary models of the travelling salesman problem variants for quantum optimization
• Optimal Seating Assignment in the COVID-19 Era via Quantum Computing
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• Embedding equality constraints of optimization problems into a quantum annealer
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models

Cites work

• scientific article; zbMATH DE number 5899272 (Why is no real title available?)
• scientific article; zbMATH DE number 3473554 (Why is no real title available?)
• A branch and bound algorithm for scheduling trains in a railway network
• A survey of optimization models for train routing and scheduling
• Approaches to modeling train scheduling problems as job-shop problems with blocking constraints
• NP-hardness of shop-scheduling problems with three jobs
• Polynomial unconstrained binary optimisation -- part 1
• Pseudo-Boolean optimization
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
• Quantum stochastic optimization
• Scheduling trains as a blocking parallel-machine job shop scheduling problem
• Scheduling. Theory, algorithms, and systems.
• Unconstrained binary models of the travelling salesman problem variants for quantum optimization

Cited in

(5)

• Quantum annealing to solve the unrelated parallel machine scheduling problem
• High-speed train timetable optimization based on space-time network model and quantum simulator
• Unconstrained binary models of the travelling salesman problem variants for quantum optimization
• Evaluating the practicality of quantum optimization algorithms for prototypical industrial applications
• Optimal Seating Assignment in the COVID-19 Era via Quantum Computing

Describes a project that uses

Uses Software

• Cbc
• PuLP

This page was built for publication: Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104772)