• Title/Summary/Keyword: Matching Agent

Search Result 69, Processing Time 0.031 seconds

Dynamic Matching Algorithms for Internet-based Logistics Brokerage Agents

  • Jeong, Keun-Chae
    • Management Science and Financial Engineering
    • /
    • v.10 no.1
    • /
    • pp.77-96
    • /
    • 2004
  • In this paper, we present a dynamic matching methodology for the logistics brokerage agent that intermediates empty vehicles and freights registered to the logistics e-marketplace by car owners and shippers. In this matching methodology, two types of decisions should be made: one is when to match freights and vehicles and the other is how to match freights and vehicles at that time. We propose three strategies for deciding when to match, ie. real time matching (RTM) , periodic matching (PM), and fixed matching (FM) and use Hungarian method for solving the how-to-match problem. In order to compare the performance of the when-to-match strategies, computational experiments are done and the results show that the waiting-and-matching strategies, PM and FM, give better performance than real time matching strategy, RTM. We can expect that the suggested matching methodology may be used as an efficient and effective tool for the brokerage agent in the logistics e-marketplaces.

A Negotiation Framework for the Cloud Management System using Similarity and Gale Shapely Stable Matching approach

  • Rajavel, Rajkumar;Thangarathinam, Mala
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.6
    • /
    • pp.2050-2077
    • /
    • 2015
  • One of the major issues in emerging cloud management system needs the efficient service level agreement negotiation framework, with an optimal negotiation strategy. Most researchers focus mainly on the atomic service negotiation model, with the assistance of the Agent Controller in the broker part to reduce the total negotiation time, and communication overhead to some extent. This research focuses mainly on composite service negotiation, to further minimize both the total negotiation time and communication overhead through the pre-request optimization of broker strategy. The main objective of this research work is to introduce an Automated Dynamic Service Level Agreement Negotiation Framework (ADSLANF), which consists of an Intelligent Third-party Broker for composite service negotiation between the consumer and the service provider. A broker consists of an Intelligent Third-party Broker Agent, Agent Controller and Additional Agent Controller for managing and controlling its negotiation strategy. The Intelligent third-party broker agent manages the composite service by assigning its atomic services to multiple Agent Controllers. Using the Additional Agent Controllers, the Agent Controllers manage the concurrent negotiation with multiple service providers. In this process, the total negotiation time value is reduced partially. Further, the negotiation strategy is optimized in two stages, viz., Classified Similarity Matching (CSM) approach, and the Truncated Negotiation Group Gale Shapely Stable Matching (TNGGSSM) approach, to minimize the communication overhead.

A Multi-Agent Improved Semantic Similarity Matching Algorithm Based on Ontology Tree (온톨로지 트리기반 멀티에이전트 세만틱 유사도매칭 알고리즘)

  • Gao, Qian;Cho, Young-Im
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.11
    • /
    • pp.1027-1033
    • /
    • 2012
  • Semantic-based information retrieval techniques understand the meanings of the concepts that users specify in their queries, but the traditional semantic matching methods based on the ontology tree have three weaknesses which may lead to many false matches, causing the falling precision. In order to improve the matching precision and the recall of the information retrieval, this paper proposes a multi-agent improved semantic similarity matching algorithm based on the ontology tree, which can avoid the considerable computation redundancies and mismatching during the entire matching process. The results of the experiments performed on our algorithm show improvements in precision and recall compared with the information retrieval techniques based on the traditional semantic similarity matching methods.

Dynamic Matching Algorithms for Internet-based Logistics Brokerage Agents

  • Jeong, Geun-Chae
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2004.05a
    • /
    • pp.139-142
    • /
    • 2004
  • In this paper, we present a dynamic matching methodology for the logistics brokerage agent that intermediates empty vehicles and freights registered to the logistics e-marketplace by car owners and shippers. In this matching methodology, two types of decisions should be made: one is when to match freights and vehicles and the other is how to match freights and vehicles at that time. We propose three strategies for deciding when to match, i.e. real time matching (RTM), periodic matching (PM), and fixed matching (FM) and use Hungarian method for solving tho how-to-match problem. In order to compare the performance of the when-to-match strategies, computational experiments are done and the results show that the waiting-and matching strategies, PM and FM, give better performance than real time matching strategy, RTM. We can expect that the suggested matching methodology may be used as an efficient and affective tool for the brokerage agent in the logistics e-marketplaces

  • PDF

Dynamic Matching Algorithms for On-Time Delivery in e-Logistics Brokerage Marketplaces

  • Jeong, Keun-Chae
    • Management Science and Financial Engineering
    • /
    • v.13 no.1
    • /
    • pp.93-113
    • /
    • 2007
  • In the previous research, we considered a logistics brokerage problem with the objective of minimizing total transportation lead time of freights in a logistics e-marketplace, in which a logistics brokerage agent intermediates empty vehicles and freights registered by car owners and shippers [7]. However, in the logistics e-marketplace, transportation due date tardiness is more important than the transportation lead time, since transportation service level is critically determined by whether the due date is met or not. Therefore, in this paper, we deal with the logistics brokerage problem with the objective of minimizing total tardiness of freights. Hungarian method based matching algorithms, real time matching(RTM), periodic matching(PM), and fixed matching(FM), are used for solving the problem considered in this paper. In order to test performance of the proposed algorithms, we perform computational experiments on a various problem instances. The results show that the waiting-and-matching algorithms, PM and FM, also give better performance than real time matching strategy, RTM, for the total tardiness minimization problem as the algorithms did for the total lead time minimization problem.

Modeling of Bank Asset Management System based on Intelligent Agent

  • Kim, Dae-Su;Kim, Chang-Suk
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.1 no.1
    • /
    • pp.81-86
    • /
    • 2001
  • In this paper, we investigated the modeling of Bank Asset Management System(BAME) based on intelligent agent. To achieve this goal, we introduced several kinds of agents that show intelligent features. BAMS is a user friendly system and adopts fuzzy converting system and fuzzy matching system that returns reasonable similarity matching results. Generation function of the proximity degree is suggested. Fuzzification of investment type categories and feature values are defined, and generation of proximity degree is also derived. An example of bank asset management system is introduced and simulated. Investment type matching utilizing fuzzy measure is tested and it showed quite reasonable similarity matching results.

  • PDF

Design and Implementation of Policy-oriented Matching Agent System for Electronic Commerce (전자상거래를 위한 정책지향 매칭 에이전트 시스템의 설계 및 구현)

  • Hwang, Byeong-Yeon;Park, Seong-Cheol
    • The KIPS Transactions:PartD
    • /
    • v.8D no.5
    • /
    • pp.623-630
    • /
    • 2001
  • Recently, Internet solution market is focused on competition in Electronic Commerce (EC) rather than necessity and effectiveness of EC. In this paper, we propose a policy-oriented matching agent system that makes EC market active. We can pursue diverse promotion since policies are objects, and we can formulate, carry out, pursue, and evaluated a policy consistently on the proposed solution since our solution is integrated into merits of rule-based system and operation space (release post). There are three important points of the implementation. It is component-based structure that fits to be a basic platform for EC. It is connected with other system easily, so it can help marketing. Marketing.

  • PDF

Variable Periodic/Fixed Matching Algorithms for Internet-Based Logistics Brokerage Agents (인터넷 기반의 물류중개 에이전트를 위한 가변형 정기/정량 매칭 알고리즘)

  • Jeong, Keun-Chae
    • IE interfaces
    • /
    • v.23 no.2
    • /
    • pp.164-175
    • /
    • 2010
  • In logistics e-marketplaces, brokerage agents intermediate empty vehicles and freights registered by car owners and shippers. In the previous research, we proposed constant periodic/fixed matching algorithms for the logistics brokerage agents with the objective of minimizing the total transportation lead time and the transportation due date tardiness of freights(Jeong, 2004; Jeong, 2007). However, the constant type algorithms cannot consider changes in the balance status of an e-marketplace, i.e. the difference between the numbers of freights and vehicles to wait for matching, because they use non-changing matching periods and amounts. In this paper, we propose variable type algorithms for the logistics brokerage agent, in which the matching periods and amounts are changed continuously by considering the balance status between the freights and vehicles. In order to compare performance of the variable type algorithms to the previous constant type algorithms, we carried out computational experiments on various problem instances. The results show that the variable type algorithms give better performance than the constant type algorithms. We can expect that the logistics brokerage agents can improve their performance by using the proposed variable periodic/fixed matching algorithms.

Development of a Conversational Help Agent Using Approximate Pattern Matching (근사 패턴매칭을 이용한 대화형 도우미 에이전트의 개발)

  • 김수영;조성배
    • Korean Journal of Cognitive Science
    • /
    • v.13 no.4
    • /
    • pp.1-8
    • /
    • 2002
  • As Internet grows, many web sites have been built, therefore much information has been registered. Because the web sites have more information, it is more difficult that the user can find the information wanted. Therefore, to get information that user wants easily, the full-text engine may be embedded to the web site. This paper is about developing the help conversational agent for a user to find the information that he wants through conversation with agent. The proposed method is based on the pattern matching of artificial intelligence, not natural language processing. If a user inputs any sentence, the help conversational agent responds to the sentence through preprocessing and pattern matching with knowledge. The knowledge is built with the XML format. With the approximate pattern matching, the agent picks up the appropriate response with some degree of similarities. At the experiment, some different sentences with the same meaning have been entered, then the agent recognized them as the same pattern, and it made a correct answer.

  • PDF

A Study on Electrical Properties and Structure Analysis of Epoxy-Ceramic Composite Materials (에폭시-세라믹 복합재료의 전기적 특성 및 구조분석)

  • 정지원;홍경진;김태성
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 1994.05a
    • /
    • pp.9-12
    • /
    • 1994
  • Epoxy-Ceramic Composite have good insulating, therma1 and mechanical properties, so it is studied actively on this material. In this thesis, we made a composite material b)\ulcorner filling Epoxy Resin with ceramics treated with Sillane Coupling Agent and studied dielectric and insulating characteristics according to treatment density of Sillane Coupling Agent and weight percent of filler. As a result, loss tangent increase and electrical breakdown voltage decrease according to increasing treatment density of sillane coupling agent because Interface matching between matrix and filler is not good. The best treatment density of sillane coupling agent is 0.5% water solution, in this density the best interface matching is achieved so good dielectric and insulation characteristics are shown. Dielectric and insulation characteristics according to weight percent of filler are best at 25wt.

  • PDF