search

NeverOnTimeSdnBhd / Delivery-Instances

2 stars 6 forks source link

Question regarding MCTS algorithm #24

Open ASyarafuddin opened 3 years ago

ASyarafuddin commented 3 years ago

Greeting, Dr!

I notice that from the input instance you share, we may have more than 1 depot. That means, we'll confront situation which we need to choose which depot to insert into the route (e.g. no possible successor anymore for the stop).

  1. So, I'm thinking on writing a method to choose depot which have the smallest cost from the last stop (Customer) to the depot. My question is, does it affect the MCTS algorithm that the question want?

  2. As we have many depot, is it fine if we just assign any random depot when we creating new route for the tour?

Thanks for your time!

NeverOnTimeSdnBhd commented 3 years ago

Hi,

First and foremost, I am not Dr. 😅

Then regarding your problem, for basic requirement it should only have one depot, you might notice some of the sample instance have several customer with cost 0, that's a mistake as pointed out by your friends under other issue and I wanted to remove those sample but I am too busy lately, so sorry for that 😭

ASyarafuddin commented 3 years ago

I see, thanks for your time!