Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver
The aim of this study was to explore the information disclosure (ID) problem, which involves selecting pairs of two sides before matching toward user-oriented optimization. This problem is known to be useful for mobility-on-demand (MoD) platforms because drivers' choice behaviors are appropriat...
| Published in: | Frontiers in Applied Mathematics and Statistics |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
Frontiers Media S.A.
2023-03-01
|
| Subjects: | |
| Online Access: | https://www.frontiersin.org/articles/10.3389/fams.2023.1150921/full |
| _version_ | 1850134481235607552 |
|---|---|
| author | Keisuke Otaki Akihisa Okada Hiroaki Yoshida |
| author_facet | Keisuke Otaki Akihisa Okada Hiroaki Yoshida |
| author_sort | Keisuke Otaki |
| collection | DOAJ |
| container_title | Frontiers in Applied Mathematics and Statistics |
| description | The aim of this study was to explore the information disclosure (ID) problem, which involves selecting pairs of two sides before matching toward user-oriented optimization. This problem is known to be useful for mobility-on-demand (MoD) platforms because drivers' choice behaviors are appropriately modeled, but solving the problem is still under development, although heuristic solvers have been proposed. We develop new branch-and-bound-based (BnB) solvers and a new heuristic solver based on a quadratic unconstrained binary optimization (QUBO) formulation. Our numerical experiments show that the QUBO-based solver indeed works within the limit of available bits, and the BnB solver performs slightly better than existing heuristic ones. |
| format | Article |
| id | doaj-art-e44bf9e2b1934b80aac4142a5397bb7d |
| institution | Directory of Open Access Journals |
| issn | 2297-4687 |
| language | English |
| publishDate | 2023-03-01 |
| publisher | Frontiers Media S.A. |
| record_format | Article |
| spelling | doaj-art-e44bf9e2b1934b80aac4142a5397bb7d2025-08-19T23:51:37ZengFrontiers Media S.A.Frontiers in Applied Mathematics and Statistics2297-46872023-03-01910.3389/fams.2023.11509211150921Experimental study on the information disclosure problem: Branch-and-bound and QUBO solverKeisuke OtakiAkihisa OkadaHiroaki YoshidaThe aim of this study was to explore the information disclosure (ID) problem, which involves selecting pairs of two sides before matching toward user-oriented optimization. This problem is known to be useful for mobility-on-demand (MoD) platforms because drivers' choice behaviors are appropriately modeled, but solving the problem is still under development, although heuristic solvers have been proposed. We develop new branch-and-bound-based (BnB) solvers and a new heuristic solver based on a quadratic unconstrained binary optimization (QUBO) formulation. Our numerical experiments show that the QUBO-based solver indeed works within the limit of available bits, and the BnB solver performs slightly better than existing heuristic ones.https://www.frontiersin.org/articles/10.3389/fams.2023.1150921/fullinformation disclosureheuristicsbranch-and-boundquantum annealingquadratic unconstrained binary optimization |
| spellingShingle | Keisuke Otaki Akihisa Okada Hiroaki Yoshida Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver information disclosure heuristics branch-and-bound quantum annealing quadratic unconstrained binary optimization |
| title | Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver |
| title_full | Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver |
| title_fullStr | Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver |
| title_full_unstemmed | Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver |
| title_short | Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver |
| title_sort | experimental study on the information disclosure problem branch and bound and qubo solver |
| topic | information disclosure heuristics branch-and-bound quantum annealing quadratic unconstrained binary optimization |
| url | https://www.frontiersin.org/articles/10.3389/fams.2023.1150921/full |
| work_keys_str_mv | AT keisukeotaki experimentalstudyontheinformationdisclosureproblembranchandboundandqubosolver AT akihisaokada experimentalstudyontheinformationdisclosureproblembranchandboundandqubosolver AT hiroakiyoshida experimentalstudyontheinformationdisclosureproblembranchandboundandqubosolver |