Heuristics for a bidding problem
Computers and Operations Research
Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Expert Systems with Applications: An International Journal
A method of network simplification in a 4PL system
CSCWD'04 Proceedings of the 8th international conference on Computer Supported Cooperative Work in Design I
A lagrangian heuristic for winner determination problem in combinatorial auctions
AI'05 Proceedings of the 18th Australian Joint conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
An intelligent agent-based framework that supports fourth-party logistics (4PL) operations on the web is proposed in this paper. In our system, customers specify job requests over the web dynamically. An eMarket Place allows intelligent third-party logistics (3PL) agents to bid for customers' job requests. The intelligence lies on the e-Market Place to optimally decide whichagents' 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), which is 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.