A decision-theoretic model for cooperative transportation scheduling

Fischer, Klaus; Müller, Jörg P.

doi:10.1007/bfb0031855

Cited by 38 publications

(45 citation statements)

References 2 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…One agent coordination paradigm that appears to be quite popular among the researchers in this area is that of artificial market systems. In the various market-based and auction approaches that appear in the literature, agents representing resources use bidding mechanisms of one sort or another to coordinate the assignment of required resources to tasks or jobs (e.g., [21,28,33,37,38,41,42,47,56,57]). There is evidence that market-based approaches can produce globally optimal or near-optimal solutions.…”

Section: Related Workmentioning

confidence: 99%

Wasp-like Agents for Distributed Factory Coordination

Cicirello

Smith

2004

Autonomous Agents and Multi-Agent Systems

115

View full text Add to dashboard Cite

Abstract. Agent-based approaches to manufacturing scheduling and control have gained increasing attention in recent years. Such approaches are attractive because they offer increased robustness against the unpredictability of factory operations. But the specification of local coordination policies that give rise to efficient global performance and effectively adapt to changing circumstances remains an interesting challenge. In this paper, we present a new approach to this coordination problem, drawing on various aspects of a computational model of how wasp colonies coordinate individual activities and allocate tasks to meet the collective needs of the nest.We focus specifically on the problem of configuring parallel multi-purpose machines in a factory to best satisfy product demands over time. Wasp-like computational agents that we call routing wasps act as overall machine proxies. These agents use a model of wasp task allocation behavior, coupled with a model of wasp dominance hierarchy formation, to determine which new jobs should be accepted into the machine's queue. If you view our system from a market-oriented perspective, the policies that the routing wasps independently adapt for their respective machines can be likened to policies for deciding when to bid and when not to bid for arriving jobs.We benchmark the performance of our system on the real-world problem of assigning trucks to paint booths in a simulated vehicle paintshop. The objective of this problem is to minimize the number of paint color changes accrued by the system, assuming no a priori knowledge of the color sequence or color distribution of trucks arriving in the system. We demonstrate that our system outperforms the bidding mechanism originally implemented for the problem as well as another related adaptive bidding mechanism.

show abstract

Section: Related Workmentioning

confidence: 99%

Wasp-like Agents for Distributed Factory Coordination

Cicirello

Smith

2004

Autonomous Agents and Multi-Agent Systems

115

View full text Add to dashboard Cite

show abstract

“…The algorithm we present can be compared to abundant previous works in the MAS logistics area [21]. Enhanced Contract-Net-Protocol as defined in [28] and further extended towards practical application by [55] achieves the same result using the negotiation between coalition leader and perspective members. When the perspective coalition leader wishes to solve the task, it asks other agents to cover the task completely or at least partially.…”

Section: Trust-based Planning For Adversarial Domainsmentioning

confidence: 95%

Advanced Agent Methods in Adversarial Environment

Pěchouček¹,

Řehák²,

Šišlák³

et al. 2005

View full text Add to dashboard Cite

Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comments regarding this burden estimate or any other aspect of this collection of information, including suggestions for reducing the burden, to Department of Defense, Washington Headquarters Services, Directorate for Information Operations and Reports (0704-0188), 1215 Jefferson Davis Highway, Suite 1204, Arlington, VA 22202-4302. Respondents should be aware that notwithstanding any other provision of law, no person shall be subject to any penalty for failing to comply with a collection of information if it does not display a currently valid OMB control number. PLEASE DO NOT RETURN YOUR FORM TO THE ABOVE ADDRESS.

show abstract

“…The MARS system (6) uses an auction mechanism of delivery orders among shipping companies and we assume that the MARS system has some difficulty due to computational time in case of increasing number of delivery orders. In our work, the method is based on the division of the delivery region into sub-regions to alleviate the same difficulty of computational time.…”

Section: Related Workmentioning

confidence: 99%

“…Algorithms for pickup and delivery problem with time windows (PDPTW) are studied as a generalization of vehicle routing problem (5) . The MARS system (6) models PDPTW within a society of shipping companies with multiple trucks as a cooperative multiagent system. However, several themes of research on delivery scheduling problems require further work, among them, (1) realization of adaptive systems conforming to actual problems and accommodation of multiple evaluation parameters, (2) creation of problem-solving models using knowledge of multiple levels, and (3) establishment of a method for deriving, within a practically useful length of time, approximate solutions within a permissible range which satisfy the imposed constraints.…”

Section: Introductionmentioning

confidence: 99%

Continuous Delivery Scheduling and Execution with Multiagents

Sawamoto

2004

IEEJ Trans.EIS

View full text Add to dashboard Cite

We propose a cooperative multiagent system for solving the delivery scheduling problem where the environment changes dynamically. In the truck delivery problem, the environmental conditions such as the traffic condition of roads changes and additional delivery orders arrive dynamically during the execution of the delivery, then the reactive and adaptive measures are required to cope with such situations. Multiple agents for the delivery center and delivery trucks cooperate to cope with the re-scheduling problem of additionally arriving orders after once the delivery has started according to the initial delivery plan. We show that the proposed method provides a flexible solution for the dynamic re-scheduling problem.

show abstract

A decision-theoretic model for cooperative transportation scheduling

Cited by 38 publications

References 2 publications

Wasp-like Agents for Distributed Factory Coordination

Wasp-like Agents for Distributed Factory Coordination

Advanced Agent Methods in Adversarial Environment

Continuous Delivery Scheduling and Execution with Multiagents

Contact Info

Product

Resources

About