| 摘要 |
<p><P>PROBLEM TO BE SOLVED: To provide a method for automatically creating an optimized or approximately optimized travel plan which satisfies demands of a traveler among many travel plans. <P>SOLUTION: In a method for creating the travel plan by using a mixed integer programming problem, each day of a travel period input by the traveler is divided into a plurality of slots, a list of service which includes a plurality of activities in which association is defined so as to match to characteristics given to each of the slots, and is available in the travel period is created, a restriction condition regarding priority using a decision variable for defining whether or not each of the service is assigned to each of the plurality of slots and a second restriction condition regarding relation with length of time width required for service execution, are constituted, a performance index expressing evaluation characteristics of the travel plan is constituted, and combination of decision variables for optimizing the performance index is obtained under the first and second restriction conditions, and each of the service in the list is assigned to each of the plurality of slots to create the travel plan. <P>COPYRIGHT: (C)2008,JPO&INPIT</p> |
