Abstract
ABSTRACT This study relaxes the typical assumption made in traditional research of the vehicle routing problems, i.e., single vehicle type and unlimited number of vehicles, and proposes a tabu search method for solving the vehicle fleet mix and routing problem, in which vehicles of different types and limited number of vehicles for each type are considered. In reality, the amount of demand and the probability of occurring a demand are not known in advance, they are stochastic in nature. We use the concept of chance constraint programming and modify the above tabu search algorithm for solving the stochastic vehicle routing problem. Parameter combinations that can quickly result in good solutions are analyzed and reported.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
