A Three-Stage Saving-Based Heuristic for Vehicle Routing Problem with Time Windows and Stochastic Travel Times

<div>An illustration of advancing <svg height="12.5794pt" id="M82" style="vertical-align:-3.29107pt" version="1.1" viewbox="-0.0498162 -9.28833 11.0498 12.5794" width="11.0498pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M238 681C243 705 239 712 230 712C217 712 156 682 75 674L70 648H105C148 648 153 641 144 598L39 110C18 11 35 -12 55 -12C90 -12 166 36 221 103L205 125C174 93 130 65 118 65C112 65 108 68 114 96L238 681Z" id="g113-109"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="269" vert-adv-y="269"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,3.498,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z" id="g113-117"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="341" vert-adv-y="341"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,7.866,3.132)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z" id="g50-106"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="280" vert-adv-y="280"></glyph.data></g></svg> to <svg height="15.3797pt" id="M83" style="vertical-align:-3.9436pt" version="1.1" viewbox="-0.0498162 -11.4361 11.8549 15.3797" width="11.8549pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M238 681C243 705 239 712 230 712C217 712 156 682 75 674L70 648H105C148 648 153 641 144 598L39 110C18 11 35 -12 55 -12C90 -12 166 36 221 103L205 125C174 93 130 65 118 65C112 65 108 68 114 96L238 681Z" id="g113-109"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="269" vert-adv-y="269"></glyph.data></g><g transform="matrix(.013,0,0,-0.013,3.498,0)"><path d="M324 430H196L233 583L223 592L145 529L120 430H54L29 396L31 388H111L56 126C33 15 54 -12 77 -12C137 -12 214 57 250 95L233 119C208 92 155 59 138 59C126 59 120 70 131 125L186 390L298 394L324 430Z" id="g113-117"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="341" vert-adv-y="341"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,7.931,-5.741)"><path d="M310 541L304 571C290 586 211 619 185 610L80 76L131 52L310 541Z" id="g50-31"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="361" vert-adv-y="361"></glyph.data></g><g transform="matrix(.0091,0,0,-0.0091,7.866,3.784)"><path d="M250 606C250 634 233 656 203 656C168 656 146 618 146 593C146 564 169 545 192 545C227 545 250 573 250 606ZM227 95L212 119C187 98 152 71 135 71C129 71 128 78 134 102L207 373C219 418 217 451 194 451C165 451 92 411 30 351L44 326C77 353 106 371 114 371C124 371 121 357 117 341L55 97C32 5 46 -12 70 -12C108 -12 191 51 227 95Z" id="g50-106"></path><glyph.data ascent="3443" descent="-2856" horiz-adv-x="280" vert-adv-y="280"></glyph.data></g></svg> for customer <svg height="8.8423pt" id="M84" style="vertical-align:-0.2064009pt" version="1.1" viewbox="-0.0498162 -8.6359 3.66193 8.8423" width="3.66193pt" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M244 607C244 633 228 655 200 655C166 655 146 618 146 594C146 564 166 546 191 546C221 546 244 574 244 607ZM222 91L209 114C184 94 148 66 133 66C127 66 124 73 130 96L201 370C213 416 211 448 191 448C162 448 88 407 29 352L42 328C73 354 104 371 114 371C120 371 119 365 115 345L53 92C32 5 45 -12 68 -12C103 -12 186 50 222 91Z" id="g113-106"></path><glyph.data ascent="3473" descent="-2876" horiz-adv-x="273" vert-adv-y="273"></glyph.data></g></svg>.</div>

Discrete Dynamics in Nature and Society

fig1

Figure 1

Figure 1: A Three-Stage Saving-Based Heuristic for Vehicle Routing Problem with Time Windows and Stochastic Travel Times 