Adiabatic Quantum Computing for Logistic Transport Optimization

• URL: http://arxiv.org/abs/2301.07691v1
• Date: Wed, 18 Jan 2023 18:27:41 GMT
• Title: Adiabatic Quantum Computing for Logistic Transport Optimization
• Authors: Juan Francisco Ari\~no Sales and Ra\'ul Andres Palacios Araos
• Abstract summary: We aim to tackle the vehicle optimization problem from the last mile logistic scenario application. We provide the results of the analysis and proposal for the consideration of applications in a near term business case scenario.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Current world trade is based and supported in a strong and healthy supply chain, where logistics play a key role in producing and providing key assets and goods to keep societies and economies going. Current geopolitical and sanitary challenges faced in the entire world have made even more critical the role of logistics and increased demands for tuning transport function to keep the supply chain up and running. The challenge is only increasing and growing for the future, thus tackling transport optimization provides both business and social value. Optimization problems are ubiquitous and they present a challenge due to its complexity, where they're typically NP-hard problems. Quantum Computing is a developing field, and the Quantum Annealing approach has proven to be quite effective in its applicability and usefulness to tackle optimization problems. In this work we treat the Vehicle Routing Problem, which is also a variation of a famous optimization problem known as the Traveling Salesman Problem. We aim to tackle the vehicle optimization problem from the last mile logistic scenario application, with a perspective from the classical and quantum approaches, and providing a solution which combines both, also known as hybrid solution. Finally, we provide the results of the analysis and proposal for the consideration of applications in a near term business case scenario.

Related papers

• A Quantum Optimization Algorithm for Optimal Electric Vehicle Charging Station Placement for Intercity Trips [5.188841610098436]
  Electric vehicles (EVs) play a significant role in enhancing the sustainability of transportation systems. Finding optimal charging station locations in large transportation networks presents a well-known NP-hard optimization problem. This paper introduces a quantum search-based optimization algorithm designed to enhance the efficiency of solving this NP-hard problem.
  arXiv  Detail & Related papers  (2024-10-21T17:37:38Z)
• OTClean: Data Cleaning for Conditional Independence Violations using Optimal Transport [51.6416022358349]
  sys is a framework that harnesses optimal transport theory for data repair under Conditional Independence (CI) constraints. We develop an iterative algorithm inspired by Sinkhorn's matrix scaling algorithm, which efficiently addresses high-dimensional and large-scale data.
  arXiv  Detail & Related papers  (2024-03-04T18:23:55Z)
• A Computational Framework for Solving Wasserstein Lagrangian Flows [48.87656245464521]
  In general, the optimal density path is unknown, and solving these variational problems can be computationally challenging. We propose a novel deep learning based framework approaching all of these problems from a unified perspective. We showcase the versatility of the proposed framework by outperforming previous approaches for the single-cell trajectory inference.
  arXiv  Detail & Related papers  (2023-10-16T17:59:54Z)
• Exploring the topological sector optimization on quantum computers [5.458469081464264]
  topological sector optimization (TSO) problem attracts particular interests in the quantum many-body physics community. We demonstrate that the optimization difficulties of TSO problem are not restricted to the gaplessness, but are also due to the topological nature. To solve TSO problems, we utilize quantum imaginary time evolution (QITE) with a possible realization on quantum computers.
  arXiv  Detail & Related papers  (2023-10-06T14:51:07Z)
• Light Unbalanced Optimal Transport [69.18220206873772]
  Existing solvers are either based on principles or heavy-weighted with complex optimization objectives involving several neural networks. We show that our solver provides a universal approximation of UEOT solutions and obtains its generalization bounds.
  arXiv  Detail & Related papers  (2023-03-14T15:44:40Z)
• Transit facility allocation: Hybrid quantum-classical optimization [0.0]
  Transit facility consolidation is a cost-effective way to improve the quality of service. This paper develops an optimization framework that integrates GIS, decision-making analysis, and quantum technologies. We demonstrate the effectiveness of our framework by reducing the number of facilities by 40% while maintaining the same service accessibility.
  arXiv  Detail & Related papers  (2022-10-22T21:53:00Z)
• Supply Chain Logistics with Quantum and Classical Annealing Algorithms [0.0]
  Noisy intermediate-scale quantum (NISQ) hardware is almost universally incompatible with full-scale optimization problems of practical importance. We investigate a problem of substantial commercial value, multi-truck vehicle routing for supply chain logistics, at the scale used by a corporation in their operations. Our work gives a set of techniques that can be adopted in contexts beyond vehicle routing to apply NISQ devices in a hybrid fashion to large-scale problems of commercial interest.
  arXiv  Detail & Related papers  (2022-05-09T17:36:21Z)
• 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)
• Multi-Objective Constrained Optimization for Energy Applications via Tree Ensembles [55.23285485923913]
  Energy systems optimization problems are complex due to strongly non-linear system behavior and multiple competing objectives. In some cases, proposed optimal solutions need to obey explicit input constraints related to physical properties or safety-critical operating conditions. This paper proposes a novel data-driven strategy using tree ensembles for constrained multi-objective optimization of black-box problems.
  arXiv  Detail & Related papers  (2021-11-04T20:18:55Z)
• The Factory Must Grow: Automation in Factorio [3.877356414450363]
  In this paper we define the logistic transport belt problem and define integer programming model of it. We present results for Simulated Annealing, quick Genetic Programming and Evolutionary Reinforcement Learning, three different meta-heuristic techniques to optimize this novel problem.
  arXiv  Detail & Related papers  (2021-02-09T15:14:27Z)
• Constraint Programming Algorithms for Route Planning Exploiting Geometrical Information [91.3755431537592]
  We present an overview of our current research activities concerning the development of new algorithms for route planning problems. The research so far has focused in particular on the Euclidean Traveling Salesperson Problem (Euclidean TSP) The aim is to exploit the results obtained also to other problems of the same category, such as the Euclidean Vehicle Problem (Euclidean VRP), in the future.
  arXiv  Detail & Related papers  (2020-09-22T00:51:45Z)

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.