1. 文档阅读说明
本文档是作者利用Java编程语言编写的启发式算法求解带时间窗车辆路径问题。包括两大部分:一是带时间窗车辆路径问题描述;二是编程算法求解代码及说明(并附录Solomon经典案例求解结果)。
2. VRPTW定义
标准的带时间窗车辆路径问题定义如下:
- 车辆从某一车场出发,服务后返回该车场;
- 每个顾客有且被一辆车服务一次;
- 服务有时间窗限制,车辆可早到,但不允许晚到;
- 车辆有最大旅行时间和容量限制;
- 所使用的车辆数不超过最大可使用车辆数量。
基于上述问题,本文档在IntelliJ IDEA平台利用Java语言进行编程,求解该车辆路径问题。主要利用贪心策略求解。核心程序的各个部分如下所示:
3. Java数据读取(附Java代码)
- 原始数据格式:以Solomon数据案例C101_25为例:
上述是Solomon经典案例的某一个案例的原始数据,各行代表的意思如下:第一行:案例编号第二行:空行(注意读取数据时需要跳过,下同)第三行:车辆信息第四行:车辆数量 每辆车装载能力第五行:空行第六行:客户信息第七行:客户编码 X坐标 Y坐标 需求量 开始服务时间 结束服务时间 服务时间第八行之后:按照第七行顺序所列的具体客户信息
- 读取该数据的说明如下:
算法运行的前提是需要输入客户、车辆等的数据,那么如何读取这些数据呢?下面以读取Solomon数据案例C101_25为例进行说明。代码及其代码说明如下
public class Reader {
public static Instance readInstance(File file) throws FileNotFoundException {
Scanner scanner = new Scanner(file);
String line = scanner.nextLine().trim();
line = scanner.nextLine().trim();
line = scanner.nextLine().trim();
line = scanner.nextLine().trim();
line = scanner.nextLine().trim();
String [] parts = line.split("\\s+");
int nrVehicles = Integer.parseInt(parts[0]);
int capacity = Integer.parseInt(parts[1]);
line = scanner.nextLine().trim();
line = scanner.nextLine().trim();
line = scanner.nextLine().trim();
line = scanner.nextLine().trim();
//line = scanner.nextLine().trim();
int nrCustomers = 101;//根据客户数量进行修改
int duration;
int [] customerID = new int [nrCustomers];
int [][] coordinates = new int [nrCustomers][2];
int [] demands = new int [nrCustomers];
int [][] timeWindows = new int [nrCustomers][2];
int [] serviceTime = new int [nrCustomers];
int justy = 0;
for (int i = 0;i line = scanner.nextLine().trim();
parts = line.split("\\s+");
if (justy==0){
int cusID = Integer.parseInt(parts[0])-1;
int x_coor = (int)Double.parseDouble(parts[1]);
int y_coor = (int)Double.parseDouble(parts[2]);
int demand = (int)Double.parseDouble(parts[3]);
int start_Time =(int) Double.parseDouble(parts[4]);
int end_Time =(int) Double.parseDouble(parts[5]);
int service_Time =(int) Double.parseDouble(parts[6]);
customerID [i] = cusID;
coordinates[i][0] = x_coor;
coordinates[i][1] = y_coor;
demands[i] = demand;
timeWindows[i][0] = start_Time;
timeWindows[i][1] = end_Time;
serviceTime [i] = service_Time;
}else {
int cusID = Integer.parseInt(parts[0]);
int x_coor = Integer.parseInt(parts[1]);
int y_coor = Integer.parseInt(parts[2]);
int demand = Integer.parseInt(parts[3]);
int start_Time = Integer.parseInt(parts[4]);
int end_Time = Integer.parseInt(parts[5]);
int service_Time = Integer.parseInt(parts[6]);
customerID [i] = cusID;
coordinates[i][0] = x_coor;
coordinates[i][1] = y_coor;
demands[i] = demand;
timeWindows[i][0] = start_Time;
timeWindows[i][1] = end_Time;
serviceTime [i] = service_Time;
}
}
duration = timeWindows[0][1];
double [][] distanceMatrix = new double [nrCustomers][nrCustomers];
double [][] travelTimes = new double [nrCustomers][nrCustomers];
for (int i=0;i for (int j=0;j if (i!=j) {
if (i double x = Math.pow((coordinates[i][0] - coordinates[j][0]), 2);
double y = Math.pow((coordinates[i][1] - coordinates[j][1]), 2);
distanceMatrix[i][j] = Math.sqrt(x + y);
distanceMatrix[i][j] = (int) (distanceMatrix[i][j] * 100);
distanceMatrix[i][j] = distanceMatrix[i][j] / 100;
travelTimes[i][j] = distanceMatrix[i][j];
}else {
distanceMatrix[i][j] = distanceMatrix[j][i];
travelTimes[i][j] = travelTimes[j][i];
}
}else{
distanceMatrix[i][j] = 0;
travelTimes[i][j]