发明名称 TRANSPORTATION SERVICE RESERVATION METHOD, TRANSPORTATION SERVICE RESERVATION APPARATUS, AND COMPUTER-READABLE STORAGE MEDIUM
摘要 A transportation service reservation method executes, by a computer, a process including receiving a ride request specifying an origin and a destination, generating feasible products having service types, by referring to a storage unit that stores information indicating a schedule allocated to each vehicle and the service types of the schedule, for each vehicle capable of providing products having the service types, computing a choice probability of each product forming an assortment of the feasible products, for each of assortments satisfying a predetermined condition amongst the subsets of the feasible product set that are generated, computing an expected value of a number of future ride requests, and selecting an assortment to be presented with respect to the ride request, from the assortment satisfying the predetermined condition, based on the choice probability and the expected value.
申请公布号 US2016117610(A1) 申请公布日期 2016.04.28
申请号 US201514857233 申请日期 2015.09.17
申请人 FUJITSU LIMITED ;Massachusetts Institute of Technology 发明人 IKEDA Takuro;Ben-Akiva Moshe E.;Atasoy Bilge
分类号 G06Q10/02;G06Q50/32 主分类号 G06Q10/02
代理机构 代理人
主权项 1. A transportation service reservation method comprising: receiving, by a computer, a ride request specifying an origin and a destination; generating, by the computer, feasible products having a plurality of service types, by referring to a storage unit that stores information indicating a schedule allocated to each vehicle and the service types of the schedule, for each vehicle capable of providing products having the plurality of service types, wherein the products are defined as information indicating service contents of various transportation services that are provided; first computing, by the computer, a choice probability of each product forming an assortment of the feasible products, for each of assortments satisfying a predetermined condition amongst the subsets of the feasible product set that are generated; second computing, by the computer, an expected value of a number of ride requests which will be received in future; and selecting, by the computer, a assortment to be presented with respect to the ride request, from the assortments satisfying the predetermined condition, based on the choice probability and the expected value of the number of ride requests.
地址 Kawasaki-shi JP