IDEAS home Printed from https://ideas.repec.org/a/spr/topjnl/v20y2012i1p130-153.html
   My bibliography  Save this article

Biased random-key genetic algorithms with applications in telecommunications

Author

Listed:
  • Mauricio Resende

Abstract

No abstract is available for this item.

Suggested Citation

  • Mauricio Resende, 2012. "Biased random-key genetic algorithms with applications in telecommunications," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 20(1), pages 130-153, April.
    • Handle: RePEc:spr:topjnl:v:20:y:2012:i:1:p:130-153
    DOI: 10.1007/s11750-011-0176-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s11750-011-0176-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s11750-011-0176-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.
    2. Skorin-Kapov, Nina, 2007. "Routing and wavelength assignment in optical networks using bin packing based algorithms," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1167-1179, March.
    3. M. Ericsson & M.G.C. Resende & P.M. Pardalos, 2002. "A Genetic Algorithm for the Weight Setting Problem in OSPF Routing," Journal of Combinatorial Optimization, Springer, vol. 6(3), pages 299-333, September.
    4. Goncalves, Jose Fernando & de Magalhaes Mendes, Jorge Jose & Resende, Mauricio G. C., 2005. "A hybrid genetic algorithm for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 167(1), pages 77-95, November.
    5. Noronha, Thiago F. & Ribeiro, Celso C., 2006. "Routing and wavelength assignment by partition colouring," European Journal of Operational Research, Elsevier, vol. 171(3), pages 797-810, June.
    6. James C. Bean, 1994. "Genetic Algorithms and Random Keys for Sequencing and Optimization," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 154-160, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jonatas B. C. Chagas & Julian Blank & Markus Wagner & Marcone J. F. Souza & Kalyanmoy Deb, 2021. "A non-dominated sorting based customized random-key genetic algorithm for the bi-objective traveling thief problem," Journal of Heuristics, Springer, vol. 27(3), pages 267-301, June.
    2. R. M. A. Silva & M. G. C. Resende & P. M. Pardalos, 2015. "A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 710-728, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Julliany S. Brandão & Thiago F. Noronha & Celso C. Ribeiro, 2016. "A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks," Journal of Global Optimization, Springer, vol. 65(4), pages 813-835, August.
    2. Gonçalves, José Fernando & Resende, Mauricio G.C., 2015. "A biased random-key genetic algorithm for the unequal area facility layout problem," European Journal of Operational Research, Elsevier, vol. 246(1), pages 86-107.
    3. José Fernando Gonçalves & Mauricio G. C. Resende, 2011. "A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem," Journal of Combinatorial Optimization, Springer, vol. 22(2), pages 180-201, August.
    4. L. A. C. Roque & D. B. M. M. Fontes & F. A. C. C. Fontes, 2014. "A hybrid biased random key genetic algorithm approach for the unit commitment problem," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 140-166, July.
    5. Bruno Q. Pinto & Celso C. Ribeiro & Isabel Rosseti & Thiago F. Noronha, 2020. "A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model," Journal of Global Optimization, Springer, vol. 77(4), pages 949-973, August.
    6. Belgacem, Lucile & Charon, Irène & Hudry, Olivier, 2014. "A post-optimization method for the routing and wavelength assignment problem applied to scheduled lightpath demands," European Journal of Operational Research, Elsevier, vol. 232(2), pages 298-306.
    7. Gonçalves, J.F. & Mendes, J.J.M. & Resende, M.G.C., 2008. "A genetic algorithm for the resource constrained multi-project scheduling problem," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1171-1190, September.
    8. Thi-Kien Dao & Tien-Szu Pan & Trong-The Nguyen & Jeng-Shyang Pan, 2018. "Parallel bat algorithm for optimizing makespan in job shop scheduling problems," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 451-462, February.
    9. Gonçalves, José Fernando & Wäscher, Gerhard, 2020. "A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects," European Journal of Operational Research, Elsevier, vol. 286(3), pages 867-882.
    10. Luise-Sophie Hoffmann & Carolin Kellenbrink & Stefan Helber, 2020. "Simultaneous structuring and scheduling of multiple projects with flexible project structures," Journal of Business Economics, Springer, vol. 90(5), pages 679-711, June.
    11. Ricardo Silva & Mauricio Resende & Panos Pardalos, 2014. "Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm," Journal of Global Optimization, Springer, vol. 60(2), pages 289-306, October.
    12. Xinyun Wu & Shengfeng Yan & Xin Wan & Zhipeng Lü, 2016. "Multi-neighborhood based iterated tabu search for routing and wavelength assignment problem," Journal of Combinatorial Optimization, Springer, vol. 32(2), pages 445-468, August.
    13. R. M. A. Silva & M. G. C. Resende & P. M. Pardalos, 2015. "A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm," Journal of Combinatorial Optimization, Springer, vol. 30(3), pages 710-728, October.
    14. Gonçalves, José Fernando & Resende, Mauricio G.C., 2013. "A biased random key genetic algorithm for 2D and 3D bin packing problems," International Journal of Production Economics, Elsevier, vol. 145(2), pages 500-510.
    15. Ayşegül Altın & Bernard Fortz & Mikkel Thorup & Hakan Ümit, 2013. "Intra-domain traffic engineering with shortest path routing protocols," Annals of Operations Research, Springer, vol. 204(1), pages 65-95, April.
    16. Andrade, Carlos E. & Toso, Rodrigo F. & Gonçalves, José F. & Resende, Mauricio G.C., 2021. "The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications," European Journal of Operational Research, Elsevier, vol. 289(1), pages 17-30.
    17. G I Zobolas & C D Tarantilis & G Ioannou, 2009. "A hybrid evolutionary algorithm for the job shop scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(2), pages 221-235, February.
    18. Thiago Noronha & Mauricio Resende & Celso Ribeiro, 2011. "A biased random-key genetic algorithm for routing and wavelength assignment," Journal of Global Optimization, Springer, vol. 50(3), pages 503-518, July.
    19. Christophe Duhamel & Philippe Mahey & Alexandre X. Martins & Rodney R. Saldanha & Mauricio C. Souza, 2016. "Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem," 4OR, Springer, vol. 14(2), pages 201-220, June.
    20. Paola Festa & Panos Pardalos, 2012. "Efficient solutions for the far from most string problem," Annals of Operations Research, Springer, vol. 196(1), pages 663-682, July.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:20:y:2012:i:1:p:130-153. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.