Research Article
A Modified Harmony Search Algorithm for Solving the Dynamic Vehicle Routing Problem with Time Windows
initialize all parameters: HMS, HMCR, PAR, NI, | update the location of each vehicle in at time use eq. (15). | remove the unvisited customers from and inset into . | for (; ; ++) do // HM initialization | initialize a solution randomly | if then | | end if | end for | repeat | improvising a new solution | if is infeasible then | repair the solution | end if | VND | if is better than the worst HM member then | replace the worst HM member with . // HM update | end if | if then | | end if | compute the population entropy // entropy evaluation | if (the population entropy increase or remain constant) then | remove the highest frequency of harmonies | re-generates new harmonies | end if | until a preset termination criterion is met. //checking termination criterion | return . |
|