PRE2019 3 Group16: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 1: | Line 1: | ||
== Group Members == | |||
{| | {| | ||
!Name | !Name | ||
| Line 19: | Line 18: | ||
|} | |} | ||
== 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. | 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 == | |||
Revision as of 13:14, 12 February 2020
Group Members
| Name | Student Number | Study | |
|---|---|---|---|
| Zakaria Ameziane | 1005559 | CS | z.ameziane@student.tue.nl |
| Cahitcan Uzman | |||
| Efe Utku | |||
| Roel den Hoet | |||
| Venislav |
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.