-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathvehicle_routing_with_time_windows_main.cpp
More file actions
243 lines (208 loc) · 8.19 KB
/
vehicle_routing_with_time_windows_main.cpp
File metadata and controls
243 lines (208 loc) · 8.19 KB
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
/**
* Vehicle routing problem with time windows
*
* Problem description:
* See https://github.com/fontanf/orproblems/blob/main/orproblems/vehicle_routing_with_time_windows.hpp
*
*/
#include "read_args.hpp"
#include "localsearchsolver/sequencing.hpp"
#include "orproblems/routing/vehicle_routing_with_time_windows.hpp"
using namespace localsearchsolver;
using namespace orproblems::vehicle_routing_with_time_windows;
class SequencingScheme
{
public:
static sequencing::Parameters sequencing_parameters()
{
sequencing::Parameters parameters;
parameters.shift_block_maximum_length = 2;
parameters.swap_block_maximum_length = 2;
parameters.reverse = true;
parameters.shift_reverse_block_maximum_length = 2;
parameters.inter_shift_block_maximum_length = 2;
parameters.inter_shift_reverse_block_maximum_length = 2;
parameters.inter_swap_block_maximum_length = 2;
parameters.swap_tails = true;
//parameters.inter_swap_star = true;
parameters.ruin_and_recreate_number_of_perturbations = 128;
parameters.ruin_number_of_elements_removed = 10;
parameters.ruin_adjacent_string_removal_weight = 1.0;
parameters.recreate_best_weight = 1.0;
parameters.selective_route_exchange_crossover_1_weight = 1.0;
return parameters;
}
/**
* Global cost:
* - Reversed time
* - Overcapacity
* - Total travel time
*/
using GlobalCost = std::tuple<Time, Demand, Time>;
struct SequenceData
{
sequencing::ElementId element_id_first = -1;
sequencing::ElementId element_id_last = -1;
Demand demand = 0;
Time duration = 0;
Time earliest_start = 0;
Time latest_start = 0;
Time reversed_time = 0;
Time total_travel_time = 0; // Without depot -> element_id_first.
};
SequencingScheme(const Instance& instance): instance_(instance) { }
inline sequencing::SequencePos number_of_sequences() const { return instance_.number_of_vehicles(); }
inline sequencing::ElementPos number_of_elements() const
{
// -1 since we don't schedule the depot.
return instance_.number_of_locations() - 1;
}
inline double distance(
sequencing::ElementId element_id_1,
sequencing::ElementId element_id_2) const
{
Time r1 = instance_.location(element_id_1 + 1).release_date;
Time d1 = instance_.location(element_id_1 + 1).deadline;
Time s1 = instance_.location(element_id_1 + 1).service_time;
Time r2 = instance_.location(element_id_2 + 1).release_date;
Time d2 = instance_.location(element_id_2 + 1).deadline;
Time t12 = instance_.travel_time(element_id_1 + 1, element_id_2 + 1);
Time wt = r2 - (d1 + t12 + s1);
Time tw = (r1 + s1 + t12) - d2;
return (double)t12 + 1 * std::max((Time)0, wt) + 0.2 * std::max((Time)0, tw);
}
inline GlobalCost global_cost(const SequenceData& sequence_data) const
{
if (sequence_data.element_id_first == -1)
return {0, 0, 0};
SequenceData sd = sequence_data_init(-1);
concatenate(sd, sequence_data);
concatenate(sd, sequence_data_init(-1));
return {
sd.reversed_time,
std::max((Demand)0, sequence_data.demand - instance_.capacity()),
sd.total_travel_time,
};
}
inline GlobalCost global_cost_goal(double value) const
{
return {
0,
0,
value,
};
}
inline GlobalCost bound(const SequenceData& sequence_data) const
{
return {
sequence_data.reversed_time,
std::max((Demand)0, sequence_data.demand - instance_.capacity()),
sequence_data.total_travel_time
+ instance_.travel_time(0, sequence_data.element_id_first + 1),
};
}
inline SequenceData sequence_data_init(
sequencing::ElementId element_id) const
{
SequenceData sequence_data;
// Uppdate element_id_first.
sequence_data.element_id_first = element_id;
// Update time windows.
sequence_data.duration = instance_.location(element_id + 1).service_time;
sequence_data.earliest_start = instance_.location(element_id + 1).release_date;
sequence_data.latest_start = instance_.location(element_id + 1).deadline;
// Update demand.
sequence_data.demand += instance_.location(element_id + 1).demand;
// Update element_id_last.
sequence_data.element_id_last = element_id;
return sequence_data;
}
inline bool concatenate(
SequenceData& sequence_data,
const SequenceData& sequence_data_2) const
{
Time tij = instance_.travel_time(
sequence_data.element_id_last + 1,
sequence_data_2.element_id_first + 1);
// Update time windows.
Time delta = sequence_data.duration - sequence_data.reversed_time + tij;
Time delta_wt = std::max(sequence_data_2.earliest_start - delta - sequence_data.latest_start, (Time)0);
Time delta_tw = std::max(sequence_data.earliest_start + delta - sequence_data_2.latest_start, (Time)0);
sequence_data.duration += sequence_data_2.duration + tij + delta_wt;
sequence_data.earliest_start = std::max(
sequence_data_2.earliest_start - delta,
sequence_data.earliest_start) - delta_wt;
sequence_data.latest_start = std::min(
sequence_data_2.latest_start - delta,
sequence_data.latest_start) + delta_tw;
sequence_data.reversed_time += sequence_data_2.reversed_time + delta_tw;
// Update total_completion_time.
sequence_data.total_travel_time += tij + sequence_data_2.total_travel_time;
// Update demand.
sequence_data.demand += sequence_data_2.demand;
// Update element_id_last.
sequence_data.element_id_last = sequence_data_2.element_id_last;
return true;
}
void instance_format(
std::ostream& os,
int verbosity_level) const
{
os << "Vehicle routing problem with time windows" << std::endl;
instance_.format(os, verbosity_level);
}
private:
/** Instance. */
const Instance& instance_;
};
int main(int argc, char *argv[])
{
// Create command line options.
boost::program_options::options_description desc = setup_args();
boost::program_options::variables_map vm;
boost::program_options::store(boost::program_options::parse_command_line(argc, argv, desc), vm);
if (vm.count("help")) {
std::cout << desc << std::endl;;
throw "";
}
try {
boost::program_options::notify(vm);
} catch (const boost::program_options::required_option& e) {
std::cout << desc << std::endl;;
throw "";
}
// Create instance.
InstanceBuilder instance_builder;
instance_builder.read(
vm["input"].as<std::string>(),
vm["format"].as<std::string>());
const Instance instance = instance_builder.build();
// Create local scheme.
SequencingScheme sequencing_scheme(instance);
auto sequencing_parameters = read_sequencing_args<SequencingScheme>(vm);
sequencing::LocalScheme<SequencingScheme> local_scheme(
sequencing_scheme,
sequencing_parameters);
// Run algorithm.
std::string algorithm = vm["algorithm"].as<std::string>();
auto output =
(algorithm == "multi-start-local-search")?
run_multi_start_local_search(local_scheme, vm):
(algorithm == "iterated-local-search")?
run_iterated_local_search(local_scheme, vm):
(algorithm == "best-first-local-search")?
run_best_first_local_search(local_scheme, vm):
run_genetic_local_search(local_scheme, vm);
// Run checker.
if (vm["print-checker"].as<int>() > 0
&& vm["certificate"].as<std::string>() != "") {
std::cout << std::endl
<< "Checker" << std::endl
<< "-------" << std::endl;
instance.check(
vm["certificate"].as<std::string>(),
std::cout,
vm["print-checker"].as<int>());
}
return 0;
}