Conference Paper

Making AC-3 an Optimal Algorithm.

Conference: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI 2001, Seattle, Washington, USA, August 4-10, 2001
Source: DBLP

ABSTRACT The AC-3 algorithm is a basic and widely used arc consistency enforcing algorithm in Constraint Sat- isfaction Problems (CSP). Its strength lies in that it is simple, empirically efficient and extensible. However its worst case time complexity was not considered optimal since the first complexity result for AC-3 (Mackworth and Freuder, 1985) with the bound (ed3), where e is the number of constraints and d the size of the largest domain. In this paper, we show suprisingly that AC-3 achieves the opti- mal worst case time complexity with (ed2). The result is applied to obtain a path consistency algo- rithm which has the same time and space complex- ity as the best known theoretical results. Our exper- imental results show that the new approach to AC-3 is comparable to the traditional AC-3 implementa- tion for simpler problems where AC-3 is more effi- cient than other algorithms and significantly faster on hard instances. simplicity of arc revision in AC-3 makes it convenient for implementation and amenable to various extensions for many constraint systems. Thus while AC-3 is considered as being sub-optimal, it often is the algorithm of choice and can out- perform other theoretically optimal algorithms. In this paper, we show that AC-3 achieves worst case op- timal time complexity of (ed2). This result is surprising since AC-3 being a coarse grained "arc revision" algorithm (Mackworth, 1977), is considered to be non-optimal. The known results for optimal algorithms are all on fine grained "value revision" algorithms. Preliminary experiments show that the new AC-3 is comparable to the traditional implemen- tations on easy CSP instances where AC-3 is known to be substantially better than the optimal fine grained algorithms. In the hard problem instances such as those from the phase transition, the new AC-3 is significantly better and is compa- rable to the best known algorithms such as AC-6. We also show that the results for AC-3 can be applied immediately to obtain a path consistency algorithm which has the same time and space complexity as the best known theoretical results. 1

0 Bookmarks
 · 
87 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: For the enterprises organised in several distributed production sites, usually, production scheduling models presume either an instantaneous delivery of products or an unlimited number of available vehicles for transporting products. However, the transportation of the intermediate products to the sites is an important activity within the whole process of manufacturing, and the efficient coordination of production and transportation becomes a challenging problem in the actual higher collaborative and competitive environments. This work focuses on the integrated production and transportation scheduling properly managing the resources capacity, material flows and temporal interdependencies between sites. A case-study is reported and the industrial problem under consideration is modelled as a constraint satisfaction problem (CSP). Besides scheduling under resource constraints, the model presented in this paper expands the packing problem to the area of transportation operations scheduling. It is implemented under the constraint programming language CHIP V5. The provided solutions determine values for the various variables associated to the production and transportation operations realised on the whole multi-site, as well as the curves with the profile of the total consumption of resources in time.
    International Journal of Computer Integrated Manufacturing 01/2012; · 0.94 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: a b s t r a c t This paper concerns project scheduling under resource constraints. Traditionally, the objective is to find a unique solution that minimizes the project makespan, while respecting the precedence constraints and the resource constraints. This work focuses on developing a model and a decision support framework for industrial application of the cumulative global constraint. For a given project scheduling, the proposed approach allows the generation of different optimal solutions relative to the alternate availability of out-sourcing and resources. The objective is to provide a decision-maker an assistance to construct, choose, and define the appropriate scheduling program taking into account the possible capacity resources. The industrial problem under consideration is modeled as a constraint satisfaction problem (CSP). It is imple-mented under the constraint programming language CHIP V5. The provided solutions determine values for the various variables associated to the tasks realized on each resource, as well as the curves with the profile of the total consumption of resources on time.
    Computers & Industrial Engineering 09/2010; 61:357-363. · 1.69 Impact Factor
  • [Show abstract] [Hide abstract]
    ABSTRACT: Arc-consistency algorithms are the workhorse of backtrackers that maintain arc-consistency (MAC). This paper will provide experimental evidence that, despite common belief to the contrary, it is not always necessary for a good arc-consistency algorithm to have an optimal worst-case time-complexity. Sacrificing this optimality allows MAC solvers that (1) do not need additional data structures during search, (2) have an excellent average time-complexity, and (3) have a space-complexity that improves significantly on that of MAC solvers that have optimal arc-consistency components. Results will be presented from an experimental comparison between MAC-2001, MAC-3d and related algorithms. MAC-2001 has an arc-consistency component with an optimal worst-case time-complexity, whereas MAC-3d does not. MAC-2001 requires additional data structures during search, whereas MAC-3d does not. MAC-3d has a O(e+nd) of space-complexity, where n is the number of variables, d the maximum domain size, and e the number of constraints. We shall demonstrate that MAC-2001's space-complexity is O(edmin(n,d)). Our experimental results indicate that MAC-2001 was slower than MAC-3d for easy and hard random problems. For real-world problems things were not as clear.
    Artificial Intelligence Review 06/2004; 21(3-4). · 1.57 Impact Factor

Full-text

Download
0 Downloads
Available from