Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
4.7 kB · 161 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Stefano Gualandi <stefano.gualandi@gmail.com> * Christian Schulte <schulte@gecode.org> * * Copyright: * Stefano Gualandi, 2013 * Christian Schulte, 2010 * * This file is part of Gecode, the generic constraint * development environment: * http://www.gecode.org * * Permission is hereby granted, free of charge, to any person obtaining * a copy of this software and associated documentation files (the * "Software"), to deal in the Software without restriction, including * without limitation the rights to use, copy, modify, merge, publish, * distribute, sublicense, and/or sell copies of the Software, and to * permit persons to whom the Software is furnished to do so, subject to * the following conditions: * * The above copyright notice and this permission notice shall be * included in all copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. * */
#include <gecode/int/bin-packing.hh>
namespace Gecode {
void binpacking(Home home, const IntVarArgs& l, const IntVarArgs& b, const IntArgs& s, IntPropLevel) { using namespace Int; if (same(l,b)) throw ArgumentSame("Int::binpacking"); if (b.size() != s.size()) throw ArgumentSizeMismatch("Int::binpacking"); for (int i=0; i<s.size(); i++) Limits::nonnegative(s[i],"Int::binpacking"); GECODE_POST;
ViewArray<OffsetView> lv(home,l.size()); for (int i=0; i<l.size(); i++) lv[i] = OffsetView(l[i],0);
ViewArray<BinPacking::Item> bs(home,b.size()); for (int i=0; i<bs.size(); i++) bs[i] = BinPacking::Item(b[i],s[i]);
GECODE_ES_FAIL(Int::BinPacking::Pack::post(home,lv,bs)); }
IntSet binpacking(Home home, int d, const IntVarArgs& l, const IntVarArgs& b, const IntArgs& s, const IntArgs& c, IntPropLevel) { using namespace Int;
if (same(l,b)) throw ArgumentSame("Int::binpacking");
// The number of items int n = b.size(); // The number of bins int m = l.size() / d;
// Check input sizes if ((n*d != s.size()) || (m*d != l.size()) || (d != c.size())) throw ArgumentSizeMismatch("Int::binpacking"); for (int i=0; i<s.size(); i++) Limits::nonnegative(s[i],"Int::binpacking"); for (int i=0; i<c.size(); i++) Limits::nonnegative(c[i],"Int::binpacking");
if (home.failed()) return IntSet::empty;
PostInfo pi(home);
// Capacity constraint for each dimension for (int k=0; k<d; k++) for (int j=0; j<m; j++) { IntView li(l[j*d+k]); if (me_failed(li.lq(home,c[k]))) { home.fail(); return IntSet::empty; } }
// Post a binpacking constraint for each dimension for (int k=0; k<d; k++) { ViewArray<OffsetView> lv(home,m); for (int j=0; j<m; j++) lv[j] = OffsetView(l[j*d+k],0);
ViewArray<BinPacking::Item> bv(home,n); for (int i=0; i<n; i++) bv[i] = BinPacking::Item(b[i],s[i*d+k]);
if (Int::BinPacking::Pack::post(home,lv,bv) == ES_FAILED) { home.fail(); return IntSet::empty; } }
// Clique Finding and distinct posting { // First construct the conflict graph Region r; BinPacking::ConflictGraph cg(home,r,b,m);
for (int i=0; i<n-1; i++) { for (int j=i+1; j<n; j++) { unsigned int nl = 0; unsigned int ds = 0; IntVarValues ii(b[i]), jj(b[j]); while (ii() && jj()) { if (ii.val() < jj.val()) { ++ii; } else if (ii.val() > jj.val()) { ++jj; } else { ds++; for (int k=0; k<d; k++) if (s[i*d+k] + s[j*d+k] > c[k]) { nl++; break; } ++ii; ++jj; } } if (nl >= ds) cg.edge(i,j); } }
if (cg.post() == ES_FAILED) home.fail();
// The clique can be computed even if home is failed return cg.maxclique(); } }
}
// STATISTICS: int-post