Question: [Dynamic Pick-up and Delivery Problem with Time Windows - Best Route Suggestion Unit] I am writing a best route suggestion system for package delivery APP.

[Dynamic Pick-up and Delivery Problem with Time Windows - Best Route Suggestion Unit]

I am writing a best route suggestion system for package delivery APP. It requires Kotlin/JAVA to finish the code.

Requirements: Generate a best route through all delivery jobs, which need to meet the time windows of the jobs.

Input: Maximum of 5 locations (longitude and latitude) and time windows (Pickup time and delivery time). i.e., 1. Pickup Tuen Mun, Hong Kong (LONG, LAT), Pickup before 10:00 am and Deliver Yuen Long, Hong Kong (LONG, LAT), delivered before 5:00 pm 2. Etc 3. Etc

Output:

Route: current location -> 1 Pick -> 2 Pick -> 1 Deliver -> Etc

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!