Something went wrong. Try again.
This repository has no description
Something went wrong. Try again.
7.3 kB · 248 lines
C++
at develop
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- *//* * Main authors: * Christian Schulte <schulte@gecode.org> * * Copyright: * Christian Schulte, 2005 * * 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/driver.hh>#include <gecode/int.hh>#include <gecode/minimodel.hh>
using namespace Gecode;
/// Number of warehousesconst int n_warehouses = 5;/// Number of storesconst int n_stores = 10;
/// Fixed cost for one warehouseconst int c_fixed = 30;
/// Capacity of a single warehouseconst int capacity[n_warehouses] = { 1, 4, 2, 1, 3};
/// Cost for supply a store by a warehouseconst int c_supply[n_stores][n_warehouses] = { {20, 24, 11, 25, 30}, {28, 27, 82, 83, 74}, {74, 97, 71, 96, 70}, { 2, 55, 73, 69, 61}, {46, 96, 59, 83, 4}, {42, 22, 29, 67, 59}, { 1, 5, 73, 59, 56}, {10, 73, 13, 43, 96}, {93, 35, 63, 85, 46}, {47, 65, 55, 71, 95}};
/// Model variantsenum { MODEL_SUMCOST, ///< Use sum as total cost MODEL_LEXCOST ///< Use lexicographic cost};
/** * \brief %Example: Locating warehouses * * A company needs to construct warehouses to supply stores with * goods. Each warehouse possibly to be constructed has a certain * capacity defining how many stores it can supply. Constructing a * warehouse incurs a fixed cost. Costs for transportation from * warehouses to stores depend on the locations of warehouses and * stores. * * Determine which warehouses should be constructed and which * warehouse should supply which store such that overall cost * (transportation cost plus construction cost) is smallest. * * Taken from: * Pascal Van Hentenryck, The OPL Optmization Programming Language, * The MIT Press, 1999. * * See also problem 34 at http://www.csplib.org/. * * Note that "Modeling and Programming with Gecode" uses this example * as a case study. * * \ingroup Example * */template<class Script>class Warehouses : public Script {protected: /// Which warehouse supplies a store IntVarArray supplier; /// Is a warehouse open (warehouse needed) BoolVarArray open; /// Cost of a store IntVarArray c_store;public: /// Actual model Warehouses(const Options& opt) : Script(opt), supplier(*this, n_stores, 0, n_warehouses-1), open(*this, n_warehouses, 0, 1), c_store(*this, n_stores) {
// A warehouse is open, if it supplies to a store for (int s=0; s<n_stores; s++) element(*this, open, supplier[s], 1);
// Compute cost for each warehouse for (int s=0; s<n_stores; s++) { IntArgs c(n_warehouses, c_supply[s]); c_store[s] = expr(*this, element(c, supplier[s])); }
// Do not exceed capacity { IntSetArgs c(n_warehouses); for (int w=0; w<n_warehouses; w++) c[w] = IntSet(0,capacity[w]); count(*this, supplier, c, IPL_DOM); }
// Branch with largest minimum regret on store cost branch(*this, c_store, INT_VAR_REGRET_MIN_MAX(), INT_VAL_MIN()); // Branch by assigning a supplier to each store branch(*this, supplier, INT_VAR_NONE(), INT_VAL_MIN()); } /// Constructor for cloning \a s Warehouses(Warehouses& s) : Script(s) { supplier.update(*this, s.supplier); open.update(*this, s.open); c_store.update(*this, s.c_store); }};
/// Model with cost defined as sumclass SumCostWarehouses : public Warehouses<IntMinimizeScript> {protected: /// Total cost IntVar c_total;public: /// Actual model SumCostWarehouses(const Options& opt) : Warehouses<IntMinimizeScript>(opt) { // Compute total cost c_total = expr(*this, c_fixed*sum(open) + sum(c_store)); } /// Return solution cost virtual IntVar cost(void) const { return c_total; } /// Constructor for cloning \a s SumCostWarehouses(SumCostWarehouses& s) : Warehouses<IntMinimizeScript>(s) { c_total.update(*this, s.c_total); } /// Copy during cloning virtual Space* copy(void) { return new SumCostWarehouses(*this); } /// Print solution virtual void print(std::ostream& os) const { os << "\tSupplier: " << supplier << std::endl << "\tOpen warehouses: " << open << std::endl << "\tStore cost: " << c_store << std::endl << "\tTotal cost: " << c_total << std::endl << std::endl; }};
/// Model with cost defined lexicographicallyclass LexCostWarehouses : public Warehouses<IntLexMinimizeScript> {protected: /// Cost for open warehouses IntVar c_open; /// Cost for stores IntVar c_stores;public: /// Actual model LexCostWarehouses(const Options& opt) : Warehouses<IntLexMinimizeScript>(opt) { // Compute costs c_open = expr(*this, sum(open)); c_stores = expr(*this, sum(c_store)); } /// Return solution cost virtual IntVarArgs cost(void) const { return {c_open, c_stores}; } /// Constructor for cloning \a s LexCostWarehouses(LexCostWarehouses& s) : Warehouses<IntLexMinimizeScript>(s) { c_open.update(*this, s.c_open); c_stores.update(*this, s.c_stores); } /// Copy during cloning virtual Space* copy(void) { return new LexCostWarehouses(*this); } /// Print solution virtual void print(std::ostream& os) const { os << "\tSupplier: " << supplier << std::endl << "\tOpen warehouses: " << open << std::endl << "\tOpen cost: " << c_open << std::endl << "\tStores cost: " << c_stores << std::endl << std::endl; }};
/** \brief Main-function * \relates Warehouses */intmain(int argc, char* argv[]) { Options opt("Warehouses"); opt.model(MODEL_SUMCOST); opt.model(MODEL_SUMCOST, "sum", "use sum of costs"); opt.model(MODEL_LEXCOST, "lex", "use lexicographic cost"); opt.solutions(0); opt.iterations(10); opt.parse(argc,argv); switch (opt.model()) { case MODEL_SUMCOST: IntMinimizeScript::run<SumCostWarehouses,BAB,Options>(opt); break; case MODEL_LEXCOST: IntLexMinimizeScript::run<LexCostWarehouses,BAB,Options>(opt); break; } return 0;}
// STATISTICS: example-any