TABU SEARCH FOR SHIP ROUTING AND SCHEDULING
|D O W N L O A D|
The author of this thesis is providing the examination of the heuristic approaches in order to solve the SRSP, standing for the ship routing & scheduling problem. Subject method was originally developed to address the problems associated with loading cargo for the customers using the heterogeneous ships. the constraints are related to the delivery time windows that are commonly set by the customers.
The ultimate aim is the minimization of the overall operation costs keeping all customers satisfied. Two different routing and scheduling types have been considered. The first type is called the single-cargo problem - in this case the ship is loaded with only one cargo, while the second approach implies loading different products for their transportation and delivery to the different customers.
The document opens with the general information about the transportation management and sea transportation, followed by the chapters dealing with the integer programming and approximate techniques, providing the a good overview of transportation research, exact approach design, model variation, specification and algorithms applied to the ship scheduling, and many other aspects of the problem.
The "Read Later" function allows you to add material to this block with just one click. Just click on the icon and read the articles that interest you at any convenient time.