• Title/Summary/Keyword: Brokerage Agent

Search Result 12, Processing Time 0.022 seconds

Optimal Brokerage Model using CSP Technique in Agent-Based Electronic Commerce (에이전트 기반 전자상거래에서 제약만족 기법을 이용한 최적의 중개 모델)

  • Jeong, Jong-Jin;Kim, Ji-Yeon;Jo, Geun-Sik
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5S
    • /
    • pp.1687-1695
    • /
    • 2000
  • Recently, many researchers have tried to establish EC framework EC framework for automated contract and brokerage using agent technologies in electronic commerce. Traditional researches, however, often enforced the user's participations during the automated brokerage process of agents an did not supported the procedures and methodologies for satisfying various user's requirements. In this paper, we propose a brokerge framework based on multi-agent to overcome the defects of the previous researches. For the optimal brokerage, the proposed framework is divided into tow layers, which are called competition layer and constraint satisfaction layer. The Agents process behaviors of brokerage through two layers accroding to th proposed message driven communication protocol. W also apply CSP (Constraint Satisfaction Problems) techniques to brokerage process to satisfy various preferential requirements from the user. That is, e model the relationship between buyer agents and seller agents using CSP and propose efficient CSP models for the optimal brokerage as the types of brokerage. Finally, e implemented prototype systems applying the proposed framework and showed the efficiency of he proposed framwork with the experimental results.

  • PDF

Multi-Criteria Decision Making Based Logistics Brokerage Agents (다기준 의사결정 기반의 물류중개 에이전트)

  • Jeong, Keun-Chae
    • IE interfaces
    • /
    • v.16 no.4
    • /
    • pp.473-484
    • /
    • 2003
  • In this paper we deal with the logistics brokerage process in which a logistics agent intermediates between vehicle owners and shippers for matching empty vehicles and freights. Based on the Multi-Criteria Decision Making (MCDM) methodology, the proposed agent system matches the most preferred empty vehicle to the shipper and the most preferred freight to the vehicle owner. In the proposed agent system, an MCDM based sensitivity analysis is also used for supporting decision makers under negotiations. Among various MCDM methodologies, Analytic Hierarchy Process (AHP) is utilized in this paper. Although AHP is one of the most popular MCDM methodologies, AHP needs a number of pair-wise comparisons for assessing alternatives and hence may give excessive decision making burden to the decision makers. In this paper, in order to reduce the decision making burden, a preference function based estimation method is proposed. We can expect that the MCDM based logistics brokerage agent can be used as an efficient and effective tool for e-logistics marketplaces on the internet.

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.

UMM-based Business Process Analysis for Constructing an Internet Logistics Brokerage Agent (인터넷 물류중개 에이전트 구축을 위한 UMM 기반의 비즈니스 프로세스 분석)

  • Jeong, Keun-Chae
    • IE interfaces
    • /
    • v.18 no.4
    • /
    • pp.390-401
    • /
    • 2005
  • In this paper, we propose an efficient internet-based logistics brokerage concept which can overcome the weakness of the traditional off-line method to intermediate between vehicle owners and shippers for matching empty vehicles and freights. For defining a business model based on the new concept and implementing an information system, it is necessary to analyze the business process for the internet-based logistics brokerage using a modeling methodology. In this paper, we analyze the logistics brokerage process using the UN/CEFACT Modeling Methodology (UMM) being utilized as a standard modeling methodology in the area of electronic commerce. After analyzing the business process, we can expect that the UMM can be used as a useful tool for modeling the business process of electronic commerce in which the description of the collaborative work is very important.

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.

A Negotiation Method Based on Opportunity Cost in the Trucking Cargo Transportation Market (육상화물운송시장에서 기회비용을 고려한 협상방법론 연구)

  • Kim, Hyun-Soo;Cho, Jae-Hyung
    • The Journal of Information Systems
    • /
    • v.21 no.3
    • /
    • pp.99-116
    • /
    • 2012
  • As a way to allocate lots of orders to many participants for vehicle allocation problem, this study has used an agent negotiation based reverse auction model. This agent negotiation provides coordination functions allowing all participants to make a profit, and accomplishing Pareto optimum solution from the viewpoint of a whole trucking cargo transportation network. In order to build a strategic cooperation relationship based on information sharing, this agent negotiation provides a coordination mechanism in which all the participants including consignors, brokerage firms, and car owners are able to attain their own profits, and also that ensure a competitive market. This study has tried to prove that the result of an agent-based negotiation is the Pareto optimal solution under the present market environment. We established a mathematical formulation for a comparison with the Integer Programming model, and analysing e-Marketplace, structure of shipping expenses and brokerage system in the trucking cargo transportation industry.

Hybrid Recommendation Based Brokerage Agent Service System under the Compound Logistics (공동물류 환경의 혼합추천시스템 기반 차주-화주 중개서비스 구현)

  • Jang, Sangyoung;Choi, Myoungjin;Yang, Jaekyung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.4
    • /
    • pp.60-66
    • /
    • 2016
  • Compound logistics is a service aimed to enhance logistics efficiency by supporting that shippers and consigners jointly use logistics facilities. Many of these services have taken place both domestically and internationally, but the joint logistics services for e-commerce have not been spread yet, since the number of the parcels that the consigners transact business is usually small. As one of meaningful ways to improve utilization of compound logistics, we propose a brokerage service for shipper and consigners based on the hybrid recommendation system using very well-known classification and clustering methods. The existing recommendation system has drawn a relatively low satisfaction as it brought about one-to-one matches between consignors and logistics vendors in that such matching constrains choice range of the users to one-to-one matching each other. However, the implemented hybrid recommendation system based brokerage agent service system can provide multiple choice options to mutual users with descending ranks, which is a result of the recommendation considering transaction preferences of the users. In addition, we applied feature selection methods in order to avoid inducing a meaningless large size recommendation model and reduce a simple model. Finally, we implemented the hybrid recommendation system based brokerage agent service system that shippers and consigners can join, which is the system having capability previously described functions such as feature selection and recommendation. As a result, it turns out that the proposed hybrid recommendation based brokerage service system showed the enhanced efficiency with respect to logistics management, compared to the existing one by reporting two round simulation results.

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.

Service Connectivity-Interworking by Signaling Brokerage Agent (신호 대행자 기능에 의한 서비스 연결성 연동)

  • 장종수
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • pp.207-210
    • /
    • 1998
  • Providing the connectivity interworking between the lightweight signaling function using in VOD set-top box and the broadband signaling function In the access node system, it can diminish the cost-burden of user about set-top box and we shall use efficiently the network resources. Therefore, In this paper, we shall design the signaling brokerage agent function for the connectivityinterworking in access node system and discuss the result applied its function to the real-time VOD service.

  • PDF

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