Team,
I am exploring Neo4j Graph (GDS) solution for one of my critical problems. I want to find out the shortest route between DC and stores, where DC is connected to multiple stores and stores have multiple schedules with CutOff, Departure, and Arrival times. I need to find the shortest route based on arrival time to reach the store and promise the goods to the customer.
I am calculating the route based on the travel time (depart - arrive) as a relationship property; it calculates the shortest path but does not consider the schedule, e.g., an item can be reached the store#1(S1) by 10:50 AM with the route (DC3->S4->S1) in the below scenario, but due to travel time property it took the same route but with different timing which will reach 11:05, so I need to find a way to identify the path based on the schedule list and choose the proper schedule.
The ideal route should be : DC3 (Depart 9:00 AM, Arrive: 9:15 AM)--> S4(Depart 9:15 AM, Arrive 10:50 AM) --> S1
Appreciate your help in solving this puzzle.
Eg.
Source
Destination
Dep
Arrival
Travel Time
DC3
S4
9:00
9:15
0:15
S4
S1
9:30
11:00
1:30
DC3
S5
9:15
10:00
0:45
S5
S3
10:15
10:30
0:15
S3
S1
10:45
11:00
0:15
S2
S3
9:00
9:45
0:45
S3
S1
10:00
10:45
0:45
DC3
S5
8:45
9:15
0:30
S5
S4
9:30
10:00
0:30
S4
S1
10:15
11:05
0:50
S4
S1
9:15
10:50
1:35
DC3
S7
8:30
8:45
0:15
S7
S5
9:00
9:15
0:15
S5
S3
9:30
9:45
0:15
S3
S1
10:00
10:15
0:15
DC3
S7
8:15
8:45
0:30
S7
S5
9:00
9:15
0:15
S5
S3
9:30
9:45
0:15
S3
S1
10:00
10:15
0:15
S5
S4
9:00
9:15
0:15
S4
S1
10:15
11:05
0:50
S4
S1
9:30
10:50
1:20
DC3
S4
9:00
9:45
0:45