A biased random-key genetic algorithm for the capacitated minimum spanning tree problem-Reference-Cited by-同舟云学术

A biased random-key genetic algorithm for the capacitated minimum spanning tree problem

Published:2015-05 Issue: Volume:57 Page:95-108
ISSN:0305-0548
Container-title:Computers & Operations Research
language:en
Short-container-title:Computers & Operations Research

Author:

Ruiz Efrain,Albareda-Sambola Maria,Fernández Elena^ORCID,Resende Mauricio G.C.

Funder

Spanish Ministry of Economy and Competitiveness and ERDF

Publisher

Elsevier BV

Subject

Management Science and Operations Research,Modelling and Simulation,General Computer Science

Reference55 articles.

1. Multiexchange neighborhood structures for the capacitated minimum spanning tree problem;Ahuja;Math Progr,2001

2. A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem;Ahuja;Oper Res Lett,2003

3. Capacitated minimum spanning trees;Amberg;Comb Optim Theory Pract,1996

4. Multiple center capacitated arc routing problems;Amberg;Eur J Oper Res,2000

5. Araque JR, Hall LA, Magnanti TL. Capacitated trees, capacitated routing, and associated polyhedra. Technical report SOR-90-12, Program in Statistics and Operations Research. Princeton University, Princeton, NJ. 1990.

Cited by 33 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Biased random-key genetic algorithms: A tutorial with applications;2024 8th International Conference on Intelligent Systems, Metaheuristics & Swarm Intelligence (ISMSI);2024-04-24

2. Biased random-key genetic algorithms: A review;European Journal of Operational Research;2024-03

3. Scatter search for capacitated minimum spanning tree;Advances in Engineering Software;2023-12

4. Valid inequalities for the non-unit demand capacitated minimum spanning tree problem with arc time windows and flow costs;International Journal of Production Research;2023-11-05

5. To improve the performance of genetic algorithms by using a novel selection operator;Journal of Statistical Computation and Simulation;2023-05-28