thực hiện. Việc thực hiện dựa trên các gói Java IS sâu sắc LASSMachine, nào là một công cụ để lập trình đại lý. Một đại lý được lập trình sử dụng gói LASSMachine sở hữu CNTT-TT Niềm tin, ý định, dịch vụ, kế hoạch cho dịch vụ hành quyết, hành vi, và meta-khả năng. | A. Takaci and M. Ivanovic Sub-optimal Journey Supported by Agents 23 implemented. The implementation is deeply based on the Java package LASSMachine which is a tool for agent programming. An agent programmed using the package LASSMachine possesses its beliefs intentions services plans for service executions behaviors and meta-capabilities. It is aware of time and it can be accessed via WWW. More detailed description of LASSMachine is given in 1 2 3 Travel Agent Travel agents communicate with users and they have the main role in the parallel search for the sub-optimal journey and in the tickets reservation process. Some of the travel agent services are 1. webService - enables users to access a travel-agent through the WWW. A webSerVICE asks user to select the destination of their journey to enter the constrains and to select the criterion for the optimum value. There are three types of constrains a. avoidance of particular means of transportation . airplane b. avoidance of particular towns c. avoidance of particular areas . due to visa problems . The criterion for journey optimum value can be d. minimal expenses e. minimal traveling time f. cost lower or around the given sum g. less or approximately time than given. After obtaining user specification a webService initiates the search. The search result will be presented to user which can then ask the agent for travel tickets reservation. The ticket reservation may not succeed because in the meantime someone else can reserve the ticket that the user wants to reserve and there are no more tickets available. Then the second best solution is offered to the user repeating the process. 2. getJourney - searches for the sub-optimal journey from the town where the agent is located to the given town. The service has the following input parameters a. dest - the destination town of the journey b. constrain type - parameter that specifies the type of the constrain c. constraint parameters - value of parameters .
