Abstract
Given shipment demand and driving regulations, a consolidation carrier has to make decisions on how to route both shipments and drivers at minimal cost. The traditional way to formulate and solve these problems is through the use of two-step models. This thesis presents a heuristic algorithm to solve an integrated model that can provide superior solutions. The algorithm combines a slope scaling initialization phase and tabu search to find high-quality solutions. The performance of the proposed heuristic is benchmarked against a commercial solver and these results indicate that the proposed method is able to produce better quality solutions for the similar solution time.
Library of Congress Subject Headings
Transportation--Planning--Data processing; Shipment of goods--Data processing; Heuristic algorithms
Publication Date
2-17-2013
Document Type
Thesis
Department, Program, or Center
Industrial and Systems Engineering (KGCOE)
Advisor
Hewitt, Mike
Recommended Citation
Zhang, Lifan, "Route-based transportation network design" (2013). Thesis. Rochester Institute of Technology. Accessed from
https://repository.rit.edu/theses/5693
Campus
RIT – Main Campus
Plan Codes
ISEE-MS
Comments
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: HE199.U5 Z42 2013