DYNAMIC OPTIMIZATION OF CARGO MOVEMENT BY TRUCKS IN METROPOLITAN AREAS WITH ADJACENT PORTS
In this report, the problem of container movement by trucks is modeled as a "multi-Traveling Salesmen Problems with Time Windows". A two- phased exact algorithm based on dynamic programming is proposed for finding the best routes for a fleet of trucks. Two computationally feasible methods are described: 1) a hybrid methodology comprised of dynamic programming in conjunction with genetic algorithms, and 2) a heuristic insertion method. The heuristic insertion method is used for adding newly arriving customers to the set of customers with advanced requests, since the cargo movement in a traffic network is a dynamic problem. Results from computations show the efficiency of the hybrid method for static problems and the insertion method for the dynamic ones.
- Record URL:
-
Supplemental Notes:
- Publication Date: June 2002. METRANS Transportation Center, Los Angeles CA. Remarks: Performed for California Dept. of Transportation, New Technology and Research under contract no. 65A0047
-
Corporate Authors:
METRANS Transportation Center
University of Southern California
Los Angeles, CA United States 90089-0626California Department of Transportation
Division of New Technology and Research, P.O. Box 942873
Sacramento, CA United States 94273-0001 -
Authors:
- Ioannou, Petros A
- Chassiakos, Anastasios
- Jula, Hossein
- Unglaub, Ricardo
- Publication Date: 2002
Language
- English
Media Info
- Pagination: vii, 36 p.
Subject/Index Terms
- TRT Terms: Ports; Route guidance; Scheduling; Trucking
- Subject Areas: Freight Transportation; Motor Carriers; Terminals and Facilities;
Filing Info
- Accession Number: 00931472
- Record Type: Publication
- Source Agency: UC Berkeley Transportation Library
- Report/Paper Numbers: FHWA/CA/OR-2002/14
- Files: UTC, NTL, STATEDOT
- Created Date: Oct 2 2002 12:00AM