By Topic

Combining Distributed Matchmaking and Clustering to Prune the Solution Space in Distributed Optimization Problems - Demonstrated in the RailCab System

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Durksen, D. ; Heinz Nixdorf Inst., Paderborn ; Klopper, B. ; Ruth, D. ; Thonemann, C.
more authors

The joined travelling of vehicles is an important instrument of cost reduction in the innovative RailCab concept. While the problem of joining groups of vehicles into convoys and determining convoy routes can be easily understood as optimization problem, the distributed nature and large number of vehicles and stops inhibits the direct application of operations research methods and problems. In this paper we introduce a combination of multiagent planning techniques like distributed matchmaking and filtering, data clustering from computational intelligence and heuristics from operations research to solve the complex task of convoy formation in the RailCab system. It is shown how the solution space of the optimization problem can be efficiently reduced during the matchmaking by applying filtering mechanisms and clustering to identify groups of agents with compatible optimization constraints.

Published in:

Hybrid Intelligent Systems, 2008. HIS '08. Eighth International Conference on

Date of Conference:

10-12 Sept. 2008