Titlebook: Evolutionary Computation in Combinatorial Optimization; 12th European Confer Jin-Kao Hao,Martin Middendorf Conference proceedings 2012 Spri

污點

expository

ELATE

https://doi.org/10.1007/978-3-322-83823-0ior, that is, they aim to maximize the quality of the Pareto front at each time step. Experimental results on the bi-objective traveling salesman problem show a large improvement of the proposed anytime PLS algorithm over the classical one.

Immunization

An NSGA-II Algorithm for the Green Vehicle Routing Problem,lutionary algorithm to solve GVRP benchmarks and perform statistical analysis to evaluate and validate the obtained results. The results show that the algorithm obtain good results and prove the explicit interest grant to emission minimization objective.

上腭

信條

Electrical Load Management in Smart Homes Using Evolutionary Algorithms,d power plants and electrical storages in an optimized way with respect to the given external signals. The nonlinearities present in the integer programming problem makes it difficult for exact solvers. The results of this paper show the efficacy of evolutionary algorithms for solving such combinatorial problems.

饒舌的人

Exact Computation of the Fitness-Distance Correlation for Pseudoboolean Functions with One Global Oosition of the problems defined over binary strings in which the objective function has one global optimum. We present some theoretical results that raise some doubts on using FDC as a measure of problem difficulty.

使顯得不重要

浸軟

Pareto Local Search Algorithms for Anytime Bi-objective Optimization,ior, that is, they aim to maximize the quality of the Pareto front at each time step. Experimental results on the bi-objective traveling salesman problem show a large improvement of the proposed anytime PLS algorithm over the classical one.

廚師

978-3-642-29123-4Springer-Verlag Berlin Heidelberg 2012