PRE2019 3 Group16: Difference between revisions
| Line 31: | Line 31: | ||
==Deliverables == | ==Deliverables == | ||
1. Implementation of one or more algorithms that work with the Li & Lim benchmark instances and produce valid solutions such that the number of vehicles is minimized and then the total distance is minimized as much as possible. | |||
2. Wiki page that contains all the information about our project including the results of running the algorithm(s) on all instances from the Li & Lim benchmark and a comparison with the current records. | |||
3. Final presentation that will explain our project and results. | |||
Revision as of 17:56, 12 February 2020
Group Members
| Name | Student Number | Study | |
|---|---|---|---|
| Zakaria Ameziane | 1005559 | Computer Science | z.ameziane@student.tue.nl |
| Cahitcan Uzman | 1284304 | Computer Science | c.uzman@student.tue.nl |
| Efe Utku | |||
| Roel den Hoet | |||
| Venislav Varbanov | 1284401 | Computer Science | v.varbanov@student.tue.nl |
Subject
What/How (AI) algorithms can be used by future self driving delivery cars to efficiently solve the pickup-and-delivery problem with time-windows, where a fleet of delivery vehicles must collect and deliver items according to the demand of customers and their opening hours. The objectives are to minimize the fleet size and to assign a sequence of customers to each truck of the fleet minimizing the total distance traveled.
Objectives
Users
Approach
Milestones
Deliverables
1. Implementation of one or more algorithms that work with the Li & Lim benchmark instances and produce valid solutions such that the number of vehicles is minimized and then the total distance is minimized as much as possible. 2. Wiki page that contains all the information about our project including the results of running the algorithm(s) on all instances from the Li & Lim benchmark and a comparison with the current records. 3. Final presentation that will explain our project and results.