search

NeverOnTimeSdnBhd / Delivery-Instances

2 stars 6 forks source link

Question with extra features algo #17

Open Afiq1j opened 3 years ago

Afiq1j commented 3 years ago

For extra feature, we implement the Best First Algo. Conceptual wise Best first means simply exploring the nodes which look closest to the goal. In our case (Assignment) , it mean the distance between a customer and the depot right (goal). Since the distance between customers is ady used in Greedy simulation, so for Best First Simulation the next node should always be the closest remaining customer from depot right?

Is our implementation correct? Thank you for answering

NeverOnTimeSdnBhd commented 3 years ago

Hi

For me its like if you can justify your implementation on other searching algorithm and persuade me that the algorithm you implemented is different from what is inside basic requirement I would accept it and I believe most of your lecturers have the same thought. The implementation is acceptable as long as you can justify it so no need worry too much.