求解任务分配问题

1.增量穷举法

#include<stdio.h>
#include<vector>
using namespace std;
#define INF 99999
#define MAXN 21

int n=4;
int c[MAXN][MAXN]={{9,2,7,8},{6,4,3,7},{5,8,1,8},{7,6,9,4}};
vector<vector<int> >ps;
void Insert(vector<int>s,int i,vector<vector<int> > &ps1){
	//在每个集合元素中间插入i得到ps1
	vector<int>s1;
	vector<int>::iterator it;
	for(int j=0;j<i;j++){
		s1=s;
		it=s1.begin()+j;
		s1.insert(it,i);
		ps1.push_back(s1); 
	} 
}
void Perm(int n){
	vector< vector<int> > ps1;
	vector< vector<int> >::iterator it;
	vector<int>s,s1;
	s.push_back(1);
	ps.push_back(s);
	for(int i=2;i<=n;i++){
		ps1.clear();
		for(it=ps.begin();it!=ps.end();it++){
			Insert(*it,i,ps1);
		}
		ps=ps1;
	}
}
void Allocate(int n,int &mini,int &minc){
	Perm(n);
	for(int i=0;i<ps.size();i++){
		int cost=0;
		for(int j=0;j<ps[i].size();j++){
			cost+=c[j][ps[i][j]-1];
		}
		if(cost<minc){
			minc=cost;
			mini=i;
		}
	} 
}
int main(){
	int mincost=INF,mini;
	Allocate(n,mini,mincost);
	printf("最优方案 : \n");
	for(int k=0;k<ps[mini].size();k++){
		printf("第%d个人安排任务%d\n",k+1,ps[mini][k]);
	}
	printf("总成本=%d\n",mincost);
}

2.回溯法

#include<stdio.h>
#include<string.h>
#include<queue>
#include<vector>
using namespace std;
#define INF 99999
#define MAXN 21
int n=4;
int c[MAXN][MAXN]={{0},{0,9,2,7,8},{0,6,4,3,7},{0,5,8,1,8},{0,7,6,9,4}};
int x[MAXN];
int cost=0;
int bestx[MAXN];
int mincost=INF;
bool worker[MAXN];
void dfs(int i){
	if(i>n){
		if(cost<mincost){
			mincost=cost;
			for(int j=1;j<=n;j++){
				bestx[j]=x[j];
			}
		}
	}
	else {
		for(int j=1;j<=n;j++){
			if(!worker[j]){
				worker[j]=true;
				x[i]=j;
				cost+=c[i][j];
				dfs(i+1);
				worker[j]=false;
				x[j]=0;
				cost-=c[i][j];
			}
		}
	}
}
int main(){
	memset(worker,0,sizeof(worker));
	dfs(1);
	printf("最优方案:\n");
	for(int k=1;k<=n;k++){
		printf("第%d个人安排任务%d\n",k,bestx[k]);
	}
	printf("总成本=%d\n",mincost);
}