IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v98y2005i2p251-261.html
   My bibliography  Save this article

Recent network design techniques using evolutionary algorithms

Author

Listed:
  • Gen, Mitsuo
  • Kumar, Anup
  • Ryul Kim, Jong

Abstract

No abstract is available for this item.

Suggested Citation

  • Gen, Mitsuo & Kumar, Anup & Ryul Kim, Jong, 2005. "Recent network design techniques using evolutionary algorithms," International Journal of Production Economics, Elsevier, vol. 98(2), pages 251-261, November.
    • Handle: RePEc:eee:proeco:v:98:y:2005:i:2:p:251-261
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(05)00015-0
    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. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    2. G Zhou & M Gen, 2003. "A genetic algorithm approach on tree-like telecommunication network design problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(3), pages 248-254, March.
    3. D. Klingman & A. Napier & J. Stutz, 1974. "NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems," Management Science, INFORMS, vol. 20(5), pages 814-821, January.
    4. Richard S. Barr & Fred Glover & Darwin Klingman, 1981. "A New Optimization Method for Large Scale Fixed Charge Transportation Problems," Operations Research, INFORMS, vol. 29(3), pages 448-463, June.
    5. Leslie Hall, 1996. "Experience with a Cutting Plane Algorithm for the Capacitated Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 8(3), pages 219-234, August.
    6. Luis Gouveia, 1995. "A 2n Constraint Formulation for the Capacitated Minimal Spanning Tree Problem," Operations Research, INFORMS, vol. 43(1), pages 130-141, 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. Desai, Jitamitra & Sen, Suvrajeet, 2010. "A global optimization algorithm for reliable network design," European Journal of Operational Research, Elsevier, vol. 200(1), pages 1-8, January.
    2. Marco A. Miranda-Ackerman & Catherine Azzaro-Pantel & Alberto A. Aguilar-Lasserre & Alfredo Bueno-Solano & Karina C. Arredondo-Soto, 2019. "Green Supplier Selection in the Agro-Food Industry with Contract Farming: A Multi-Objective Optimization Approach," Sustainability, MDPI, vol. 11(24), pages 1-19, December.
    3. Elham Behmanesh & Jürgen Pannek, 2021. "A Comparison between Memetic Algorithm and Genetic Algorithm for an Integrated Logistics Network with Flexible Delivery Path," SN Operations Research Forum, Springer, vol. 2(3), pages 1-24, September.
    4. Jawahar, N. & Balaji, A.N., 2009. "A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge," European Journal of Operational Research, Elsevier, vol. 194(2), pages 496-537, April.
    5. J R Montoya-Torres & A Aponte & P Rosas, 2011. "Applying GRASP to solve the multi-item three-echelon uncapacitated facility location problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(2), pages 397-406, February.
    6. A. N. Balaji & J. Mukund Nilakantan & Izabela Nielsen & N. Jawahar & S. G. Ponnambalam, 2019. "Solving fixed charge transportation problem with truck load constraint using metaheuristics," Annals of Operations Research, Springer, vol. 273(1), pages 207-236, February.
    7. Jeffery L. Kennington & Charles D. Nicholson, 2010. "The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 326-337, May.

    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. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
    2. Yixin Zhao & Torbjörn Larsson & Elina Rönnberg & Panos M. Pardalos, 2018. "The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation," Journal of Global Optimization, Springer, vol. 72(3), pages 517-538, November.
    3. Sun, Minghe & Aronson, Jay E. & McKeown, Patrick G. & Drinka, Dennis, 1998. "A tabu search heuristic procedure for the fixed charge transportation problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 441-456, April.
    4. Borisovsky, P. & Dolgui, A. & Eremeev, A., 2009. "Genetic algorithms for a supply management problem: MIP-recombination vs greedy decoder," European Journal of Operational Research, Elsevier, vol. 195(3), pages 770-779, June.
    5. ORTEGA, Francisco & WOLSEY, Laurence, 2000. "A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem," LIDAM Discussion Papers CORE 2000049, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    6. Gurwinder Singh & Amarinder Singh, 2021. "Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1073-1086, December.
    7. Amberg, Anita & Domschke, Wolfgang & Vo[ss], Stefan, 2000. "Multiple center capacitated arc routing problems: A tabu search algorithm using capacitated trees," European Journal of Operational Research, Elsevier, vol. 124(2), pages 360-376, July.
    8. Dukwon Kim & Xinyan Pan & Panos Pardalos, 2006. "An Enhanced Dynamic Slope Scaling Procedure with Tabu Scheme for Fixed Charge Network Flow Problems," Computational Economics, Springer;Society for Computational Economics, vol. 27(2), pages 273-293, May.
    9. Uchoa, Eduardo & Fukasawa, Ricardo & Lysgaard, Jens & Pessoa, Artur & Poggi de Aragão, Marcus & Andrade, Diogo, 2006. "Robust Branch-Cut-and-Price for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation," CORAL Working Papers L-2006-08, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    10. Gouveia, Luis & Lopes, Maria Joao, 2000. "Valid inequalities for non-unit demand capacitated spanning tree problems with flow costs," European Journal of Operational Research, Elsevier, vol. 121(2), pages 394-411, March.
    11. F Altiparmak & I Karaoglan, 2008. "An adaptive tabu-simulated annealing for concave cost transportation problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(3), pages 331-341, March.
    12. Jeffery L. Kennington & Charles D. Nicholson, 2010. "The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 326-337, May.
    13. Raymond A. Patterson & Erik Rolland, 2002. "Hybrid Fiber Coaxial Network Design," Operations Research, INFORMS, vol. 50(3), pages 538-551, June.
    14. Gutierrez, Genaro J. & Kouvelis, Panagiotis & Kurawarwala, Abbas A., 1996. "A robustness approach to uncapacitated network design problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 362-376, October.
    15. Minghe Sun, 2005. "Warm-Start Routines for Solving Augmented Weighted Tchebycheff Network Programs in Multiple-Objective Network Programming," INFORMS Journal on Computing, INFORMS, vol. 17(4), pages 422-437, November.
    16. Fernandes, Lucinda Matos & Gouveia, Luis, 1998. "Minimal spanning trees with a constraint on the number of leaves," European Journal of Operational Research, Elsevier, vol. 104(1), pages 250-261, January.
    17. Gerald G. Brown & W. Matthew Carlyle, 2020. "Solving the Nearly Symmetric All-Pairs Shortest-Path Problem," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 279-288, April.
    18. Cortés, Pablo & Muñuzuri, Jesús & Guadix, José & Onieva, Luis, 2013. "Optimal algorithm for the demand routing problem in multicommodity flow distribution networks with diversification constraints and concave costs," International Journal of Production Economics, Elsevier, vol. 146(1), pages 313-324.
    19. Bernard Gendron & Luis Gouveia, 2017. "Reformulations by Discretization for Piecewise Linear Integer Multicommodity Network Flow Problems," Transportation Science, INFORMS, vol. 51(2), pages 629-649, May.
    20. Balaji Gopalakrishnan & Seunghyun Kong & Earl Barnes & Ellis Johnson & Joel Sokol, 2011. "A least-squares minimum-cost network flow algorithm," Annals of Operations Research, Springer, vol. 186(1), pages 119-140, June.

    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:proeco:v:98:y:2005:i:2:p:251-261. 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/ijpe .

    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.