-
Notifications
You must be signed in to change notification settings - Fork 0
/
index.html
64 lines (51 loc) · 2.99 KB
/
index.html
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
<!DOCTYPE html>
<html>
<head>
<meta charset='utf-8'>
<meta http-equiv="X-UA-Compatible" content="chrome=1">
<meta name="viewport" content="width=device-width, initial-scale=1, maximum-scale=1">
<link href='https://fonts.googleapis.com/css?family=Architects+Daughter' rel='stylesheet' type='text/css'>
<link rel="stylesheet" type="text/css" href="stylesheets/stylesheet.css" media="screen">
<link rel="stylesheet" type="text/css" href="stylesheets/github-light.css" media="screen">
<link rel="stylesheet" type="text/css" href="stylesheets/print.css" media="print">
<!--[if lt IE 9]>
<script src="//html5shiv.googlecode.com/svn/trunk/html5.js"></script>
<![endif]-->
<title>Multiple-vehicle-routing-mvrp by AnanyaKirti</title>
</head>
<body>
<header>
<div class="inner">
<h1>Multiple-vehicle-routing-mvrp</h1>
<h2>multiple Vehicle Routing using Cluster First, Route Second Paradigm.</h2>
<a href="https://github.com/AnanyaKirti/Multiple-Vehicle-Routing-mVRP" class="button"><small>View project on</small> GitHub</a>
</div>
</header>
<div id="content-wrapper">
<div class="inner clearfix">
<section id="main-content">
<h3>
<a id="mvrp-multiple-vehicle-routing-algorithm" class="anchor" href="#mvrp-multiple-vehicle-routing-algorithm" aria-hidden="true"><span aria-hidden="true" class="octicon octicon-link"></span></a>mVRP Multiple Vehicle Routing Algorithm</h3>
<p>This is an implementation of multiple Vehicle Routing using Cluster First, Route Second Paradigm.</p>
<h3>
<a id="how-does-it-work" class="anchor" href="#how-does-it-work" aria-hidden="true"><span aria-hidden="true" class="octicon octicon-link"></span></a>How does it work?</h3>
<p>We have used K-Means clustering followed by simulated annealing on each of the clusters. The technique offers a good combination of speed and accuracy. The original problem is an NP Hard problem, and hence no good direct method exists to solve the problem.</p>
<h4>
<a id="ananya-kirti" class="anchor" href="#ananya-kirti" aria-hidden="true"><span aria-hidden="true" class="octicon octicon-link"></span></a>©Ananya Kirti</h4>
</section>
<aside id="sidebar">
<a href="https://github.com/AnanyaKirti/Multiple-Vehicle-Routing-mVRP/zipball/master" class="button">
<small>Download</small>
.zip file
</a>
<a href="https://github.com/AnanyaKirti/Multiple-Vehicle-Routing-mVRP/tarball/master" class="button">
<small>Download</small>
.tar.gz file
</a>
<p class="repo-owner"><a href="https://github.com/AnanyaKirti/Multiple-Vehicle-Routing-mVRP"></a> is maintained by <a href="https://github.com/AnanyaKirti">AnanyaKirti</a>.</p>
<p>This page was generated by <a href="https://pages.github.com">GitHub Pages</a> using the Architect theme by <a href="https://twitter.com/jasonlong">Jason Long</a>.</p>
</aside>
</div>
</div>
</body>
</html>