开源 企业版 高校版 私有云 模力方舟 AI 队友
代码拉取完成,页面将自动刷新
加入 Gitee
与超过 1400万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
已有帐号? 立即登录
文件
master
分支 (7)
标签 (49)
master
build-modernization
release/6.3.0
cmake-test-suite
feature/use_std_threads
feature/on_restart2_nary_lastval_int
develop
release-6.2.0
release-6.1.1
release-6.1.0
release-6.0.1
release-6.0.0
release-5.1.0
release-5.0.0
release-4.4.0
release-4.3.3
release-4.3.2
release-4.3.1
release-4.3.0
release-4.2.1
release-4.2.0
release-4.1.0
release-4.0.0
release-3.7.3
release-3.7.2
release-3.7.1
release-3.7.0
master
分支 (7)
标签 (49)
master
build-modernization
release/6.3.0
cmake-test-suite
feature/use_std_threads
feature/on_restart2_nary_lastval_int
develop
release-6.2.0
release-6.1.1
release-6.1.0
release-6.0.1
release-6.0.0
release-5.1.0
release-5.0.0
release-4.4.0
release-4.3.3
release-4.3.2
release-4.3.1
release-4.3.0
release-4.2.1
release-4.2.0
release-4.1.0
release-4.0.0
release-3.7.3
release-3.7.2
release-3.7.1
release-3.7.0
克隆/下载
克隆/下载
提示
下载代码请复制以下命令到终端执行
为确保你提交的代码身份被 Gitee 正确识别,请执行以下命令完成配置
初次使用 SSH 协议进行代码克隆、推送等操作时,需按下述提示完成 SSH 配置
1 生成 RSA 密钥
2 获取 RSA 公钥内容,并配置到 SSH公钥
在 Gitee 上使用 SVN,请访问 使用指南
使用 HTTPS 协议时,命令行会出现如下账号密码验证步骤。基于安全考虑,Gitee 建议 配置并使用私人令牌 替代登录密码进行克隆、推送等操作
Username for 'https://gitee.com': userName
Password for 'https://userName@gitee.com': # 私人令牌
master
分支 (7)
标签 (49)
master
build-modernization
release/6.3.0
cmake-test-suite
feature/use_std_threads
feature/on_restart2_nary_lastval_int
develop
release-6.2.0
release-6.1.1
release-6.1.0
release-6.0.1
release-6.0.0
release-5.1.0
release-5.0.0
release-4.4.0
release-4.3.3
release-4.3.2
release-4.3.1
release-4.3.0
release-4.2.1
release-4.2.0
release-4.1.0
release-4.0.0
release-3.7.3
release-3.7.2
release-3.7.1
release-3.7.0
gecode
/
examples
/
crew.cpp
gecode
/
examples
/
crew.cpp
crew.cpp 8.28 KB
一键复制 编辑 原始数据 按行查看 历史
Christian Schulte 提交于 2018年03月22日 18:28 +08:00 . Remove svn-specific last modified info
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
Loading...
举报
举报成功
我们将于2个工作日内通过站内信反馈结果给你!
请认真填写举报原因,尽可能描述详细。
请选择举报类型
取消
发送
误判申诉

此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。

如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。

取消
提交

简介

构建约束满足问题(Constraint Satisfaction Problems, CSP)。核心是约束求解器,包括回溯搜索、约束传播和启发式搜索等 调度问题:如任务调度、课程安排等。 组合优化问题:如背包问题、旅行商问题(TSP)等。 资源分配问题:如分配机器到任务、人员到项目等。 逻辑推理问题:如逻辑谜题、数独等. Gecode 的通用性和高性能使其在学术研究和工业应用中都有广泛的应用
取消

发行版

暂无发行版

贡献者

全部

近期动态

不能加载更多了
编辑仓库简介
简介内容
主页
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/hardware_5/gecode.git
git@gitee.com:hardware_5/gecode.git
hardware_5
gecode
gecode
master
点此查找更多帮助

搜索帮助

评论
仓库举报
回到顶部
登录提示
该操作需登录 Gitee 帐号,请先登录后再操作。
立即登录
没有帐号,去注册

AltStyle によって変換されたページ (->オリジナル) /