{"title":"An intelligent brokering system to support multi-agent Web-based 4/sup th/-party logistics","authors":"H. Lau, Yam Guan Goh","doi":"10.1109/TAI.2002.1180800","DOIUrl":null,"url":null,"abstract":"An intelligent agent-based framework that supports fourth-party logistics (4PL) operations on the Web is proposed. In our system, customers specify job requests over the Web dynamically. An e-marketplace allows intelligent third-party logistics (3PL) agents to bid for customers' job requests. The intelligence lies in the e-marketplace optimally deciding which agents' bids should be satisfied based on a set of predetermined factors (pricing, preferences and fairness). We model the underlying brokering problem as a set packing problem (SPP), an NP-hard optimization problem. An iterative greedy approximation algorithm is proposed to solve the SPP, and experimental results show its effectiveness against the classical greedy method proposed by Chvatal (1979).","PeriodicalId":197064,"journal":{"name":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2002-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"60","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.2002.1180800","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 60
Abstract
An intelligent agent-based framework that supports fourth-party logistics (4PL) operations on the Web is proposed. In our system, customers specify job requests over the Web dynamically. An e-marketplace allows intelligent third-party logistics (3PL) agents to bid for customers' job requests. The intelligence lies in the e-marketplace optimally deciding which agents' bids should be satisfied based on a set of predetermined factors (pricing, preferences and fairness). We model the underlying brokering problem as a set packing problem (SPP), an NP-hard optimization problem. An iterative greedy approximation algorithm is proposed to solve the SPP, and experimental results show its effectiveness against the classical greedy method proposed by Chvatal (1979).