1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16#include <cstdint>

17#include <cstdlib>

18#include <sstream>

19#include <vector>

20

21#include "google/protobuf/duration.pb.h"

28

29

31

32struct DataModel {

33 const std::vector<std::vector<int64_t>> distance_matrix{

34 {0, 548, 776, 696, 582, 274, 502, 194, 308, 194, 536, 502, 388, 354, 468,

35 776, 662},

36 {548, 0, 684, 308, 194, 502, 730, 354, 696, 742, 1084, 594, 480, 674,

37 1016, 868, 1210},

38 {776, 684, 0, 992, 878, 502, 274, 810, 468, 742, 400, 1278, 1164, 1130,

39 788, 1552, 754},

40 {696, 308, 992, 0, 114, 650, 878, 502, 844, 890, 1232, 514, 628, 822,

41 1164, 560, 1358},

42 {582, 194, 878, 114, 0, 536, 764, 388, 730, 776, 1118, 400, 514, 708,

43 1050, 674, 1244},

44 {274, 502, 502, 650, 536, 0, 228, 308, 194, 240, 582, 776, 662, 628, 514,

45 1050, 708},

46 {502, 730, 274, 878, 764, 228, 0, 536, 194, 468, 354, 1004, 890, 856, 514,

47 1278, 480},

48 {194, 354, 810, 502, 388, 308, 536, 0, 342, 388, 730, 468, 354, 320, 662,

49 742, 856},

50 {308, 696, 468, 844, 730, 194, 194, 342, 0, 274, 388, 810, 696, 662, 320,

51 1084, 514},

52 {194, 742, 742, 890, 776, 240, 468, 388, 274, 0, 342, 536, 422, 388, 274,

53 810, 468},

54 {536, 1084, 400, 1232, 1118, 582, 354, 730, 388, 342, 0, 878, 764, 730,

55 388, 1152, 354},

56 {502, 594, 1278, 514, 400, 776, 1004, 468, 810, 536, 878, 0, 114, 308,

57 650, 274, 844},

58 {388, 480, 1164, 628, 514, 662, 890, 354, 696, 422, 764, 114, 0, 194, 536,

59 388, 730},

60 {354, 674, 1130, 822, 708, 628, 856, 320, 662, 388, 730, 308, 194, 0, 342,

61 422, 536},

62 {468, 1016, 788, 1164, 1050, 514, 514, 662, 320, 274, 388, 650, 536, 342,

63 0, 764, 194},

64 {776, 868, 1552, 560, 674, 1050, 1278, 742, 1084, 810, 1152, 274, 388,

65 422, 764, 0, 798},

66 {662, 1210, 754, 1358, 1244, 708, 480, 856, 514, 468, 354, 844, 730, 536,

67 194, 798, 0},

68 };

69

70 const std::vector<int64_t> demands{

71 0, 1, 1, 2, 4, 2, 4, 8, 8, 1, 2, 1, 2, 4, 4, 8, 8,

72 };

73 const std::vector<int64_t> vehicle_capacities{15, 15, 15, 15};

74

75 const int num_vehicles = 4;

76 const RoutingIndexManager::NodeIndex depot{0};

77};

78

79

80

86void PrintSolution(const DataModel& data, const RoutingIndexManager& manager,

87 const RoutingModel& routing, const Assignment& solution) {

88 int64_t total_distance = 0;

89 int64_t total_load = 0;

90 for (int vehicle_id = 0; vehicle_id < data.num_vehicles; ++vehicle_id) {

91 if (!routing.IsVehicleUsed(solution, vehicle_id)) {

92 continue;

93 }

94 int64_t index = routing.Start(vehicle_id);

95 LOG(INFO) << "Route for Vehicle " << vehicle_id << ":";

96 int64_t route_distance = 0;

97 int64_t route_load = 0;

98 std::stringstream route;

99 while (!routing.IsEnd(index)) {

100 const int node_index = manager.IndexToNode(index).value();

101 route_load += data.demands[node_index];

102 route << node_index << " Load(" << route_load << ") -> ";

103 const int64_t previous_index = index;

104 index = solution.Value(routing.NextVar(index));

105 route_distance += routing.GetArcCostForVehicle(previous_index, index,

106 int64_t{vehicle_id});

107 }

108 LOG(INFO) << route.str() << manager.IndexToNode(index).value();

109 LOG(INFO) << "Distance of the route: " << route_distance << "m";

110 LOG(INFO) << "Load of the route: " << route_load;

111 total_distance += route_distance;

112 total_load += route_load;

113 }

114 LOG(INFO) << "Total distance of all routes: " << total_distance << "m";

115 LOG(INFO) << "Total load of all routes: " << total_load;

116 LOG(INFO) << "";

117 LOG(INFO) << "Advanced usage:";

118 LOG(INFO) << "Problem solved in " << routing.solver()->wall_time() << "ms";

119}

120

121

122void VrpCapacity() {

123

124

125 DataModel data;

126

127

128

129

130 RoutingIndexManager manager(data.distance_matrix.size(), data.num_vehicles,

131 data.depot);

132

133

134

135

136 RoutingModel routing(manager);

137

138

139

140

141 const int transit_callback_index = routing.RegisterTransitCallback(

142 [&data, &manager](const int64_t from_index,

143 const int64_t to_index) -> int64_t {

144

145 const int from_node = manager.IndexToNode(from_index).value();

146 const int to_node = manager.IndexToNode(to_index).value();

147 return data.distance_matrix[from_node][to_node];

148 });

149

150

151

152

153 routing.SetArcCostEvaluatorOfAllVehicles(transit_callback_index);

154

155

156

157

158 const int demand_callback_index = routing.RegisterUnaryTransitCallback(

159 [&data, &manager](const int64_t from_index) -> int64_t {

160

161 const int from_node = manager.IndexToNode(from_index).value();

162 return data.demands[from_node];

163 });

164 routing.AddDimensionWithVehicleCapacity(

165 demand_callback_index,

166 int64_t{0},

167 data.vehicle_capacities,

168 true,

169 "Capacity");

170

171

172

173

175 search_parameters.set_first_solution_strategy(

177 search_parameters.set_local_search_metaheuristic(

179 search_parameters.mutable_time_limit()->set_seconds(1);

180

181

182

183

184 const Assignment* solution = routing.SolveWithParameters(search_parameters);

185

186

187

188

189 PrintSolution(data, manager, routing, *solution);

190

191}

192}

193

194int main(int , char* []) {

195 operations_research::VrpCapacity();

196 return EXIT_SUCCESS;

197}

198