Electric Vehicle Routing Problem with Charging Time and Variable Travel Time

Pseudocode 1

Pseudocode of dynamic Dijkstra algorithm.

 []=Dijkstra(Graph, , , ):

  create node set

  For each node in Graph:

    Infinity

    Undefined

   add to

  End for

   0

  While is not empty:

    node in with min

   remove from

   If is defined

     output of Eq. (1) with

   End if

   For each neighbor of :

     output of Eq. (1) with

    If < :

   End if

  End for

 End while

 return ,

  empty sequence

 While is defined:

  insert at the beginning of

 End while

 insert at the beginning of