{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T15:45:25Z","timestamp":1753890325623,"version":"3.41.2"},"reference-count":28,"publisher":"Frontiers Media SA","license":[{"start":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T00:00:00Z","timestamp":1680048000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["frontiersin.org"],"crossmark-restriction":true},"short-container-title":["Front. Appl. Math. Stat."],"abstract":"<jats:p>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.<\/jats:p>","DOI":"10.3389\/fams.2023.1150921","type":"journal-article","created":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T05:21:18Z","timestamp":1680067278000},"update-policy":"https:\/\/doi.org\/10.3389\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Experimental study on the information disclosure problem: Branch-and-bound and QUBO solver"],"prefix":"10.3389","volume":"9","author":[{"given":"Keisuke","family":"Otaki","sequence":"first","affiliation":[]},{"given":"Akihisa","family":"Okada","sequence":"additional","affiliation":[]},{"given":"Hiroaki","family":"Yoshida","sequence":"additional","affiliation":[]}],"member":"1965","published-online":{"date-parts":[[2023,3,29]]},"reference":[{"key":"B1","unstructured":"Combinatorial Optimization: Theory Algorithms\n            KorteB\n            VygenJ\n          Springer2018"},{"key":"B2","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1257\/aer.20101552","article-title":"Efficient matching under distributional constraints: theory and applications","volume":"105","author":"Kamada","year":"2015","journal-title":"Am Econ Rev"},{"key":"B3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1613\/jair.5297","article-title":"Controlled school choice with soft bounds and overlapping types","volume":"58","author":"Kurata","year":"2017","journal-title":"J Artif Intell Res"},{"key":"B4","doi-asserted-by":"publisher","first-page":"460","DOI":"10.14778\/1988776.1988782","article-title":"Social content matching in MapReduce","volume":"4","author":"De Francisci Morales","year":"2011","journal-title":"Proc VLDB2011"},{"key":"B5","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1561\/0400000057","article-title":"Online matching and ad allocation","volume":"8","author":"Mehta","year":"2013","journal-title":"Foundat Trends"},{"key":"B6","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1073\/pnas.1611675114","article-title":"On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment","volume":"114","author":"Alonso-Mora","year":"2017","journal-title":"Proc Natl Acad Sci USA"},{"key":"B7","doi-asserted-by":"publisher","first-page":"2584","DOI":"10.1109\/TITS.2018.2868366","article-title":"Mobility sharing as a preference matching problem","volume":"20","author":"Zhang","year":"2018","journal-title":"IEEE Trans Intell Transport Syst"},{"key":"B8","unstructured":"Algorithmic approach for solving intuitionistic fuzzy transportation problem39819\n            HussainRJ\n            KumarPS\n          31969081Appl Math Sci62012"},{"key":"B9","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s13198-019-00794-w","article-title":"Intuitionistic fuzzy solid assignment problems: a software-based approach","volume":"10","author":"Kumar","year":"2019","journal-title":"Int J Syst Assurance Eng Manag"},{"key":"B10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s13198-019-00941-3","article-title":"Algorithms for solving the optimization problems using fuzzy and intuitionistic fuzzy set","volume":"11","author":"Kumar","year":"2020","journal-title":"Int J Syst Assurance Eng Manag"},{"key":"B11","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1080\/00029890.1962.11989827","article-title":"College admissions and the stability of marriage","volume":"69","author":"Gale","year":"1962","journal-title":"Am Math Monthly"},{"key":"B12","doi-asserted-by":"publisher","first-page":"1037","DOI":"10.1016\/j.artint.2011.03.004","article-title":"Preferences in AI: an overview","volume":"175","author":"Domshlak","year":"2011","journal-title":"Artif Intell"},{"key":"B13","first-page":"159","article-title":"Representation of a preference ordering by a numerical function","volume":"3","author":"Debreu","year":"1954","journal-title":"Decis Proc"},{"key":"B14","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1257\/aer.91.3.351","article-title":"Economic choices","volume":"91","author":"McFadden","year":"2001","journal-title":"Am Econ Rev"},{"key":"B15","first-page":"3854","article-title":"Improving the information disclosure in mobility-on-demand systems","author":"Yang","year":"2021","journal-title":"In: Proceedings of the KDD2021"},{"key":"B16","article-title":"Data driven VRP: a neural network model to learn hidden preferences for VRP","author":"Mandi","year":"2021","journal-title":"Proceedings of the CP2021"},{"key":"B17","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.2101.03936","article-title":"Learn-n-Route: learning implicit preferences for vehicle routing","author":"Canoy","year":"2021","journal-title":"arXiv:210103936"},{"key":"B18","first-page":"370","article-title":"Price and time optimization for utility-aware taxi dispatching","author":"Hikima","year":"2021","journal-title":"Proceedings of the PRICAI2021"},{"volume-title":"Discrete Choice Methods With Simulation","year":"2009","author":"Train","key":"B19"},{"key":"B20","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s00180-010-0217-1","article-title":"maxLik: a package for maximum likelihood estimation in R","volume":"26","author":"Henningsen","year":"2011","journal-title":"Comput Stat"},{"key":"B21","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1287\/opre.14.4.699","article-title":"Branch-and-bound methods: a survey","volume":"14","author":"Lawler","year":"1966","journal-title":"Operat Res"},{"key":"B22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3389\/fphy.2014.00005","article-title":"Ising formulations of many NP problems","volume":"2","author":"Lucas","year":"2014","journal-title":"Front Phys"},{"key":"B23","doi-asserted-by":"publisher","DOI":"10.1088\/1361-6633\/ac8c54","article-title":"Quantum annealing for industry applications: introduction and review","author":"Yarkoni","year":"2021","journal-title":"arXiv:211207491"},{"key":"B24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s42979-021-00483-1","article-title":"Benchmarking quantum annealing against \u201chard\u201d instances of the bipartite matching problem","volume":"2","author":"Vert","year":"2021","journal-title":"SN Comput Sci"},{"key":"B25","doi-asserted-by":"publisher","first-page":"106630","DOI":"10.1016\/j.compchemeng.2019.106630","article-title":"Quantum computing based hybrid solution strategies for large-scale discrete-continuous optimization problems","volume":"132","author":"Ajagekar","year":"2020","journal-title":"Comput Chem Eng"},{"key":"B26","unstructured":"Quantum computing for structural optimization\n            WilsK\n          2020"},{"key":"B27","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2021.3063618","article-title":"PyQUBO: Python library for mapping combinatorial optimization problems to QUBO form","author":"Zaman","year":"2021","journal-title":"arXiv preprint"},{"volume-title":"Artificial Intelligence a Modern Approach","year":"2010","author":"Russell","key":"B28"}],"container-title":["Frontiers in Applied Mathematics and Statistics"],"original-title":[],"link":[{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fams.2023.1150921\/full","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T05:21:27Z","timestamp":1680067287000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.frontiersin.org\/articles\/10.3389\/fams.2023.1150921\/full"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,29]]},"references-count":28,"alternative-id":["10.3389\/fams.2023.1150921"],"URL":"https:\/\/doi.org\/10.3389\/fams.2023.1150921","relation":{},"ISSN":["2297-4687"],"issn-type":[{"type":"electronic","value":"2297-4687"}],"subject":[],"published":{"date-parts":[[2023,3,29]]},"article-number":"1150921"}}