Quantum annealing for the adjuster routing problem

In the event of a disaster such as an earthquake, insurance companies basically conduct on-site witnessing. Depending on the scale of the disaster, hundreds of adjusters are dispatched from each office to the affected buildings per day. In such cases, which adjusters will witness which buildings and...

Full description

Bibliographic Details
Main Authors: Naoya Mori, Satoshi Furukawa
Format: Article
Language:English
Published: Frontiers Media S.A. 2023-03-01
Series:Frontiers in Physics
Subjects:
Online Access:https://www.frontiersin.org/articles/10.3389/fphy.2023.1129594/full
_version_ 1797869319841906688
author Naoya Mori
Satoshi Furukawa
author_facet Naoya Mori
Satoshi Furukawa
author_sort Naoya Mori
collection DOAJ
description In the event of a disaster such as an earthquake, insurance companies basically conduct on-site witnessing. Depending on the scale of the disaster, hundreds of adjusters are dispatched from each office to the affected buildings per day. In such cases, which adjusters will witness which buildings and in what order must be determined, and the route must be optimized to conduct efficient witnessing. In this study, we define this witnessing route decision as an optimization problem and propose the adjuster routing problem (ARP). The ARP can be viewed as an extension of the vehicle routing problem (VRP). We introduce constraints not to be considered in the usual VRP, such as adjuster-building matching and satisfying the desired time. The VRP is an NP-hard optimization problem and is considered difficult to solve on a classical computer. Therefore, we formulated various constraints in QUBO so that quantum annealing can be applied to the ARP. In addition, we conducted numerical experiments with D-Wave. The ARP is a real problem, and our research provides a new example of applications of quantum annealing to real-world problems.
first_indexed 2024-04-10T00:10:48Z
format Article
id doaj.art-308e3fde002c453d877b25adf82ca342
institution Directory Open Access Journal
issn 2296-424X
language English
last_indexed 2024-04-10T00:10:48Z
publishDate 2023-03-01
publisher Frontiers Media S.A.
record_format Article
series Frontiers in Physics
spelling doaj.art-308e3fde002c453d877b25adf82ca3422023-03-16T08:48:53ZengFrontiers Media S.A.Frontiers in Physics2296-424X2023-03-011110.3389/fphy.2023.11295941129594Quantum annealing for the adjuster routing problemNaoya MoriSatoshi FurukawaIn the event of a disaster such as an earthquake, insurance companies basically conduct on-site witnessing. Depending on the scale of the disaster, hundreds of adjusters are dispatched from each office to the affected buildings per day. In such cases, which adjusters will witness which buildings and in what order must be determined, and the route must be optimized to conduct efficient witnessing. In this study, we define this witnessing route decision as an optimization problem and propose the adjuster routing problem (ARP). The ARP can be viewed as an extension of the vehicle routing problem (VRP). We introduce constraints not to be considered in the usual VRP, such as adjuster-building matching and satisfying the desired time. The VRP is an NP-hard optimization problem and is considered difficult to solve on a classical computer. Therefore, we formulated various constraints in QUBO so that quantum annealing can be applied to the ARP. In addition, we conducted numerical experiments with D-Wave. The ARP is a real problem, and our research provides a new example of applications of quantum annealing to real-world problems.https://www.frontiersin.org/articles/10.3389/fphy.2023.1129594/fullquantum annealingvehicle routing problemclusteringtraveling salesman probleminsurance companydisaster
spellingShingle Naoya Mori
Satoshi Furukawa
Quantum annealing for the adjuster routing problem
Frontiers in Physics
quantum annealing
vehicle routing problem
clustering
traveling salesman problem
insurance company
disaster
title Quantum annealing for the adjuster routing problem
title_full Quantum annealing for the adjuster routing problem
title_fullStr Quantum annealing for the adjuster routing problem
title_full_unstemmed Quantum annealing for the adjuster routing problem
title_short Quantum annealing for the adjuster routing problem
title_sort quantum annealing for the adjuster routing problem
topic quantum annealing
vehicle routing problem
clustering
traveling salesman problem
insurance company
disaster
url https://www.frontiersin.org/articles/10.3389/fphy.2023.1129594/full
work_keys_str_mv AT naoyamori quantumannealingfortheadjusterroutingproblem
AT satoshifurukawa quantumannealingfortheadjusterroutingproblem