1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Guido Tack, 2004
* Christian Schulte, 2004
*
* 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/set.hh>
using namespace Gecode;
namespace {
/// The airline employees
typedef enum {
Tom, David, Jeremy, Ron,
Joe, Bill, Fred,
Bob, Mario, Ed,
Carol, Janet, Tracy,
Marilyn, Carolyn, Cathy,
Inez, Jean, Heather, Juliet
} Employee;
const int noOfEmployees = Juliet+1;
/// A flight to schedule
struct Flight {
int staff; ///< Overall number of cabin crew needed
int stewards; ///< How many stewards are required
int hostesses; ///< How many hostesses are required
int french; ///< How many French speaking employees are required
int spanish; ///< How many Spanish speaking employees are required
int german; ///< How many German speaking employees are required
};
const char* employeeToName(Employee e);
extern const int stewards[];
extern const int noOfStewards;
extern const int hostesses[];
extern const int noOfHostesses;
extern const int spanishSpeaking[];
extern const int noOfSpanishSpeaking;
extern const int frenchSpeaking[];
extern const int noOfFrenchSpeaking;
extern const int germanSpeaking[];
extern const int noOfGermanSpeaking;
extern const Flight requiredCrew[];
extern const int noOfFlights;
}
/**
* \brief %Example: Airline crew allocation
*
* Assign 20 flight attendants to 10 flights. Each flight needs a certain
* number of cabin crew, and they have to speak certain languages.
* Every cabin crew member has two flights off after an attended flight.
*
* \ingroup Example
*
*/
class Crew : public Script {
public:
/// The crew for each flight
SetVarArray flight;
/// The actual model
Crew(const Options& opt)
: Script(opt), flight(*this,noOfFlights,IntSet::empty,0,noOfEmployees-1) {
IntSet stewardsDS(stewards,noOfStewards);
IntSet hostessesDS(hostesses,noOfHostesses);
IntSet spanishDS(spanishSpeaking, noOfSpanishSpeaking);
IntSet frenchDS(frenchSpeaking, noOfFrenchSpeaking);
IntSet germanDS(germanSpeaking, noOfGermanSpeaking);
for (int i=0; i<noOfFlights; i++) {
// The flight has staff as required by the specification
rel(*this, cardinality(flight[i]) == requiredCrew[i].staff);
// Enough members of different categories are on board
rel(*this, cardinality(flight[i] & stewardsDS) >=
requiredCrew[i].stewards);
rel(*this, cardinality(flight[i] & hostessesDS) >=
requiredCrew[i].hostesses);
rel(*this, cardinality(flight[i] & spanishDS) >=
requiredCrew[i].spanish);
rel(*this, cardinality(flight[i] & frenchDS) >=
requiredCrew[i].french);
rel(*this, cardinality(flight[i] & germanDS) >=
requiredCrew[i].german);
}
// No crew member of flight i works on flights i+1 and i+2
for (int i=0; i<noOfFlights-2; i++) {
rel(*this, flight[i] || flight[i+1]);
rel(*this, flight[i] || flight[i+2]);
}
rel(*this, flight[noOfFlights-2] || flight[noOfFlights-1]);
branch(*this, flight, SET_VAR_NONE(), SET_VAL_MIN_INC());
}
/// Print solution
virtual void
print(std::ostream& os) const {
for (int i=0; i<noOfFlights; i++) {
os << "\tFlight " << i+1 << ":" << std::endl;
os << "\t\tCrew\tStew.\tHost.\tFrench\tSpanish\tGerman"
<< std::endl << "\t";
os << "\t" << requiredCrew[i].staff << "\t" << requiredCrew[i].stewards
<< "\t" << requiredCrew[i].hostesses << "\t"
<< requiredCrew[i].spanish
<< "\t" << requiredCrew[i].french << "\t" << requiredCrew[i].german
<< std::endl;
os << "\t\tSchedule:" << std::endl << "\t\t";
if (flight[i].assigned()) {
for (SetVarGlbValues d(flight[i]);d();++d) {
os << employeeToName(static_cast<Employee>(d.val())) << " ";
}
} else {
os << "\tRequired: ";
for (SetVarGlbValues d(flight[i]);d();++d) {
os << employeeToName(static_cast<Employee>(d.val())) << " ";
}
os << std::endl << "\t\t\tPossible: ";
for (SetVarUnknownValues d(flight[i]);d();++d) {
os << employeeToName(static_cast<Employee>(d.val())) << " ";
}
}
os << std::endl << std::endl;
}
}
/// Constructor for cloning \a s
Crew(Crew& s)
: Script(s) {
flight.update(*this, s.flight);
}
/// Copy during cloning
virtual
Space *copy(void) {
return new Crew(*this);
}
};
/** \brief Main-function
* \relates Crew
*/
int
main(int argc, char* argv[]) {
Options o("Crew");
o.iterations(100);
o.parse(argc,argv);
Script::run<Crew,DFS,Options>(o);
return 0;
}
namespace {
/// Return name of employee \a e as a string
const char*
employeeToName(Employee e) {
switch(e) {
case Tom : return "Tom";
case David : return "David";
case Jeremy: return "Jeremy";
case Ron: return "Ron";
case Joe: return "Joe";
case Bill: return "Bill";
case Fred: return "Fred";
case Bob: return "Bob";
case Mario: return "Mario";
case Ed: return "Ed";
case Carol: return "Carol";
case Janet: return "Janet";
case Tracy: return "Tracy";
case Marilyn: return "Marilyn";
case Carolyn: return "Carolyn";
case Cathy: return "Cathy";
case Inez: return "Inez";
case Jean: return "Jean";
case Heather: return "Heather";
case Juliet: return "Juliet";
default: GECODE_NEVER; return "";
}
}
// these have to be sorted!
/// The stewards
const int stewards[] =
{Tom, David, Jeremy, Ron, Joe, Bill, Fred, Bob, Mario, Ed};
/// The number of stewards
const int noOfStewards = sizeof(stewards) / sizeof(int);
/// The hostesses
const int hostesses[] =
{ Carol, Janet, Tracy, Marilyn, Carolyn, Cathy, Inez,
Jean, Heather, Juliet };
/// The number of hostesses
const int noOfHostesses = sizeof(hostesses) / sizeof(int);
/// The French speaking employees
const int frenchSpeaking[] =
{ Bill, Inez, Jean, Juliet };
/// The number of French speaking employees
const int noOfFrenchSpeaking = sizeof(frenchSpeaking) / sizeof(int);
/// The German speaking employees
const int germanSpeaking[] =
{ Tom, Jeremy, Mario, Cathy, Juliet };
/// The number of German speaking employees
const int noOfGermanSpeaking = sizeof(germanSpeaking) / sizeof(int);
/// The Spanish speaking employees
const int spanishSpeaking[] =
{ Joe, Bill, Fred, Mario, Marilyn, Inez, Heather };
/// The number of Spanish speaking employees
const int noOfSpanishSpeaking = sizeof(spanishSpeaking) / sizeof(int);
/// The flights to schedule
const Flight requiredCrew[] =
{ {4,1,1,1,1,1},
{5,1,1,1,1,1},
{5,1,1,1,1,1},
{6,2,2,1,1,1},
{7,3,3,1,1,1},
{4,1,1,1,1,1},
{5,1,1,1,1,1},
{6,1,1,1,1,1},
{6,2,2,1,1,1},
{7,3,3,1,1,1} };
/// The number of flights to schedule
const int noOfFlights = sizeof(requiredCrew) / sizeof(Flight);
}
// STATISTICS: example-any
|