Yol üzerinde durmayı dikkate alan bütünleşik rotalama ve çizelgeleme problemleri için sezgisel bir yöntem

In this study, we examine an integrated routing and scheduling problem thatarises in the context of transportation of hazardous materials. The purpose ofthe problem is to nd a minimum risk route between an origin and a destinationpoint on a given network and to build a schedule on this route that determineswhere and how long to stop for a truck carrying hazardous materials. The objectiveis to minimize the risk imposed to the society while completing the pathwithin a given time limit. The risk is dened as the expected population exposurein the presence of an accident which varies dierent times in a day. Thereare exact algorithms available in the literature that solve the problem. However,these algorithms are not capable of solving large sized networks due to memoryconstraints. Our aim is to develop a heuristic procedure that can handle largernetworks. We separate the problem into two independent components, routingand scheduling, and propose solution algorithms which would communicate eachother when running the algorithm. For the routing component we dene a neighborhoodstructure that can be used to generate several paths around a givenpath on a network. The search procedure takes an initial path and improvesit by generating dierent paths in the dened neighborhood. For the schedulingcomponent, we discuss mixed integer programming, dynamic programmingand heuristic approaches. We run the proposed heuristic algorithm on severaltest networks and compare its performance with the optimal solutions. We alsopresent the application of the heuristic procedure on a large sized Turkey RoadNetwork.