muto 0.1.0

An open-source vehicle routing optimization library that specializes on dynamic vehicle routing problems (DVRP)
Documentation 
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


use muto::{CostMatrix, Job, Muto, Vehicle};

fn main() {
	
	let mut muto = Muto::new();

	muto.set_cost_matrix(CostMatrix::new());

	let vehicle_a = Vehicle::new(
		1,
		0,
		0,
		(0, 50),
	);

	muto.add_vehicle(vehicle_a);

	let job_a = Job::new(1, 0, (0, 10), 0);
	muto.add_job(job_a);

	let job_b = Job::new(2, 50, (10, 20), 0);
	muto.add_job(job_b);

	let job_c = Job::new(3, 10, (20, 30), 0);
	muto.add_job(job_c);

	let job_d = Job::new(4, 1, (30, 40), 0);
	muto.add_job(job_d);

	let job_e = Job::new(5, 1, (40, 50), 0);
	muto.add_job(job_e);

	let job_f = Job::new(6, 30, (55, 80), 0);
	muto.add_job(job_f);


	let solutions = muto.solve();


	let vehicle_b = Vehicle::new(
		2,
		0,
		0,
		(0, 100),
	);

	muto.add_vehicle(vehicle_b);

	let solutions = muto.solve();

	println!("Found solutions: ");
	for solution in solutions {
		println!("solution: cost={}", solution.cost);

		for route in solution.routes.iter() {
			println!("route: vehicle_id={}, tasks={}", route.vehicle_id, route.tasks.len());

			for task in route.tasks.iter() {
				print!("{:?}\n", task);
			}
		}
	}

}