Feasible distributed CSP models for scheduling problems

A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple automated agents. Many researchers have developed techniques for solving DisCSPs. They assume for simplicity that each agent has exactly one variable. For real planning and scheduling problems, these techniques require a large number of messages passing among agents, so these problems are very difficult to solve. In this paper, we present a general distributed model for solving real-life scheduling problems. This distributed model is based on the idea of holonic systems. Furthermore, we propose some guidelines for distributing large-scale problems. Finally, we present two case studies in which two scheduling problems are distributed by using our model.

[1]  Cameron G. Walker,et al.  Simultaneous disruption recovery of a train timetable and crew roster in real time , 2005, Comput. Oper. Res..

[2]  Makoto Yokoo,et al.  Distributed constraint satisfaction algorithm for complex local problems , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

[3]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[4]  T. Shallice.  What ghost in the machine? , 1992, Nature.

[5]  Miguel A. Salido,et al.  Domain-dependent distributed models for railway scheduling , 2007, Knowl. Based Syst..

[6]  Miguel A. Salido,et al.  DFS-Tree Based Heuristic Search , 2007, SARA.

[7]  Peter van Beek,et al.  On the conversion between non-binary constraint satisfaction problems , 1998, AAAI 1998.

[8]  Alan K. Mackworth.  Constraint Satisfaction , 1985 .

[9]  Vicent J. Botti,et al.  Towards an abstract recursive agent , 2004, Integr. Comput. Aided Eng..

[10]  C. Bessiere,et al.  DisChoco : A platform for distributed constraint programming , 2006 .

[11]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[12]  Walter Ukovich,et al.  A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..

[13]  A D R I A N A G I R E T,et al.  Holons and Agents , 2022 .

[14]  Peter van Beek,et al.  On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems , 1998, AAAI/IAAI.

[15]  Makoto Yokoo,et al.  Introduction: Special Issue on Distributed Constraint Satisfaction , 2005, Artif. Intell..

[16]  Miguel A. Salido,et al.  Distributed CSPs by graph partitioning , 2006, Appl. Math. Comput..

[17]  Boi Faltings,et al.  Asynchronous aggregation and consistency in distributed constraint satisfaction , 2005, Artif. Intell..

[18]  Miguel A. Salido,et al.  Distributed CSPs: Why It Is Assumed a Variable per Agent? , 2007, SARA.

[19]  Adriana Giret,et al.  Distributing Constraints by Sampling in Non-Binary CSPs , 2003 .

[20]  Makoto Yokoo,et al.  Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[21]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.

[22]  Elias Silva Oliveira.  Solving Single-Track Railway Scheduling Problem Using Constraint Programming , 2001 .

[23]  Miguel A. Salido,et al.  An Assessment of Railway Capacity , 2008 .