Session Detail Information
Add this session to your itinerary

Cluster :  Contributed Paper Track - 07-Transportation

Session Information  : Wednesday Oct 22, 10:00 - 11:30

Title:  Transportation III
Chair: Alan Rao,Senior Operations Research Analyst, Volpe National Transportation Systems Center, 55 Broadway, Kendall Sqaure, Cambridge MA 02142, United States, rao@volpe.dot.gov

Abstract Details

Title: Optimal Bus Transit Route Network Design Problem: Algorithms, Implementations and Numerical Results
 Presenting Author: Wei Fan,University of Texas, Dept. of Civil Eng., ECJ 6.9, C1761, Austin TX 78712, United States, weifan@mail.utexas.edu
 Co-Author: Randy Machemehl,University of Texas, Dept. of Civil Eng., ECJ 6.9, C1761, Austin TX 78712, United States, rbm@mail.utexas.edu
 
Abstract: A multi-objective nonlinear mixed integer model is formulated for the bus transit route network design problem. Five algorithms, including the genetic algorithm, local search, simulated annealing, random search and exhaustive search methods are examined as solution methods for finding an optimum transit route set. A small example network is successfully tested as a pilot study for the BTRNDP both with fixed and variable demand. Numerical results and related characteristics are presented.
  
Title: A 'Tabu Search' Meta-Heuristic for 'Capacitated VRP' with Simultanous Pick-Up and Deliveries
 Presenting Author: Arif Vural,Research Assistant, Mississippi State University, Dept. of Industrial Eng. McCain Building, Room 390 F, Starkville MS 39762, United States, avolkan@su.sabanciuniv.edu
 Co-Author: Burak Eksioglu,Assistant Professor, Mississippi State University, Department of Industrial Engineering, PO Box 9542, Mississippi State MS 39762, United States, beksioglu@ie.msstate.edu
 
Abstract: In this study, we focus on a decision model for a real world problem. The problem reveals itself as simultaneous distribution of commodities and recollection of empty packages the same size as the initial state with a single depot and a fleet of uniform vehicles with limited capacities. Resembling instances are named in the literature as ‘CVRPSPD’. To solve the arousing NP-hard problem we use ‘Tabu Search’ based approach. Reduced number of parameters, and a good solution performance are sought.
  
Title: Optimal Cluster Repair Sequence
 Presenting Author: Fahad Alrakabi,Ph.D., USC, 333 San Marcos st., Apt. # X, San Gabriel CA 91776, United States, alrakabi@usc.edu
 Co-Author: Jim Moore,Professor, University of Southern California, KAP 210, MC-2531, 3620 S. Vermont Ave, Rm 210, Los Angeles CA 90089-2531, United States, jmoore@usc.edu
 
Abstract: After a major earthquake bridges and other network links will most likely have to be grouped into clusters in order to define a repair sequence. This will result in a finite number of clusters. We are concerned with the method of sequence repair of these clusters, given that resources may not be available to repair all clusters simultaneously. Our goal is to determine the sequence in which the clusters should be repaired. The optimal repair sequence minimizes total network delay.
  
Title: Base Case Risk Assessment in US Railroad Systems
 Presenting Author: Alan Rao,Senior Operations Research Analyst, Volpe National Transportation Systems Center, 55 Broadway, Kendall Sqaure, Cambridge MA 02142, United States, rao@volpe.dot.gov
 Co-Author: Frank Roskind,FRA Office of Safety, 1120 Vermont Avenue, NW, Washington DC, United States, frank.roskind@fra.dot.gov
 
Abstract: Since Mid-90's, FRA/Volpe Center has been developing Probabilistic Risk Assessment models for US railroad systems. Base Case Risk Assessment/RISK2 is the latest example supporting RSAC's NPRM of 49-CFR-236-H. Built from a GIS, RISK2 applies both linear and non-linear methods to analyze failure rates and accident consequences in different railroad territories. This performance-based model studies the per-train-mile risk for future railroad development projects.