You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In the E-VRPTW, a set of customers must be served by a fleet of battery electric
12
11
vehicles (BEV). The E-VRPTW extends the well-know [VRPTW](https://en.wikipedia.org/wiki/Vehicle_routing_problem),
@@ -20,7 +19,7 @@ More formal, the EVRPTW is defined on a complete directed graph G = (V,A)
20
19
consisting of a set of depot, customer, and recharging station nodes and a set of edges.
21
20
Each edge _(i, j)_ has a distance _d<sub>ij</sub>_ and a travel time _t<sub>ij</sub>_ associated and each traveled
22
21
edge consumes the amount of _r_ x _d<sub>ij</sub>_ of the remaining battery charge of the vehicle,
23
-
where _h_ denotes the constant charge consumption rate. Furthermore, a set of homogeneous
22
+
where _r_ denotes the constant charge consumption rate. Furthermore, a set of homogeneous
24
23
vehicles is given, where each vehicle has a maximal capacity of _C_ and is located, full
25
24
loaded at the depot. Each node has a positive demand _q<sub>i</sub>_, a service time _s<sub>i</sub>_ and a time
26
25
window [_e<sub>i</sub>_, _l<sub>i</sub>_ ] assigned. The service must start within the given time window (thus,
@@ -34,13 +33,31 @@ served within their given time window. All routes must begin and end in the depo
34
33
the vehicle capacity and battery capacity must be respected. The objective function is
35
34
to minimize the total traveled distance.
36
35
36
+
## Implementation Details
37
+
38
+
Our E-VRPTW Solver consists of two parts:
39
+
1. Construction heuristic: [Time-Oriented, Nearest-Neighbor Heuristic](https://pubsonline.informs.org/doi/abs/10.1287/opre.35.2.254?journalCode=opre) (Solomon 1987)
40
+
2. Metaheuristic: For this part, we tried to implement a Hybrid VNS/TS metaheuristic proposed in the paper [The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations](https://pubsonline.informs.org/doi/10.1287/trsc.2013.0490),
41
+
however our solution is not the most efficient one and requires further optimizations (especially in route representation)
42
+
43
+
Model objects like `EVRPTWInstance`, `Customer`, `Node` have been copied from the [E-VRPTW Solution Verifier (Java)](https://github.com/ghiermann/evrptw-verifier) implemented by @ghiermann.
44
+
45
+
See our [presentation slides](https://docs.google.com/presentation/d/1WnySkapfZkM57kC_8XTIKsyNZOhBhiNAdNTUWY201tQ/edit?usp=sharing) for more details.
46
+
37
47
## Usage
38
48
39
-
// to be written
49
+
See Main.kt for instance/plotting/performance-recording customizations.
50
+
40
51
41
52
## Contributions
42
53
Special thanks to my dear friend and colleague [David Molnar](https://github.com/dmolnar99)
43
-
for participating in this project.
54
+
for participating in this project:
55
+
56
+
<!-- ALL-CONTRIBUTORS-LIST:START - Do not remove or modify this section -->
57
+
<!-- prettier-ignore -->
58
+
|[<imgsrc="https://avatars3.githubusercontent.com/u/16260193?s=400&v=4"width="100px;"/><br /><sub><b>David Molnar</b></sub>](https://github.com/dmolnar99)<br />[🤔](#ideas"Ideas and Planning")[💻](https://github.com/fuvidani/clickbait-defeater/commits?author=dmolnar99"Code")[⚠️](https://github.com/fuvidani/clickbait-defeater/commits?author=dmolnar99"Tests")|
59
+
| :---: |
60
+
<!-- ALL-CONTRIBUTORS-LIST:END -->
44
61
45
62
## License
46
63
This project is licensed under the [MIT License](https://opensource.org/licenses/MIT). Feel free to
0 commit comments