all-interval.cpp
Go to the documentation of this file.
00001 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */ 00002 /* 00003 * Main authors: 00004 * Christian Schulte <schulte@gecode.org> 00005 * 00006 * Copyright: 00007 * Christian Schulte, 2006 00008 * 00009 * Last modified: 00010 * $Date: 2010-05-08 19:24:20 +0200 (Sat, 08 May 2010) $ by $Author: tack $ 00011 * $Revision: 10910 $ 00012 * 00013 * This file is part of Gecode, the generic constraint 00014 * development environment: 00015 * http://www.gecode.org 00016 * 00017 * Permission is hereby granted, free of charge, to any person obtaining 00018 * a copy of this software and associated documentation files (the 00019 * "Software"), to deal in the Software without restriction, including 00020 * without limitation the rights to use, copy, modify, merge, publish, 00021 * distribute, sublicense, and/or sell copies of the Software, and to 00022 * permit persons to whom the Software is furnished to do so, subject to 00023 * the following conditions: 00024 * 00025 * The above copyright notice and this permission notice shall be 00026 * included in all copies or substantial portions of the Software. 00027 * 00028 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, 00029 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF 00030 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 00031 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE 00032 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION 00033 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION 00034 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. 00035 * 00036 */ 00037 00038 #include <gecode/driver.hh> 00039 #include <gecode/int.hh> 00040 #include <gecode/minimodel.hh> 00041 00042 #include <cstdlib> 00043 00044 using namespace Gecode; 00045 00066 class AllInterval : public Script { 00067 private: 00069 IntVarArray x; 00070 public: 00072 AllInterval(const SizeOptions& opt) : 00073 x(*this, opt.size(), 0, opt.size() - 1) { 00074 const int n = x.size(); 00075 00076 IntVarArgs d(n-1); 00077 00078 // Set up variables for distance 00079 for (int i=0; i<n-1; i++) 00080 d[i] = expr(*this, abs(x[i+1]-x[i]), opt.icl()); 00081 00082 // Constrain them to be between 1 and n-1 00083 dom(*this, d, 1, n-1); 00084 00085 distinct(*this, x, opt.icl()); 00086 distinct(*this, d, opt.icl()); 00087 00088 // Break mirror symmetry 00089 rel(*this, x[0], IRT_LE, x[1]); 00090 // Break symmetry of dual solution 00091 rel(*this, d[0], IRT_GR, d[n-2]); 00092 00093 branch(*this, x, INT_VAR_SIZE_MIN, INT_VAL_SPLIT_MIN); 00094 } 00096 AllInterval(bool share, AllInterval& e) 00097 : Script(share, e) { 00098 x.update(*this, share, e.x); 00099 } 00101 virtual Space* 00102 copy(bool share) { 00103 return new AllInterval(share, *this); 00104 } 00106 virtual void 00107 print(std::ostream& os) const { 00108 const int n = x.size(); 00109 os << "\tx[" << n << "] = {"; 00110 for (int i = 0; i < n-1; i++) 00111 os << x[i] << "(" << abs(x[i+1].val()-x[i].val()) << "),"; 00112 os << x[n-1] << "}" << std::endl; 00113 } 00114 }; 00115 00116 00120 int 00121 main(int argc, char* argv[]){ 00122 SizeOptions opt("AllInterval"); 00123 opt.size(1000); 00124 opt.iterations(5); 00125 opt.icl(ICL_BND); 00126 opt.parse(argc, argv); 00127 if (opt.size() < 2) { 00128 std::cerr << "size must be at least 2!" << std::endl; 00129 return -1; 00130 } 00131 Script::run<AllInterval,DFS,SizeOptions>(opt); 00132 return 0; 00133 } 00134 00135 // STATISTICS: example-any 00136