IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v171y2006i3p797-810.html
   My bibliography  Save this article

Routing and wavelength assignment by partition colouring

Author

Listed:
  • Noronha, Thiago F.
  • Ribeiro, Celso C.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:171:y:2006:i:3:p:797-810
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00586-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. David S. Johnson & Cecilia R. Aragon & Lyle A. McGeoch & Catherine Schevon, 1991. "Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning," Operations Research, INFORMS, vol. 39(3), pages 378-406, June.
    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. 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.
    2. 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.
    3. Demange, Marc & Ekim, Tınaz & Ries, Bernard & Tanasescu, Cerasela, 2015. "On some applications of the selective graph coloring problem," European Journal of Operational Research, Elsevier, vol. 240(2), pages 307-314.
    4. 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.
    5. Holler, Holger & Vo[ss], Stefan, 2006. "A heuristic approach for combined equipment-planning and routing in multi-layer SDH/WDM networks," European Journal of Operational Research, Elsevier, vol. 171(3), pages 787-796, June.
    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. 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.
    8. Maryam Daryalal & Merve Bodur, 2022. "Stochastic RWA and Lightpath Rerouting in WDM Networks," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2700-2719, September.
    9. Francesco Carrabs & Raffaele Cerulli & Ciriaco D’Ambrosio & Federica Laureana, 2021. "The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis," Journal of Optimization Theory and Applications, Springer, vol. 188(2), pages 356-377, February.
    10. 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.

    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. Jagota, Arun, 1996. "An adaptive, multiple restarts neural network algorithm for graph coloring," European Journal of Operational Research, Elsevier, vol. 93(2), pages 257-270, September.
    2. Schlereth, Christian & Stepanchuk, Tanja & Skiera, Bernd, 2010. "Optimization and analysis of the profitability of tariff structures with two-part tariffs," European Journal of Operational Research, Elsevier, vol. 206(3), pages 691-701, November.
    3. Xiao-Feng Xie & Jiming Liu, 2009. "Graph coloring by multiagent fusion search," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 99-123, August.
    4. Pirlot, Marc, 1996. "General local search methods," European Journal of Operational Research, Elsevier, vol. 92(3), pages 493-511, August.
    5. M Plumettaz & D Schindl & N Zufferey, 2010. "Ant Local Search and its efficient adaptation to graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 819-826, May.
    6. Russell Bent & Pascal Van Hentenryck, 2004. "A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 38(4), pages 515-530, November.
    7. Massimiliano Caramia & Paolo Dell'Olmo, 2001. "Iterative coloring extension of a maximum clique," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 518-550, September.
    8. C A Glass & A Prügel-Bennett, 2005. "A polynomially searchable exponential neighbourhood for graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 324-330, March.
    9. Valmir C. Barbosa & Carlos A.G. Assis & Josina O. Do Nascimento, 2004. "Two Novel Evolutionary Formulations of the Graph Coloring Problem," Journal of Combinatorial Optimization, Springer, vol. 8(1), pages 41-63, March.
    10. Bradley Hardy & Rhyd Lewis & Jonathan Thompson, 2018. "Tackling the edge dynamic graph colouring problem with and without future adjacency information," Journal of Heuristics, Springer, vol. 24(3), pages 321-343, June.
    11. Kim, Yeong-Dae & Lim, Hyeong-Gyu & Park, Moon-Won, 1996. "Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process," European Journal of Operational Research, Elsevier, vol. 91(1), pages 124-143, May.
    12. B Suman & P Kumar, 2006. "A survey of simulated annealing as a tool for single and multiobjective optimization," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(10), pages 1143-1160, October.
    13. Caramia, Massimiliano & Dell'Olmo, Paolo, 2008. "Embedding a novel objective function in a two-phased local search for robust vertex coloring," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1358-1380, September.
    14. Khan, W. A. & Hayhurst, D. R. & Cannings, C., 1999. "Determination of optimal path under approach and exit constraints," European Journal of Operational Research, Elsevier, vol. 117(2), pages 310-325, September.
    15. Vincenzo Cutello & Giuseppe Nicosia & Mario Pavone, 2007. "An immune algorithm with stochastic aging and kullback entropy for the chromatic number problem," Journal of Combinatorial Optimization, Springer, vol. 14(1), pages 9-33, July.
    16. Sabuncuoglu, Ihsan & Erel, Erdal & Alp, Arda, 2009. "Ant colony optimization for the single model U-type assembly line balancing problem," International Journal of Production Economics, Elsevier, vol. 120(2), pages 287-300, August.
    17. Celia A. Glass & Adam Prügel-Bennett, 2003. "Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm," Journal of Combinatorial Optimization, Springer, vol. 7(3), pages 229-236, September.
    18. Drexl, Andreas & Haase, Knut, 1993. "Sequential-analysis-based randomized-regret-methods for lotsizing and scheduling," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 323, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    19. Avanthay, Cedric & Hertz, Alain & Zufferey, Nicolas, 2003. "A variable neighborhood search for graph coloring," European Journal of Operational Research, Elsevier, vol. 151(2), pages 379-388, December.
    20. Vincent F. Yu & Hadi Susanto & Yu-Hsuan Yeh & Shih-Wei Lin & Yu-Tsung Huang, 2022. "The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel Lockers," Mathematics, MDPI, vol. 10(6), pages 1-22, March.

    More about this item

    Statistics

    Access and download statistics

    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:eee:ejores:v:171:y:2006:i:3:p:797-810. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.