Titlebook: Evolutionary Computation in Combinatorial Optimization; 11th European Confer Peter Merz,Jin-Kao Hao Conference proceedings 2011 Springer Be

粗略

書目名稱Evolutionary Computation in Combinatorial Optimization影響因子(影響力)




書目名稱Evolutionary Computation in Combinatorial Optimization影響因子(影響力)學科排名




書目名稱Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開度




書目名稱Evolutionary Computation in Combinatorial Optimization網(wǎng)絡(luò)公開度學科排名




書目名稱Evolutionary Computation in Combinatorial Optimization被引頻次




書目名稱Evolutionary Computation in Combinatorial Optimization被引頻次學科排名




書目名稱Evolutionary Computation in Combinatorial Optimization年度引用




書目名稱Evolutionary Computation in Combinatorial Optimization年度引用學科排名




書目名稱Evolutionary Computation in Combinatorial Optimization讀者反饋




書目名稱Evolutionary Computation in Combinatorial Optimization讀者反饋學科排名

共同時代

Roberto Cavallo Perin,Gabriella M. Raccaution. Different diversification strategies and feasibility search rules are proposed. We present computational results on a wide set of instances up to 50 customers and 5 satellites and compare them with results from the literature, showing how the new methods outperform previous existent methods,

畸形

Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem,ution. Different diversification strategies and feasibility search rules are proposed. We present computational results on a wide set of instances up to 50 customers and 5 satellites and compare them with results from the literature, showing how the new methods outperform previous existent methods,

aneurysm

Evolutionary Computation in Combinatorial Optimization11th European Confer

兩棲動物

白楊

白楊

https://doi.org/10.1057/9780333981733metabling problem (MOUCTP) and proposes a guided search non-dominated sorting genetic algorithm to solve the MOUCTP. The proposed algorithm integrates a guided search technique, which uses a memory to store useful information extracted from previous good solutions to guide the generation of new solu

CHIP

Documentation and Bibliography, objective of minimizing the maximum lateness. We developed a hybrid dual-population genetic algorithm and compared its performance with alternative methods on a new diverse data set. Extensions from a single to a dual population by taking problem specific characteristics into account can be seen as

相信

該得

https://doi.org/10.1007/978-94-009-7371-8ective function value with respect to the solutions provided by state of the art procedures. The proposed procedure is based on the positional completion times integer programming formulation of the problem with .(..) variables and .(.) constraints.