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

Digital data networks design using genetic algorithms

Author

Listed:
  • Chu, Chao-Hsien
  • Premkumar, G.
  • Chou, Hsinghua

Abstract

No abstract is available for this item.

Suggested Citation

  • Chu, Chao-Hsien & Premkumar, G. & Chou, Hsinghua, 2000. "Digital data networks design using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 127(1), pages 140-158, November.
    • Handle: RePEc:eee:ejores:v:127:y:2000:i:1:p:140-158
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(99)00329-X
    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. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    2. Skorin-Kapov, Darko & Skorin-Kapov, Jadranka, 1994. "On tabu search for the location of interacting hub facilities," European Journal of Operational Research, Elsevier, vol. 73(3), pages 502-509, March.
    3. Charu C. Aggarwal & James B. Orlin & Ray P. Tai, 1997. "Optimized Crossover for the Independent Set Problem," Operations Research, INFORMS, vol. 45(2), pages 226-234, April.
    4. Youngho Lee & Steve Y. Chiu & Jennifer Ryan, 1996. "A Branch and Cut Algorithm for a Steiner Tree-Star Problem," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 194-201, August.
    5. Manuel Laguna & Fred Glover, 1993. "Bandwidth Packing: A Tabu Search Approach," Management Science, INFORMS, vol. 39(4), pages 492-500, April.
    6. Jadranka Skorin-Kapov, 1990. "Tabu Search Applied to the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 33-45, February.
    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. Altiparmak, Fulya & Dengiz, Berna, 2009. "A cross entropy approach to design of reliable networks," European Journal of Operational Research, Elsevier, vol. 199(2), pages 542-552, December.
    2. Leitner, Markus & Ljubić, Ivana & Salazar-González, Juan-José & Sinnl, Markus, 2017. "An algorithmic framework for the exact solution of tree-star problems," European Journal of Operational Research, Elsevier, vol. 261(1), pages 54-66.
    3. M. Gisela Bardossy & S. Raghavan, 2010. "Dual-Based Local Search for the Connected Facility Location and Related Problems," INFORMS Journal on Computing, INFORMS, vol. 22(4), pages 584-602, November.

    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. Marianov, Vladimir & Serra, Daniel & ReVelle, Charles, 1999. "Location of hubs in a competitive environment," European Journal of Operational Research, Elsevier, vol. 114(2), pages 363-371, April.
    2. Bhuvnesh Sharma & M. Ramkumar & Nachiappan Subramanian & Bharat Malhotra, 2019. "Dynamic temporary blood facility location-allocation during and post-disaster periods," Annals of Operations Research, Springer, vol. 283(1), pages 705-736, December.
    3. Dimitris Fouskakis & David Draper, 2002. "Stochastic Optimization: a Review," International Statistical Review, International Statistical Institute, vol. 70(3), pages 315-349, December.
    4. Chiang, Wen-Chyuan & Chiang, Chi, 1998. "Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 457-488, April.
    5. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    6. Daniel Berend & Ephraim Korach & Shira Zucker, 2012. "Tabu search for the BWC problem," Journal of Global Optimization, Springer, vol. 54(4), pages 649-667, December.
    7. Rolland, Erik & Schilling, David A. & Current, John R., 1997. "An efficient tabu search procedure for the p-Median Problem," European Journal of Operational Research, Elsevier, vol. 96(2), pages 329-342, January.
    8. Afsaneh Amiri & Majid Salari, 2019. "Time-constrained maximal covering routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 41(2), pages 415-468, June.
    9. Sexton, Randall S. & Alidaee, Bahram & Dorsey, Robert E. & Johnson, John D., 1998. "Global optimization for artificial neural networks: A tabu search application," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 570-584, April.
    10. 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.
    11. Sheu Chen, 2010. "A Heuristic Algorithm for Hierarchical Hub-and-spoke Network of Time-definite Common Carrier Operation Planning Problem," Networks and Spatial Economics, Springer, vol. 10(4), pages 509-523, December.
    12. Sophie D. Lapierre & Angel B. Ruiz & Patrick Soriano, 2004. "Designing Distribution Networks: Formulations and Solution Heuristic," Transportation Science, INFORMS, vol. 38(2), pages 174-187, May.
    13. Costamagna, Eugenio & Fanni, Alessandra & Giacinto, Giorgio, 1998. "A Tabu Search algorithm for the optimisation of telecommunication networks," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 357-372, April.
    14. Waligóra, Grzegorz, 2009. "Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation," European Journal of Operational Research, Elsevier, vol. 193(3), pages 849-856, March.
    15. Maniezzo, Vittorio & Dorigo, Marco & Colorni, Alberto, 1995. "Algodesk: An experimental comparison of eight evolutionary heuristics applied to the Quadratic Assignment Problem," European Journal of Operational Research, Elsevier, vol. 81(1), pages 188-204, February.
    16. Mika, Marek & Waligora, Grzegorz & Weglarz, Jan, 2005. "Simulated annealing and tabu search for multi-mode resource-constrained project scheduling with positive discounted cash flows and different payment models," European Journal of Operational Research, Elsevier, vol. 164(3), pages 639-668, August.
    17. Jozefowska, Joanna & Waligora, Grzegorz & Weglarz, Jan, 2002. "Tabu list management methods for a discrete-continuous scheduling problem," European Journal of Operational Research, Elsevier, vol. 137(2), pages 288-302, March.
    18. Carreras, Miquel & Serra, Daniel, 1999. "On optimal location with threshold requirements," Socio-Economic Planning Sciences, Elsevier, vol. 33(2), pages 91-103, June.
    19. Jiefeng Xu & Steve Y. Chiu & Fred Glover, 1999. "Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search," Management Science, INFORMS, vol. 45(3), pages 330-345, March.
    20. Grolimund, Stephan & Ganascia, Jean-Gabriel, 1997. "Driving Tabu Search with case-based reasoning," European Journal of Operational Research, Elsevier, vol. 103(2), pages 326-338, December.

    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:127:y:2000:i:1:p:140-158. 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.