Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm

<table><svg height="15.2875" id="M55" style="vertical-align:-3.50804pt" version="1.1" viewbox="0 0 49.650002 15.2875" width="49.650002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.862)"><path d="M412 140l28 -9q0 -2 -35 -131h-373v23q112 112 161 170q59 70 92 127t33 115q0 63 -31 98t-86 35q-75 0 -137 -93l-22 20l57 81q55 59 135 59q69 0 118.5 -46.5t49.5 -122.5q0 -62 -29.5 -114t-102.5 -130l-141 -149h186q42 0 58.5 10.5t38.5 56.5z" id="x32"></path></g><g transform="matrix(.017,-0,0,-.017,11.996,10.862)"><path d="M535 230h-483v50h483v-50z" id="x2212"></path></g><g transform="matrix(.017,-0,0,-.017,25.748,10.862)"><path d="M445 282q0 -64 -27.5 -125t-80.5 -104q-80 -65 -168 -65q-73 0 -109.5 46.5t-36.5 116.5q0 92 46.5 163t119.5 104q66 30 108 30q67 0 107.5 -43.5t40.5 -122.5zM355 280q0 62 -26.5 94.5t-64.5 32.5q-26 0 -44 -8q-39 -18 -74 -82t-35 -163q0 -57 25.5 -90.5t70.5 -33.5
q22 0 36 6q46 20 79 89t33 155z" id="x1D45C"></path></g><g transform="matrix(.017,-0,0,-.017,33.703,10.862)"><path d="M570 304q0 -108 -87 -199q-40 -42 -94.5 -74t-105.5 -43q-41 0 -65 11l-29 -141q-9 -45 -1.5 -58t45.5 -16l26 -2l-5 -29l-241 -10l4 26q51 10 67.5 24t26.5 60l113 520q-54 -20 -89 -41l-7 26q38 28 105 53l11 49q20 25 77 58l8 -7l-17 -77q39 14 102 14q82 0 119 -36
t37 -108zM482 289q0 114 -113 114q-26 0 -66 -7l-70 -327q12 -14 32 -25t39 -11q59 0 118.5 81.5t59.5 174.5z" id="x1D45D"></path></g><g transform="matrix(.017,-0,0,-.017,43.783,10.862)"><path d="M324 430l-26 -36l-112 -4l-55 -265q-13 -66 7 -66q13 0 44.5 20t50.5 40l17 -24q-38 -40 -85.5 -73.5t-87.5 -33.5q-50 0 -21 138l55 262h-80l-2 8l25 34h66l25 99l78 63l10 -9l-37 -153h128z" id="x1D461"></path></g>
</svg> and <svg height="15.2875" id="M56" style="vertical-align:-3.50804pt" version="1.1" viewbox="0 0 49.650002 15.2875" width="49.650002" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.862)"><path d="M285 378v-2q65 -13 102 -54.5t37 -97.5q0 -57 -30.5 -104.5t-74 -75t-85.5 -42t-72 -14.5q-31 0 -59.5 11t-40.5 23q-19 18 -16 36q1 16 23 33q13 10 24 0q58 -51 124 -51q55 0 88 40t33 112q0 64 -39 96.5t-88 32.5q-29 0 -64 -11l-6 29q77 25 118 57.5t41 84.5
q0 45 -26.5 69.5t-68.5 24.5q-67 0 -120 -79l-20 20l43 63q51 56 127 56h1q66 0 107 -37t41 -95q0 -42 -31 -71q-22 -23 -68 -54z" id="x33"></path></g><g transform="matrix(.017,-0,0,-.017,11.996,10.862)"><path d="M535 230h-483v50h483v-50z" id="x2212"></path></g><g transform="matrix(.017,-0,0,-.017,25.748,10.862)"><path d="M445 282q0 -64 -27.5 -125t-80.5 -104q-80 -65 -168 -65q-73 0 -109.5 46.5t-36.5 116.5q0 92 46.5 163t119.5 104q66 30 108 30q67 0 107.5 -43.5t40.5 -122.5zM355 280q0 62 -26.5 94.5t-64.5 32.5q-26 0 -44 -8q-39 -18 -74 -82t-35 -163q0 -57 25.5 -90.5t70.5 -33.5
q22 0 36 6q46 20 79 89t33 155z" id="x1D45C"></path></g><g transform="matrix(.017,-0,0,-.017,33.703,10.862)"><path d="M570 304q0 -108 -87 -199q-40 -42 -94.5 -74t-105.5 -43q-41 0 -65 11l-29 -141q-9 -45 -1.5 -58t45.5 -16l26 -2l-5 -29l-241 -10l4 26q51 10 67.5 24t26.5 60l113 520q-54 -20 -89 -41l-7 26q38 28 105 53l11 49q20 25 77 58l8 -7l-17 -77q39 14 102 14q82 0 119 -36
t37 -108zM482 289q0 114 -113 114q-26 0 -66 -7l-70 -327q12 -14 32 -25t39 -11q59 0 118.5 81.5t59.5 174.5z" id="x1D45D"></path></g><g transform="matrix(.017,-0,0,-.017,43.783,10.862)"><path d="M324 430l-26 -36l-112 -4l-55 -265q-13 -66 7 -66q13 0 44.5 20t50.5 40l17 -24q-38 -40 -85.5 -73.5t-87.5 -33.5q-50 0 -21 138l55 262h-80l-2 8l25 34h66l25 99l78 63l10 -9l-37 -153h128z" id="x1D461"></path></g>
</svg> strategy.</table>

Journal of Applied Mathematics

fig4

Figure 4

Figure 4: Dynamic Vehicle Routing Using an Improved Variable Neighborhood Search Algorithm 