Java调用cplex求解运输问题
本文中的课件来自清华大学深圳国际研究生院，物流与交通学部张灿荣教授《生产管理》课程。
运输问题(Transportation Problem)描述
运输问题是一种特殊的最小费用网络流问题，其中每个节点都是一个纯供给节点或一个纯需求节点。即所有的流都从供给它的某个源头节点出发，而后直接到达一个需要它的需求节点，中间不经过其它中间步骤或转运环节。一个运输问题中的商品流可能是任何东西，唯一必要的条件就是需要从供给源头节点流入需求节点。总结一下，运输问题具有以下的特点：
运输问题的数学模型
首先定义运输问题的参数与决策变量：
目标函数为最小化运输成本：
约束一为从每个供给节点运出的商品总和等于该节点可用商品的数量：
约束二为每个需求节点流入的商品总和等于该节点需求商品的数量：
最后决策变量的取值范围：
综上，1~4式即为运输问题的数学模型，且为一个线性规划模型。
Java调用cplex求解运输问题
本节介绍如果使用Java语言调用cplex求解器对运输问题进行求解。问题相关参数如下：
Java是一种面向对象的编程语言，故编写过程中主要涉及以下几个类：
transportation_node类
package transportation_problem;
/**
* This class is to define the transportation_node
* @param Property of node
* @return a node object
*/
public class transportation_node {
String NodeName;
int quantity;
int isSource;
int id;
public transportation_node(String NodeName,int quantity,int isSource,int id) {
this.NodeName = NodeName;
this.quantity = quantity;
this.isSource = isSource;
this.id = id;
}
public boolean isSource() {
if(this.isSource == 1) {
return true;
}
return false;
}
}
transportation_relation类
package transportation_problem;
/**
* This class is to define the transportation_relation
* @param Property of node
* @return a relation object
*/
public class transportation_relation {
int [] distance ;
public transportation_relation(int[] distance) {
this.distance = distance;
}
}
读取数据
package transportation_problem;
import java.io.*;
import java.util.*;
/**
* This class is to read data from txt file
* @param path: the file path to be read
* @return return a data object
* @throws IOException
*/
public class Readfile {
List transportationNodeList = new ArrayList();
transportation_relation transportationRelation;public Readfile(String path1,String path2) throws IOException {
readtransportation_node(path1);
transportation_relation(path2);
}public void readtransportation_node(String path) throws IOException {
BufferedReader br = new BufferedReader(new FileReader(path));
String line = new String();//读取变量
br.readLine();
line = br.readLine();
String[] tokens = line.split("\\s+");while(tokens.length > 0) {
transportation_node Temp = new transportation_node(tokens[0],Integer.parseInt(tokens[1]),Integer.parseInt(tokens[2]),Integer.parseInt(tokens[3]));
transportationNodeList.add(Temp);
line = br.readLine();
tokens = line.split("\\s+");
}
br.close();
}public void transportation_relation(String path) throws IOException {
BufferedReader br = new BufferedReader(new FileReader(path));
String line[] = new String[100];int row = 0;
line[row] = br.readLine();while(line[row] != null) {
row++;
line[row] = br.readLine();
}
String[] tokens = line[0].split("\\s+");int column = tokens.length;int [] dis = new int[(row-1)*column];for (int i = 1; i tokens = line[i].split("\\s+");for (int j = 1; j <= column; j++) {
dis[(column)*(i-1)+j-1] = Integer.parseInt(tokens[j]);
}
}
transportationRelation = new transportation_relation(dis);
br.close();
}
}在cplex中建立运输问题模型
package transportation_problem;
import java.util.List;
import ilog.concert.IloException;
import ilog.concert.IloNumExpr;
import ilog.concert.IloNumVar;
import ilog.cplex.IloCplex;
/**
* This class is to conduct a model in cplex and solve
* @param problem parameter
* @return return solve result
* @throws IloException
*/
public class model_transportation {
IloCplex cplex ;
double objectiveValue;
IloNumVar x[];
int numOfPlants = 0;
int numOfdestination = 0;
/**
* This method is to bulidModel
* @param transportation_problem's data
* @return transportation_problem's model
* @throws IloException
*/
public void bulidModel(List transportationNodeList,transportation_relation transportationRelation)throws IloException {
this.cplex = new IloCplex();
for(transportation_node tsNode : transportationNodeList){
if (tsNode.isSource()) {
numOfPlants++;
}else {
numOfdestination++;
}
}
CreatDecisionVariab();
CreatObjFunc(transportationRelation);
CreatConstraints(transportationNodeList);
Solve(transportationNodeList);
}
/**
* This method is to create decision variables
* @throws IloException
*/
public void CreatDecisionVariab() throws IloException{
x = new IloNumVar[numOfPlants*numOfdestination];
for (int i = 0; i for (int j = 0; j x[i*numOfdestination+j] = cplex.numVar(0, Double.MAX_VALUE,"x"+(i+1)+(j+1));
}
}
}
/**
* This method is to create objective function
* @throws IloException
*/
public void CreatObjFunc(transportation_relation transportationRelation) throws IloException{
cplex.addMinimize(cplex.scalProd(x,transportationRelation.distance));
}
/**
* This method is to add constraints
* @throws IloException
*/
public void CreatConstraints(List transportationNodeList) throws IloException {
for(transportation_node tsNode : transportationNodeList){
IloNumExpr left = cplex.linearNumExpr();
if (tsNode.isSource()) {
for(int i = 0;i left = cplex.sum(left,cplex.prod(1,x[tsNode.id*numOfdestination+i]));
}
cplex.addEq(left,tsNode.quantity);
}else {
for(int i = 0;i left = cplex.sum(left,cplex.prod(1,x[tsNode.id+i*numOfdestination]));
}
cplex.addEq(left,tsNode.quantity);
}
}
}
/**
* This method is to solve model
* @return values of objective function and decision variables
* @throws IloException
*/
public void Solve(List transportationNodeList) throws IloException{
cplex.setOut(null);
if (cplex.solve()) {
cplex.exportModel("111.lp");
objectiveValue = cplex.getObjValue();
System.out.println("最小运费为：" + objectiveValue);
for (int i = 0; i for (int j = 0; j System.out.print(transportationNodeList.get(i).NodeName+" to "+transportationNodeList.get(numOfPlants+j).NodeName+" : ");
System.out.println(cplex.getValue(x[i*numOfdestination+j]));
}
}
}
}
}
主函数main
package transportation_problem;
import java.io.IOException;
import java.util.List;
import ilog.concert.IloException;
public class Main {
public static void main(String[] args) throws IOException, IloException {
Readfile file = new Readfile("transportation_node.txt","transportation_relation.txt");
List transportationNodeList = file.transportationNodeList;
transportation_relation transportationRelation = file.transportationRelation;
model_transportation model = new model_transportation();
model.bulidModel(transportationNodeList, transportationRelation);
}
}求解结果
导出模型：
这样就完成了，感谢大家的阅读。
作者：夏旸，清华大学，工业工程系/深圳国际研究生院 (硕士在读)
邮箱：xia970201@gmail.com
完整Project文件请在后台回复【运输问题】获取。
往期精彩文章：优化 | 如何优雅地写出大规模线性规划的对偶优化 | TSP中两种不同消除子环路的方法及Callback实现(Python调用Gurobi求解)元启发式算法 | 禁忌搜索(Tabu Search)解决TSP问题(Python代码实现)优化|Shortest Path Problem及其对偶问题的一些探讨(附Python调用Gurobi实现) 排版 | 王基光，清华大学，清华-伯克利深圳学院(硕士在读)
审校 | 王涵民，清华大学，清华-伯克利深圳学院(硕士在读)
1495
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
