کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
483015 | 1446194 | 2007 | 17 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems](/preview/png/483015.png)
We consider the real-time scheduling of full truckload transportation orders with time windows that arrive during schedule execution. Because a fast scheduling method is required, look-ahead heuristics are traditionally used to solve these kinds of problems. As an alternative, we introduce an agent-based approach where intelligent vehicle agents schedule their own routes. They interact with job agents, who strive for minimum transportation costs, using a Vickrey auction for each incoming order. This approach offers several advantages: it is fast, requires relatively little information and facilitates easy schedule adjustments in reaction to information updates. We compare the agent-based approach to more traditional hierarchical heuristics in an extensive simulation experiment. We find that a properly designed multi-agent approach performs as good as or even better than traditional methods. Particularly, the multi-agent approach yields less empty miles and a more stable service level.
Journal: European Journal of Operational Research - Volume 181, Issue 1, 16 August 2007, Pages 59–75