Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems

Research output: Contribution to journalArticleAcademicpeer-review

88 Citations (Scopus)
1 Downloads (Pure)

Abstract

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.
Original languageEnglish
Pages (from-to)59-75
Number of pages17
JournalEuropean journal of operational research
Volume181
Issue number1
DOIs
Publication statusPublished - 2007

Keywords

  • Auctions/bidding
  • Multi-Agent Systems
  • Transportation
  • METIS-243140
  • IR-58598

Fingerprint Dive into the research topics of 'Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems'. Together they form a unique fingerprint.

  • Cite this