Genetic algorithms and neighbourhood search-Reference-Cited by-同舟云学术

Genetic algorithms and neighbourhood search

Published:1994 Issue: Volume: Page:115-130
ISSN:0302-9743
Container-title:Evolutionary Computing
language:
Short-container-title:

Author:

Reeves Colin R.

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-58483-8_10.pdf

Reference46 articles.

1. E.Falkenauer and A.Delchambre (1992) A genetic algorithm for bin packing and line balancing. In Proceedings of the IEEE International Conference on Robotics and Automation.

2. C.R.Reeves (1993) Hybrid genetic algorithms for bin-packing and related problems. (submitted to Annals of OR).

3. C.R.Reeves (1993) A genetic algorithm for flowshop sequencing. To appear in Computers & Ops.Res.

4. J.L.BlantonJr. and R.L.Wainwright (1993) Multiple vehicle routing with time and capacity constraints using genetic algorithms. In [37].

5. P.Jog, J.Y.Suh and D. VanGucht (1991) The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the travelling salesman problem. In [38].

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

1. Neuro-semantic prediction of user decisions to contribute content to online social networks;Neural Computing and Applications;2022-06-22

2. Design of a Hybrid Genetic Algorithm for Time-Sensitive Networking;Lecture Notes in Computer Science;2020

3. A Survey on Program Analysis and Transformation;Computational Statistics and Mathematical Modeling Methods in Intelligent Systems;2019

4. Spatial Facility Management: A Step to Design Smart City;Geospatial Infrastructure, Applications and Technologies: India Case Studies;2018

5. Optimization of makespan for no-wait flowshop scheduling problems using efficient matheuristics;Omega;2016-10