一个智能代理系统,支持基于web的多方代理物流

H. Lau, Yam Guan Goh
{"title":"一个智能代理系统,支持基于web的多方代理物流","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":"{\"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}","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

摘要

提出了一种基于智能代理的支持Web上第四方物流(4PL)操作的框架。在我们的系统中,客户通过Web动态地指定作业请求。电子市场允许智能第三方物流(3PL)代理竞标客户的工作请求。智能在于电子市场根据一组预先确定的因素(价格、偏好和公平性)最优地决定哪些代理的出价应该得到满足。我们将潜在的代理问题建模为一个集包装问题(SPP),一个NP-hard优化问题。提出了一种迭代贪心逼近算法求解SPP,实验结果表明,该算法与Chvatal(1979)提出的经典贪心方法相比是有效的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An intelligent brokering system to support multi-agent Web-based 4/sup th/-party logistics
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).
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信