Quasi-random initial population for genetic algorithms
H Maaranen, K Miettinen, MM Mäkelä - Computers & Mathematics with …, 2004 - Elsevier
The selection of the initial population in a population-based heuristic optimizationmethod is
important, since it affects the search for several iterations and often has an influence on the …
important, since it affects the search for several iterations and often has an influence on the …
On initial populations of a genetic algorithm for continuous optimization problems
H Maaranen, K Miettinen, A Penttinen - Journal of Global Optimization, 2007 - Springer
Genetic algorithms are commonly used metaheuristics for global optimization, but there has
been very little research done on the generation of their initial population. In this paper, we …
been very little research done on the generation of their initial population. In this paper, we …
Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
T Zhang, WA Chaovalitwongse, Y Zhang - Computers & Operations …, 2012 - Elsevier
In parallel with the growth of both domestic and international economies, there have been
substantial efforts in making manufacturing and service industries more environmental …
substantial efforts in making manufacturing and service industries more environmental …
An evolutionary method for complex-process optimization
In this paper we present a new evolutionary method for complex-process optimization. It is
partially based on the principles of the scatter search methodology, but it makes use of …
partially based on the principles of the scatter search methodology, but it makes use of …
Global optimization by continuous grasp
MJ Hirsch, CN Meneses, PM Pardalos… - Optimization Letters, 2007 - Springer
We introduce a novel global optimization method called Continuous GRASP (C-GRASP)
which extends Feo and Resende's greedy randomized adaptive search procedure (GRASP) …
which extends Feo and Resende's greedy randomized adaptive search procedure (GRASP) …
Continuous scatter search: an analysis of the integration of some combination methods and improvement strategies
Scatter search is an evolutionary method that shares with genetic algorithms, a well-known
evolutionary approach, the employment of a combination method that combines the features …
evolutionary approach, the employment of a combination method that combines the features …
[图书][B] 供应链不确定性管理: 技术与策略
张涛, 孙林岩 - 2005 - books.google.com
Page 1 物流供应链 丛书 供应链不确定性管理: 技术与策略 Managing Supply Chain Uncertainty:
Techniques and Strategies 张涛孙林岩 Zhang Tao Sun Linyan 清华大学出版社 Page 2 Page …
Techniques and Strategies 张涛孙林岩 Zhang Tao Sun Linyan 清华大学出版社 Page 2 Page …
Parallelizing simulated annealing algorithms based on high-performance computer
DJ Chen, CY Lee, CH Park, P Mendes - Journal of Global Optimization, 2007 - Springer
We implemented five conversions of simulated annealing (SA) algorithm from sequential-to-
parallel forms on high-performance computers and applied them to a set of standard …
parallel forms on high-performance computers and applied them to a set of standard …
Random search optimization approach for highly multi-modal nonlinear problems
J Jeżowski, R Bochenek, G Ziomek - Advances in Engineering Software, 2005 - Elsevier
The paper addresses a random search optimization method for nonlinear problems with
continuous variables. The approach, called LJ-MM algorithm, deals with both unconstrained …
continuous variables. The approach, called LJ-MM algorithm, deals with both unconstrained …
A novel global optimization technique for high dimensional functions
Several types of line search methods are documented in the literature and are well known
for unconstraint optimization problems. This paper proposes a modified line search method …
for unconstraint optimization problems. This paper proposes a modified line search method …