A multi-shift vehicle routing problem with windows and cycle times

摘要: In many applications of the vehicle routing problem with time windows (VRPTW), goods must be picked up within desired frames. addition, they have some limitations on their arrival to central depot. this paper, we present a new version VRPTW that minimizes total cycle goods. order meet and also minimize time, courier’s schedule is allowed vary. An algorithm, named VeRSA, proposed solve problem. VeRSA employs concepts scheduling theorems algorithms determine feasible routes schedules available couriers. We prove theoretical lower bound provides useful optimality gap. conduct set numerical experiments. obtains solution faster than solving MIP. The gap using our smaller found standard LP relaxation.