Remember Me
Or use your Academic/Social account:


You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.


Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message


Verify Password:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:

OpenAIRE is about to release its new face with lots of new content and services.
During September, you may notice downtime in services, while some functionalities (e.g. user registration, validation, claiming) will be temporarily disabled.
We apologize for the inconvenience, please stay tuned!
For further information please contact helpdesk[at]openaire.eu

fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Noori, Siamak; Ghannadpour, Seyed (2012)
Publisher: Springer Heidelberg
Languages: English
Types: Article
Subjects: locomotive assignment problem, genetic algorithm, fuzzy time windows, vehicle routing and scheduling
ddc: ddc:650
This paper aims to study the locomotive assignment problem which is very important for railway companies, in view of high cost of operating locomotives. This problem is to determine the minimum cost assignment of homogeneous locomotives located in some central depots to a set of pre-scheduled trains in order to provide sufficient power to pull the trains from their origins to their destinations. These trains have different degrees of priority for servicing, and the high class of trains should be serviced earlier than others. This problem is modeled using vehicle routing and scheduling problem where trains representing the customers are supposed to be serviced in pre-specified hard/soft fuzzy time windows. A two-phase approach is used which, in the first phase, the multi-depot locomotive assignment is converted 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, various heuristics and efficient operators are used in the evolutionary search. The suggested 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 those solutions produced by branch-and-bound technique to determine validity and quality of the model. Results show that suggested approach is rather effective in respect of quality and time.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • Ahuja RK, Liu J, Orlin JB, Sharma D, Shughart LA (2005) Solving real-life locomotive scheduling problems. Transp Sci 39(4):503-517
    • Alvarenga GB, Mateus GR, de Tomi G (2007) A genetic and set partitioning twophase approach for the vehicle routing problem with time windows. Computers & Operation Research 34:1561-1584
    • Berger J, Barkaoui M (2003) A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Cantú-Paz E (ed) GECCO'03 proceedings of the 2003 international conference on genetic and evolutionary computation: Part I, Chicago, IL, USA, July 12-16, 2003. Springer, Heidelberg, pp 646-656
    • Brannlund V, Lindberg PO, Nou A, Nilsson JE (1998) Railway timetabling using Lagrangian relaxation. Transp Sci 32(4):358-369
    • Bräysy O, Gendreau M (2001) Metaheuristics for the vehicle routing problem with time windows. Internal Report STF42 A01025, SINTEF Applied Mathematics. Department of Optimization, Norway
    • Cerda J, Dondo R (2007) A cluster-based optimization approach for the multidepot heterogeneous fleet vehicle routing problem with time windows. Eur J Oper Res 176:1478-1507
    • Cheng R, Gen M, Tozawa T (1996) Vehicle routing problem with fuzzy due-time using genetic algorithm. Japan Society for Fuzzy Theory and System 7 (5):1050-1061
    • Cordeau JF, Toth P, Vigo D (1998) A survey of optimization models for train and scheduling. Transp Sci 32(4):988-1005
    • Cordeau JF, Soumins F, Desrosiers J (2000) A Bender decomposition approach for the locomotive and car assignment problem. Transp Sci 34(4):133-149
    • Cordeau JF, Desauliniers G, Lingaya N, Soumis F, Desrosiers J (2001a) Simultaneous locomotive and car assignment at VIA Rail Canada. Transportation Research Part B 35:767-787
    • Cordeau JF, Soumins F, Desrosiers J (2001b) Simultaneous assignment of locomotives and cars to passenger trains. Operation Research 49:531-548
    • Crevier B, Cordeau JF, Laporte G (2007) The multi-depot vehicle routing problem with inter-depot routes. Eur J Oper Res 176:756-773
    • Czech ZJ, Czarnas P (2002) Parallel simulated annealing for the vehicle routing problem with time windows. In: Proceeding of the 10th Euromicro workshop on parallel, distributed and network-based processing, Canary Islands, Spain, January 9, 2002. IEEE, NY, USA, pp 376-383
    • Fioole PJ, Kroon L, Maroti G, Schrijver A (2006) A rolling stock circulation model for combining and splitting of passenger trains. European Journal of Operation Research 174:1281-1297
    • Florian M, Bushell G, Ferland J, Guerin G, Nastansky L (1976) The engine scheduling problem in a railway network. Infor 14:121-138
    • Forbes MA, Holt JN, Walts AM (1991) Exact solution of locomotive scheduling problem. Journal of the Operation Research Society 42:825-831
    • Gambardella LM, Taillard E, Agazzi G (1999) MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: Corne D, Dorigo N, Glover F (eds) New Ideas in Optimization. McGraw-Hill, Columbus, pp 63-76
    • Ghoseiri K, Ghannadpour SF (2009a) Locomotive routing problem using a hybrid genetic algorithm. Journal of Transportation Research 5(3):259-273
    • Ghoseiri K, Ghannadpour SF (2009b) Hybrid genetic algorihtm for vehicle routing and scheduling problem. Journal of Applied Science 9(1):79-87
    • Ghoseiri K, Ghannadpour SF (2010) A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows. Appl Soft Comput 10:53-65
    • Holland JH (1975) Adaptation in natural and artificial system. The University of Michigan Press, Ann Arbor, MI
    • Irnich S, Funke B, Grunert T (2006) Sequential search and its application to vehicle routing problems. Computer & Operations Research 33:2405-2429
    • Kim BI, Kim S, Sahoo S (2006) Waste collection vehicle routing problem with time windows. Comput Oper Res 33:3624-3642
    • Laporte G, Semet F (1999) Classical Heuristics for the Vehicle Routing Problem. Les Cahiers du GERAD, G-98-54. Group for Research in Decision Analysis, Montreal, Canada, http://www.gerad.ca/en/publications/cahiers_rech.php? r_numero=&r_titre=Classical+Heuristics+for+the+Vehicle+Routing+Problem &r_titre_ancien=&r_auteurs=&r_journal_paru=&r_paru_mois=&r_paru_annee= &r_rev_mois=&r_rev_annee=&r_resume=&tri=num&rech=Search Accessed 06 December 2010
    • Li F, Golden B, Wasil E (2005) Very large scale vehicle routing: new test problems algorithms and results. Comput Oper Res 32:1165-1179
    • Lingaya N, Cordeau JF, Desaulniers G, Desrosiers J, Soumis F (2002) Operational car assignment at VIA Rail Canada. Transportation Research Part B 36:755-778
    • Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problem. Computer & Operations Researches 34:2403-2435
    • Rouillon S, Desaulniers G, Soumis F (2006) An extended branch-and-bound method for locomotive assignment. Transportation Research Part B 40:404-423
    • Sheng HM, Wang JC, Huang HH, Yen DC (2006) Fuzzy measure on vehicle routing problem of hospital materials. Expert Systems with Application 30:367-377
    • Solomon MM (1987) Algorithms for vehicle routing problem and scheduling problems with time window constraints. Operation research 35:254-365
    • Tan KC, Chew YH, Lee LH (2006) A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput Optim Appl 34:115-151
    • Tan KC, Cheong CY, Goh CK (2007) Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. Eur J Oper Res 177:139-813
    • Vaidyanathan B, Ahuja RK, Orlin JB (2008a) The locomotive routing problem. Transp Sci 42:492-507
    • Vaidyanathan B, Ahuja RK, Liu J, Shughart LA (2008b) Real-life locomotive planning: New formulations and computational results. Transportation Research Part B: Methodological 42:147-168
    • Ziarati K, Soumis F, Desrosiers J, Gelinas S, Saintonge A (1997) Locomotive assignment with heterogeneous consists at CN North America. European Journal of Operation Research 97:281-292
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article

Cookies make it easier for us to provide you with our services. With the usage of our services you permit us to use cookies.
More information Ok