Conventionally, vehicle routing problems are defined on a network in which the customer locations and arcs are given. Typically, these arcs somehow represent the distances or expected travel time derived from the underlying road network. When executed, the quality of …
© 2017 Growing Science Ltd. All rights reserved.This article paper presents a hybrid metaheuristic algorithm to solve the time-dependent vehicle routing problem with hard time windows. Time-dependent travel times are influenced by different congestion levels experienced throughout the day. Vehicle …
This paper introduces the stochastic time-dependent orienteering problem with time windows. The orienteering problem occurs in logistic situations where an optimal combination of locations must first be selected and then the routing between these selected locations must be optimized. In …