great explanation!

Another great presentation from you :)

@LuisRIzquierdo

2 жыл бұрын

Thanks! :D

Hi professor Luis, great explanation, thanks. I am trying to solve the VRP problem but I am a litle bit confuse about the Neighborhood Structure for this problem, I found a lot papers that recommend to use CROSS-exchange, 2-opt* or Swap operators in order to do inter-route moves do you know any paper about these Neighborhoods Structure performance ? I have another question, if I use an X operator to generate the Neighborhood given a solution, the Neighborhood size for that solution is equal to all posible moves that I can perform with that operator? For the VRP problem, should I combinate all the routes with all customers with that operator can perform ?. Again thank you so much for your classes.

@LuisRIzquierdo

2 жыл бұрын

Hi Miguel, thanks a lot for your comment and your questions. I'm afraid I'm not an expert on the VRP. You may find this paper useful: dx.doi.org/10.1016/j.ejor.2013.09.045 . As for the meaning of "neighborhood size", it is the number of neighbors you generate with the algorithm you are using, whatever that algorithm may be (i.e. combining or not combining). If you choose to combine, you will get a certain neighborhood size, which will be different from the neighborhood size you would get if you choose not to combine. I am sorry I cannot be of greater help :(

@Miguel-ym2rr

2 жыл бұрын

​@@LuisRIzquierdo Thank you so much, I am going to take a look the paper. Don't worry your videos are so helpful about Metaheuristics.

Hi professor Luis! Do you have any course on Metaheuristics available in Udemy or any other platform? I really like the clearness of your classes.

@LuisRIzquierdo

2 жыл бұрын

I am sorry I do not, but thanks a lot for your comment, which made my day! :D

@Snowmanver2

2 жыл бұрын

@@LuisRIzquierdo your lectures are truly fantastic!

@LuisRIzquierdo

2 жыл бұрын

@@Snowmanver2 You're too kind :D Thank you so much for your extremely nice comments An!