By Topic

A delivery scheduling system by the distributed cooperative multiple agents

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
$33 $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

4 Author(s)
H. Koizumi ; Mitsubishi Electr. Corp., Japan ; J. Sawamoto ; H. Tsuji ; K. Abe

In this paper, we propose a practical method for solving the delivery scheduling problem with multiple agents and discuss its implementation. The method is based on the distributed cooperative problem solving. In the delivery scheduling system, the covered region is partitioned into multiple subregions and each subregion is assigned a subproblem solving agent which solves the problem of scheduling of drivers and trucks in the subregion. Integrating those subproblem solving agents, an integration-and-evaluation agent solves the total problem. By employing the distributed cooperative problem solving framework for the delivery scheduling problem, we achieved an easy incorporation of various evaluation parameters in the process of scheduling, efficient use and management of scheduling knowledge of various levels, and reduction of computer processing by division of the problem into subproblems

Published in:

Parallel and Distributed Systems, 1997. Proceedings., 1997 International Conference on

Date of Conference:

10-13 Dec 1997