pith. sign in

arxiv: 2311.17772 · v1 · pith:3LVGMWQCnew · submitted 2023-11-29 · 🪐 quant-ph · math.OC

When Mei-Gu Guan's 1960 Postmen Get Empowered with Bell's 1964 Nonlocal Correlations, or, Nonlocal Advantage in Vehicle Routing Problem

classification 🪐 quant-ph math.OC
keywords problemnonlocalroutingvehiclechinesecorrelationspostmanpostmen
0
0 comments X
read the original abstract

Vehicle routing problems, a comprehensive problem category originated from the seminal Chinese Postman Problem (first investigated by Chinese mathematician Mei-Gu Guan), entail strategic and tactical decision making for efficient scheduling and routing of vehicles. While Chinese postman problem is aimed at finding the minimum length cycle for a single postman, the broader challenges encompass scenarios with multiple postmen. Making cost-effective decisions in such cases depends on various factors, including vehicle sizes and types, vehicle usage time, road tax variations across routes, and more. In this work, we delve into a class of such problems wherein Bell nonlocal correlations provide advantages in optimizing the costs for non-communicating postmen, and thus establish a nascent utilization of quantum entanglement in traffic routing problem. Our investigation unveils promising applications for nonlocal correlations within combinatorial optimization and operational research problems, which otherwise have predominantly been explored within the quantum foundation and quantum information theory community.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.