Locomotive Routing and Scheduling Problem with Fuzzy Time Windows

The problem of assigning locomotives to a set of pre-planned trains is very important for railway companies, in view of high cost of operating locomotives. The model considered in this paper is to assign a set of homogeneous locomotives locating in some geographically dispersed depots to a set of pre-schedules trains with different degrees of priorities in order to provide sufficient power to pull the trains from their origins to their destinations at minimum costs. This model is presented by the use of the vehicle routing and scheduling problem where trains representing the customers are supposed to be serviced in pre-specified hard/soft fuzzy time windows. A cluster-first, route-second approach is used to inform the multi-depot locomotive assignment to a set of single depot problems and after that each single depot problem is solved heuristically by a hybrid genetic algorithm. In the genetic algorithm with various heuristics in the evolutionary search, part of initial population is initialized using Push Forward Insertion Heuristic (PFIH) and part is initialized randomly. A interchange mechanism interchanges customers between routes and generates neighborhood solution. The suggestive algorithm is applied to solve the medium sized numerical example to check capabilities of the model and algorithm. Moreover, some of the results are compared with of those solutions produced by Branch & Bound technique to determine validity and quality of the model. Results show that suggestive approach is rather effective in respect of quality and time.


  • English

Media Info

  • Media Type: DVD
  • Features: Figures; References; Tables;
  • Pagination: 14p
  • Monograph Title: TRB 89th Annual Meeting Compendium of Papers DVD

Subject/Index Terms

Filing Info

  • Accession Number: 01157003
  • Record Type: Publication
  • Report/Paper Numbers: 10-2592
  • Files: TRIS, TRB
  • Created Date: Jan 25 2010 11:14AM