Simulated Annealing (SA) metaheuristic has been applied to most of the combinatorial optimization problems. We chose SA as the solution procedure for our problem because of its ability to escape from local minima and its easy adaptability to the problem. SA accepts uphill task with certain probability which allows the heuristic to escape from local minima.CHAPTER. 3. MATHEMATICAL. MODEL. In this chapter, we introduce a mathematical model for the single truck routing and driver scheduling problem with time-dependent travel, Hours of Service (HOS) regulations, multiple delivery locationsanbsp;...
|Title||:||Time Dependent Truck Routing and Driver Scheduling Problem with Hours of Service Regulations|
|Publisher||:||ProQuest - 2009|