• Title/Summary/Keyword: Brokerage Agent Service

Search Result 3, Processing Time 0.021 seconds

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.

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 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.