BazEkon - The Main Library of the Cracow University of Economics

BazEkon home page

Main menu

Bernay Benoit (Université Blaise Pascal, France), Samuel Deleplanque (Université Blaise Pascal, France), Quiliot Alain (Université Blaise Pascal, France)
Routing on Dynamic Networks: GRASP versus Genetic
Annals of Computer Science and Information Systems, 2014, vol. 2, s. 487 - 492, rys., tab., bibliogr. 10 poz.
Algorytmy genetyczne, Sieci komputerowe, Algorytmy
Genetic algorithms, Computer networks, Algorithms
We address here a large scale routing and scheduling transportation problem, through introduction of a flow model designed on a dynamic network. We deal with this model while using a master/slave decomposition scheme, and testing the behavior on this scheme of both a GRASP algorithm and a Genetic algorithm.(original abstract)
Full text
  1. Ahuja. R.K, Magnanti. T.L, Orlin. J.B, Reddy. M.R: Applications of network optimization; Chap. 1 Network Models, Handbook O.R & Manag. Sci. 7, p 1-83, ISBN 013617549X, (1995).
  2. Angelova. M, Atanassov. K, Pencheva. T: Purposeful model parameter genesis in simple genetic algorithms; Computer and Mathematics with Applications 64, p 221-228, DOI 10.1016/j.camva.2012.01.047, (2012)
  3. Aronson. J.E: A survey on dynamic network flows ; Ann. Op. Res. 20, p 1-66, DOI 10.1007/BF02216922, (1989).
  4. Borndorfer. R, Grotschel. M, Lobel. A: Optimization of transportation systems, Konrad-Zuse-Centrum Information Technik Berlin, Report 98-09, (1998).
  5. Cordeau. J.P, Toth. P, Vigo. D: A survey of optimization models for train routing and scheduling; Transportation Science 32, p 380-404, DOI 10.1287/trsc.32.4.380, (1998).
  6. Crainic. T, .Gendreau. M, Farvolden. M: A simplex based Tabu search method for network design; INFORMS Journal on Computing 12, p 223-236, DOI 10.1287/ijoc., (2000).
  7. El Ghazali. T: Metaheuristics from Design to Implementation, Wiley Interscience, ISBN 978-0-470-49690-9 (2009).
  8. Quilliot. A, Liberalino. H, Bernay.B: Large Scale Multi-Commodity Flow Handling on Dynamic Networks, Proc. LSSC 2013, Szozopol, Bulgaria, to appear in LNCS 8353, Springer, (2013).
  9. Reeves C.R: Genetic algorithms for the operations researcher; INFORMS Journal of Computing 9, 3, p 231-250, DOI 10.1007/0-306-48056-5_3, (1997).
  10. Resende. M, Ribeiro. C: Greedy Random Adaptive Procedure, Handbook of Metaheuristics, Int. Series on O.R and Manageent Sciences, 146, p 283-319, DOI 10.1007/978-1-4419-1665-5_10, (2002).
Cited by
Share on Facebook Share on Twitter Share on Google+ Share on Pinterest Share on LinkedIn Wyślij znajomemu