P. Merz, 2001, "On the Performance of Memetic Algorithms in Combinatorial Optimization ", 2nd Workshop on Memetic Algorithms, GECCO, San Francisco, CA, USA. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Balance between Genetic Search and Local Search in.. - Ishibuchi, Yoshida.. (2002) (1 citation) (Correct)
....values (i.e. x x f f f = D ) between the current solution x and its neighbor x instead of the objective value ) x f of x . In the case of TSPs, the complexity of the calculation of f D is ) 1 ( O while that of ) x f is ) n O where n is the number of cities (for details, see [28], 29] For example, let us consider Fig. 1 where a new tour is generated by removing the edges (1, 2) and (6, 7) and adding the edges (1, 6) and (2, 7) The difference in the objective values between the two tours can be calculated from only those four edges. On the other hand, when a new tour ....
P. Merz, "On the performance of memetic algorithms in combinatorial optimization," Proc. of 2001.
Artificial Intelligence Technologies in Complex Engineering Design - Ong (2002) (Correct)
No context found.
P. Merz, 2001, "On the Performance of Memetic Algorithms in Combinatorial Optimization ", 2nd Workshop on Memetic Algorithms, GECCO, San Francisco, CA, USA.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC