Solving Distributed Delivery Problems with Agent-Based Technologies and Constraint Satisfaction Techniques
نویسندگان
چکیده
A considerable amount of research has been concerned with the domain of automatic planning and scheduling, but many real world scheduling problems such as The Pick up and Delivery Problem With Time Windows (PDPTW) are still not easily tackled. The PDPTW problem demands solving the schedule for each vehicle of a transportation fleet where pick up and delivery of customer orders are distributed among various locations, while satisfying the constraints on the time windows when serving at client pickup and delivery locations. In this paper, we are stating that an agentbased system designed to solve the PDPTW problem using constraint satisfaction techniques is appropriate for practical applications.
منابع مشابه
Strategies for Distributed Constraint Satisfaction Problems
Constraint satisfaction problems are important in AI. Various distributed and parallel computing strategies have been proposed to solve these problems. In this paper, these strategies are classified as distributed-agent-based, parallel-agent-based, and function-agent-based distributed problem-solving strategies. These different strategies are presented and discussed. Parallel-agentbased strateg...
متن کاملAgent Cooperation Can Compensate For Agent Ignorance in Constraint Satisfaction
A team of constraint agents with diverse viewpoints can find a solution to a constraint satisfaction problem (CSP) when the individual agents have an incomplete view of the problem. In this paper we present a method of solving constraint satisfaction problems (CSPs) using cooperating constraint agents where each agent has a different representation of a particular CSP. Agents assist one another...
متن کامل12th IEEE International Conference on Distributed Computing Systems '92, pp.614{621 Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving
Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. In this paper, we describe this formalism and compare algorithms for solving distributed constraint satisfaction problems (DCSPs). In particular, we present our newly developed technique called asynchronous backtracking that allows agents ...
متن کاملDistributed University Timetabling with Multiply Sectioned Constraint Networks
Although timetabling has long been studied through constraint satisfaction based techniques, along with many alternatives, only recently work has been reported where distributed timetabling problems (DisTTPs) was studied as distributed constraint satisfaction problems (DisCSPs). We present an alternative method for solving DisTTPs based on multiply sectioned constraint networks (MSCNs). The pro...
متن کاملPrivacy for DisCSP-based Modeling in Multi-Agent Planning
Constraint Satisfaction and SAT can model planning problems (Kautz & Selman 1996) and this approach is quite successful. There is an increasing interest in distributed and asynchronous search algorithms for solving distributed constraint satisfaction problems (DisCSP). An important motivation for distributed problem solving is the agents’ ability to keep their constraints private. Cryptographic...
متن کامل