Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression

<table>Initial request,<svg height="13.45" id="M44" style="vertical-align:-1.76814pt" version="1.1" viewbox="0 0 86.287498 13.45" width="86.287498" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,11.4)"><path d="M716 28l-8 -28h-254l8 28q55 5 66 17.5t5 47.5l-30 145h-232l-74 -138q-21 -43 -11 -54.5t72 -17.5l-6 -28h-235l8 28q53 7 73.5 21t53.5 70l319 540l33 8q6 -43 33 -176l80 -381q10 -49 26.5 -63t72.5 -19zM495 281l-49 264h-2l-149 -264h200z" id="x1D434"></path></g><g transform="matrix(.017,-0,0,-.017,12.523,11.4)"><path d="M95 130q31 0 61 -30t30 -78q0 -53 -38 -87.5t-93 -51.5l-11 29q77 31 77 85q0 26 -17.5 43t-44.5 24q-4 0 -8.5 6.5t-4.5 17.5q0 18 15 30t34 12z" id="x2C"></path></g><g transform="matrix(.017,-0,0,-.017,19.22,11.4)"><path d="M594 511q0 -122 -171 -157l1 -2q158 -33 158 -159q0 -52 -34.5 -95t-90.5 -65q-76 -33 -217 -33h-223l8 28q63 5 79.5 19t26.5 72l83 426q9 48 -2.5 60t-77.5 17l6 28h259q195 0 195 -139zM499 509q0 59 -37 83t-91 24q-36 0 -51 -9q-17 -9 -22 -44l-35 -195h62
q82 0 128 37t46 104zM481 199q0 71 -48 102.5t-121 31.5h-56l-37 -201q-11 -58 7.5 -77t80.5 -19q76 0 125 44.5t49 118.5z" id="x1D435"></path></g><g transform="matrix(.017,-0,0,-.017,29.708,11.4)"><path d="M95 130q31 0 61 -30t30 -78q0 -53 -38 -87.5t-93 -51.5l-11 29q77 31 77 85q0 26 -17.5 43t-44.5 24q-4 0 -8.5 6.5t-4.5 17.5q0 18 15 30t34 12z" id="x2C"></path></g><g transform="matrix(.017,-0,0,-.017,36.423,11.4)"><path d="M682 629q-1 -16 -1.5 -72t-2.5 -86l-31 -4q-5 92 -51 129t-139 37q-100 0 -177 -49t-116 -125t-39 -162q0 -122 66 -201t182 -79q83 0 137 42.5t112 128.5l26 -15q-12 -31 -42.5 -88t-45.5 -75q-139 -27 -199 -27q-148 0 -243 81.5t-95 226.5q0 173 129.5 274.5
t325.5 101.5q114 0 204 -38z" id="x1D436"></path></g><g transform="matrix(.017,-0,0,-.017,48.407,11.4)"><path d="M95 130q31 0 61 -30t30 -78q0 -53 -38 -87.5t-93 -51.5l-11 29q77 31 77 85q0 26 -17.5 43t-44.5 24q-4 0 -8.5 6.5t-4.5 17.5q0 18 15 30t34 12z" id="x2C"></path></g><g transform="matrix(.017,-0,0,-.017,55.104,11.4)"><path d="M780 372q0 -191 -178 -297q-128 -75 -335 -75h-250l7 27q61 7 77 22t28 76l77 398q11 62 0 76.5t-77 22.5l6 28h292q164 0 258.5 -67.5t94.5 -210.5zM678 375q0 119 -73 180.5t-201 61.5q-62 0 -82 -13q-17 -7 -25 -53l-80 -427q-8 -47 -4 -62t26 -20q24 -6 80 -6
q166 0 262.5 95t96.5 244z" id="x1D437"></path></g><g transform="matrix(.017,-0,0,-.017,68.754,11.4)"><path d="M95 130q31 0 61 -30t30 -78q0 -53 -38 -87.5t-93 -51.5l-11 29q77 31 77 85q0 26 -17.5 43t-44.5 24q-4 0 -8.5 6.5t-4.5 17.5q0 18 15 30t34 12z" id="x2C"></path></g><g transform="matrix(.017,-0,0,-.017,75.469,11.4)"><path d="M609 650l-19 -162l-30 -2q2 69 -14 94q-9 18 -28.5 26t-74.5 8h-88q-30 0 -37 -6.5t-12 -36.5l-41 -212h103q48 0 69 5.5t32 19t26 50.5h29l-40 -198h-30q2 58 -11.5 70.5t-85.5 12.5h-99l-30 -167q-17 -87 3 -101q18 -15 111 -15q59 0 89 7t54 27q8 7 15.5 16t16 21.5
l14 20.5t15 23.5t13.5 21.5l29 -10q-52 -129 -71 -163h-500l6 28q66 4 83 17.5t28 73.5l77 409q11 61 -0.5 75.5t-78.5 18.5l10 28h467z" id="x1D438"></path></g>
</svg>.</table>

Journal of Applied Mathematics

fig2

Figure 2

Figure 2: Solving Dynamic Traveling Salesman Problem Using Dynamic Gaussian Process Regression 