Artificial Evolution: 14th International Conference, Évolution Artificielle, EA 2019, Mulhouse, France, October 29–30, 2019, Revised Selected Papers
暂无分享,去创建一个
Elisa Bertino | Arnaud Liefooghe | Nicolas Monmarché | Pierrick Legrand | Evelyne Lutton | Marc Schoenauer | Lhassane Idoumghar | Marc Schoenauer | E. Lutton | A. Liefooghe | E. Bertino | P. Legrand | N. Monmarché | L. Idoumghar
[1] Pierre Collet,et al. An archived-based stochastic ranking evolutionary algorithm (asrea) for multi-objective optimization , 2010, GECCO '10.
[2] Raffaele Cerulli,et al. A novel discretization scheme for the close enough traveling salesman problem , 2017, Comput. Oper. Res..
[3] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[4] Ahmed Kattan,et al. Geometric Generalisation of Surrogate Model Based Optimisation to Combinatorial Spaces , 2011, EvoCOP.
[5] Thomas Bartz-Beielstein,et al. Distance Measures for Permutations in Combinatorial Efficient Global Optimization , 2014, PPSN.
[6] Luigi dell’Olio,et al. Optimizing bus stop spacing in urban areas , 2010 .
[7] King-Sun Fu,et al. On the generalized Karhunen-Loeve expansion (Corresp.) , 1967, IEEE Trans. Inf. Theory.
[8] José Torres-Jiménez,et al. An improved simulated annealing algorithm for bandwidth minimization , 2008, Eur. J. Oper. Res..
[9] Gabriel Ramírez-Torres,et al. A New Branch and Bound Algorithm for the Cyclic Bandwidth Problem , 2012, MICAI.
[10] Enrique Alba,et al. A Methodology to Find the Elementary Landscape Decomposition of Combinatorial Optimization Problems , 2011, Evolutionary Computation.
[11] Jin-Kao Hao,et al. Memetic Algorithms in Discrete Optimization , 2012, Handbook of Memetic Algorithms.
[12] Dun-Wei Gong,et al. Multi-Objective Optimization Problems Using Cooperative Evolvement Particle Swarm Optimizer , 2013 .
[13] Erianto Ongko,et al. Performance of Arithmetic Crossover and Heuristic Crossover in Genetic Algorithm Based on Alpha Parameter , 2017 .
[14] Ran Liu,et al. An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits , 2019, Comput. Oper. Res..
[15] Jin-Kao Hao,et al. A Study of Multi-parent Crossover Operators in a Memetic Algorithm , 2010, PPSN.
[16] Alessandro Agnetis,et al. Nondominated Schedules for a Job-Shop with Two Competing Users , 2000, Comput. Math. Organ. Theory.
[17] Xiucheng Guo,et al. OPTIMIZATION OF URBAN MINI-BUS STOP SPACING : A CASE STUDY OF SHANGHAI ( CHINA ) , 2017 .
[18] Bernd Freisleben,et al. A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.
[19] Janez Brest,et al. Single objective real-parameter optimization: Algorithm jSO , 2017, 2017 IEEE Congress on Evolutionary Computation (CEC).
[20] Nikolaus Hansen,et al. Evaluating the CMA Evolution Strategy on Multimodal Test Functions , 2004, PPSN.
[21] Tolga Bektas,et al. Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem , 2011, Transp. Sci..
[22] Laetitia Vermeulen-Jourdan,et al. A comparative study of meta-heuristic algorithms for solving UAV path planning , 2018, 2018 IEEE Symposium Series on Computational Intelligence (SSCI).
[23] L. S. Pereira,et al. Crop evapotranspiration : guidelines for computing crop water requirements , 1998 .
[24] Teresa Bernarda Ludermir,et al. Many Objective Particle Swarm Optimization , 2016, Inf. Sci..
[25] Ahmet B. Keha,et al. Scheduling interfering job sets on parallel machines , 2009, Eur. J. Oper. Res..
[26] Jin-Kao Hao,et al. A tabu search based memetic algorithm for the max-mean dispersion problem , 2016, Comput. Oper. Res..
[27] Jin-Kao Hao,et al. Memetic search for the max-bisection problem , 2013, Comput. Oper. Res..
[28] Pierre Hansen,et al. Variable Neighborhood Search , 2018, Handbook of Heuristics.
[29] Ivo Sousa-Ferreira,et al. A review of velocity-type PSO variants , 2017 .
[30] Yongqiang Ye,et al. An enhanced genetic algorithm for constrained knapsack problems in dynamic environments , 2019, Natural Computing.
[31] Imdat Kara. Integer Linear Programming Formulation of the Generalized Vehicle Routing Problem , 2003 .
[32] Fakhri Karray,et al. Multi-objective Feature Selection with NSGA II , 2007, ICANNGA.
[33] K. Sörensen,et al. Hamiltonian paths in large clustered routing problems , 2008 .
[34] Mauricio G. C. Resende,et al. Biased random-key genetic algorithms for combinatorial optimization , 2011, J. Heuristics.
[35] Arnold L. Rosenberg,et al. Bounds on the costs of data encodings , 2005, Mathematical systems theory.
[36] Philippe Lacomme,et al. Order-first split-second methods for vehicle routing problems: A review , 2014 .
[37] S. C. Wirasinghe,et al. Spacing of Bus-Stops for Many to Many Travel Demand , 1981 .
[38] Erik D. Demaine,et al. Energy-Efficient Algorithms , 2016, ITCS.
[39] F. Agakov,et al. Application of high-dimensional feature selection: evaluation for genomic prediction in man , 2015, Scientific Reports.
[40] Isabelle Guyon,et al. An Introduction to Variable and Feature Selection , 2003, J. Mach. Learn. Res..
[41] Xin-She Yang,et al. Bio-Inspired Computation and Applications in Image Processing , 2016 .
[42] Abdullah Al Mamun,et al. Evolutionary big optimization (BigOpt) of signals , 2015, 2015 IEEE Congress on Evolutionary Computation (CEC).
[43] Steven B. Johnson,et al. Development of a simple potato growth model for use in crop-pest management , 1986 .
[44] Xing Zhang,et al. Online Path Planning for UAV Using an Improved Differential Evolution Algorithm , 2011 .
[45] Saúl Zapotecas Martínez,et al. Traffic Signal Optimization: Minimizing Travel Time and Fuel Consumption , 2015, Artificial Evolution.
[46] Shengxiang Yang,et al. Genetic Algorithms with Memory- and Elitism-Based Immigrants in Dynamic Environments , 2008, Evolutionary Computation.
[47] Fernando Boavida,et al. An Energy-Efficient Ant-Based Routing Algorithm for Wireless Sensor Networks , 2006, ANTS Workshop.
[48] Steve R. Gunn,et al. Result Analysis of the NIPS 2003 Feature Selection Challenge , 2004, NIPS.
[49] Helena Ramalhinho Dias Lourenço,et al. Iterated Local Search , 2001, Handbook of Metaheuristics.
[50] David B. Fogel,et al. Evolving neural networks to play checkers without relying on expert knowledge , 1999, IEEE Trans. Neural Networks.
[51] Christian Prins,et al. Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size , 2014, Int. Trans. Oper. Res..
[52] Lin Yixun,et al. THE CYCLIC BANDWIDTH PROBLEM , 1994 .
[53] Mehran Yazdi,et al. An efficient algorithm for function optimization: modified stem cells algorithm , 2012 .
[54] E. D. Weinberger,et al. The NK model of rugged fitness landscapes and its application to maturation of the immune response. , 1989, Journal of theoretical biology.
[55] Reza Tavakkoli-Moghaddam,et al. A bi-objective green home health care routing problem , 2018, Journal of Cleaner Production.
[56] Peter G Furth,et al. Optimal Bus Stop Spacing Through Dynamic Programming and Geographic Modeling , 2000 .
[57] Martin Pelikan. A C++ Implementation of the Bayesian Optimization Algorithm (BOA) with Decision Graphs , 2000 .
[58] Xiaolan Xie,et al. Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care , 2013, Eur. J. Oper. Res..
[59] Pablo Moscato,et al. A Gentle Introduction to Memetic Algorithms , 2003, Handbook of Metaheuristics.
[60] Enrique Alba,et al. SMPSO: A new PSO-based metaheuristic for multi-objective optimization , 2009, 2009 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making(MCDM).
[61] Demis Hassabis,et al. Mastering the game of Go without human knowledge , 2017, Nature.
[62] David W. Coit,et al. Multi-objective optimization using genetic algorithms: A tutorial , 2006, Reliab. Eng. Syst. Saf..
[63] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[64] Steve B. Jiang,et al. Multi-Objective-Based Radiomic Feature Selection for Lesion Malignancy Classification , 2018, IEEE Journal of Biomedical and Health Informatics.
[65] Jin-Kao Hao,et al. Memetic search for the quadratic assignment problem , 2015, Expert Syst. Appl..
[66] Lawrence Davis,et al. Applying Adaptive Algorithms to Epistatic Domains , 1985, IJCAI.
[67] Sébastien Vérel,et al. Local Optima Networks of NK Landscapes With Neutrality , 2011, IEEE Transactions on Evolutionary Computation.
[68] Shengxiang Yang,et al. Genetic Algorithms with Elitism-Based Immigrants for Changing Optimization Problems , 2007, EvoWorkshops.
[69] Ren-Jye Yang,et al. Approximation methods in multidisciplinary analysis and optimization: a panel discussion , 2004 .
[70] Alessandro Agnetis,et al. A Lagrangian approach to single-machine scheduling problems with two competing agents , 2009, J. Sched..
[71] Marco Laumanns,et al. Scalable multi-objective optimization test problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).
[72] D. Cox. The Regression Analysis of Binary Sequences , 1958 .
[73] Adil Baykasoglu,et al. Quantum firefly swarms for multimodal dynamic optimization problems , 2019, Expert Syst. Appl..
[74] William E. Hart,et al. Memetic Evolutionary Algorithms , 2005 .
[75] de Ag Ton Kok,et al. Analysis of travel times and CO2 emissions in time-dependent vehicle routing , 2012 .
[76] Véronique Beaujouan,et al. Modelling the effect of the spatial distribution of agricultural practices on nitrogen fluxes in rural catchments , 2001 .
[77] Thomas Bck,et al. Self-adaptation in genetic algorithms , 1991 .
[78] Jean-Charles Billaut,et al. Solving multi-agent scheduling problems on parallel machines with a global objective function , 2014, RAIRO Oper. Res..
[79] Shengxiang Yang,et al. Constructing dynamic test environments for genetic algorithms based on problem difficulty , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).
[80] Luís Torgo,et al. OpenML: networked science in machine learning , 2014, SKDD.
[81] Richard E. Korf,et al. Depth-First Iterative-Deepening: An Optimal Admissible Tree Search , 1985, Artif. Intell..
[82] Frédéric Lardeux,et al. Comparative Study of Different Memetic Algorithm Configurations for the Cyclic Bandwidth Sum Problem , 2018, PPSN.
[83] Yang Liu,et al. Survey on computational-intelligence-based UAV path planning , 2018, Knowl. Based Syst..
[84] David E. Goldberg,et al. Alleles, loci and the traveling salesman problem , 1985 .
[85] Jie Wu,et al. EECS: an energy efficient clustering scheme in wireless sensor networks , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..
[86] Ameur Soukhal,et al. Two-Agent Scheduling on an Unbounded Serial Batching Machine , 2012, ISCO.
[87] A. Agnetis,et al. Computing the Nash solution for scheduling bargaining problems , 2009 .
[88] J. K. Lenstra,et al. Complexity of vehicle routing and scheduling problems , 1981, Networks.
[89] Serestina Viriri,et al. A spy search mechanism for memetic algorithm in dynamic environments , 2019, Appl. Soft Comput..
[90] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..
[91] Gaël Varoquaux,et al. Scikit-learn: Machine Learning in Python , 2011, J. Mach. Learn. Res..
[92] Zhaodan Kong,et al. A Survey of Motion Planning Algorithms from the Perspective of Autonomous UAV Guidance , 2010, J. Intell. Robotic Syst..
[93] A. Kai Qin,et al. Self-adaptive differential evolution algorithm for numerical optimization , 2005, 2005 IEEE Congress on Evolutionary Computation.
[94] Javier Del Ser,et al. Extending the Speed-Constrained Multi-objective PSO (SMPSO) with Reference Point Based Preference Articulation , 2018, PPSN.
[95] R. Geoff Dromey,et al. An algorithm for the selection problem , 1986, Softw. Pract. Exp..
[96] Ozgur Koray Sahingoz,et al. A UAV path planning with parallel ACO algorithm on CUDA platform , 2014, 2014 International Conference on Unmanned Aircraft Systems (ICUAS).
[97] Paul A. Viola,et al. MIMIC: Finding Optima by Estimating Probability Densities , 1996, NIPS.
[98] Kenneth D. Boese,et al. Cost Versus Distance In the Traveling Salesman Problem , 1995 .
[99] Marc Ebner,et al. Engineering of Computer Vision Algorithms Using Evolutionary Algorithms , 2009, ACIVS.
[100] Adil Baykasoglu,et al. Dynamic optimization in binary search spaces via weighted superposition attraction algorithm , 2018, Expert Syst. Appl..
[101] Véronique Beaujouan,et al. Modélisation des transferts d'eau et d'azote dans les sols et les nappes. Développement d'un modèle conceptuel distribué. Applications à de petits bassins versants agricoles , 2001 .
[102] Thomas Stützle,et al. Automatic Algorithm Configuration Based on Local Search , 2007, AAAI.
[103] Raffaele Cerulli,et al. The Set Orienteering Problem , 2018, Eur. J. Oper. Res..
[104] Paolo Toth,et al. An Overview of Vehicle Routing Problems , 2002, The Vehicle Routing Problem.
[105] Richa Bansal,et al. A memetic algorithm for the cyclic antibandwidth maximization problem , 2011, Soft Comput..
[106] Kalyanmoy Deb,et al. An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints , 2014, IEEE Transactions on Evolutionary Computation.
[107] Leslie Pérez Cáceres,et al. The irace package: Iterated racing for automatic algorithm configuration , 2016 .
[108] Bernd Bischl,et al. OpenML: An R package to connect to the machine learning platform OpenML , 2017, Comput. Stat..
[109] Welch Bl. THE GENERALIZATION OF ‘STUDENT'S’ PROBLEM WHEN SEVERAL DIFFERENT POPULATION VARLANCES ARE INVOLVED , 1947 .
[110] Enrico Angelelli,et al. The Clustered Orienteering Problem , 2014, Eur. J. Oper. Res..
[111] S. G. Ponnambalam,et al. Data driven safe vehicle routing analytics: a differential evolution algorithm to reduce CO$$_{2}$$2 emissions and hazardous risks , 2018, Ann. Oper. Res..
[112] J. Ross Quinlan,et al. Simplifying decision trees , 1987, Int. J. Hum. Comput. Stud..
[113] José Antonio Lozano,et al. Path Planning for Single Unmanned Aerial Vehicle by Separately Evolving Waypoints , 2015, IEEE Transactions on Robotics.
[114] Shumeet Baluja,et al. A Method for Integrating Genetic Search Based Function Optimization and Competitive Learning , 1994 .
[115] J. Zico Kolter,et al. OptNet: Differentiable Optimization as a Layer in Neural Networks , 2017, ICML.
[116] K. Beven,et al. Model Calibration and Uncertainty Estimation , 2006 .
[117] A. Sima Etaner-Uyar,et al. A Framework to Hybridize PBIL and a Hyper-heuristic for Dynamic Environments , 2012, PPSN.
[118] Han Hoogeveen,et al. Multicriteria scheduling , 2005, Eur. J. Oper. Res..
[119] Edmund K. Burke,et al. A Classification of Hyper-Heuristic Approaches: Revisited , 2018, Handbook of Metaheuristics.
[120] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[121] C. D. Gelatt,et al. Optimization by Simulated Annealing , 1983, Science.
[122] R J Vaughan,et al. Optimum location of stops on a bus route , 1977 .
[123] Zhou Li,et al. Flight Path Planning Based on an Improved Genetic Algorithm , 2013, 2013 Third International Conference on Intelligent System Design and Engineering Applications.
[124] Ali Farhadi,et al. Target-driven visual navigation in indoor scenes using deep reinforcement learning , 2016, 2017 IEEE International Conference on Robotics and Automation (ICRA).
[125] Hans-Paul Schwefel,et al. Evolution strategies – A comprehensive introduction , 2002, Natural Computing.
[126] Gilbert Laporte,et al. Some applications of the clustered travelling salesman problem , 2000, J. Oper. Res. Soc..
[127] Jose Nilo G. Binongo,et al. The application of principal component analysis to stylometry , 1999 .
[128] D. J. Smith,et al. A Study of Permutation Crossover Operators on the Traveling Salesman Problem , 1987, ICGA.
[129] Hoong Chuin Lau,et al. Orienteering Problem: A survey of recent variants, solution approaches and applications , 2016, Eur. J. Oper. Res..
[130] Steven M. LaValle,et al. Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).
[131] Xin Yao,et al. Population-Based Incremental Learning With Associative Memory for Dynamic Environments , 2008, IEEE Transactions on Evolutionary Computation.
[132] Eckart Zitzler,et al. Indicator-Based Selection in Multiobjective Search , 2004, PPSN.
[133] Hong Jiang,et al. LSM-Tree Managed Storage for Large-Scale Key-Value Store , 2017, IEEE Transactions on Parallel and Distributed Systems.
[134] Shengxiang Yang,et al. Direct Memory Schemes for Population-Based Incremental Learning in Cyclically Changing Environments , 2016, EvoApplications.
[135] John Canny,et al. The complexity of robot motion planning , 1988 .
[136] Gilbert Laporte,et al. Some applications of the generalized vehicle routing problem , 2008, J. Oper. Res. Soc..
[137] Anis Koubaa,et al. Global path planning for mobile robots in large-scale grid environments using genetic algorithms , 2013, 2013 International Conference on Individual and Collective Behaviors in Robotics (ICBR).
[138] Jin-Kao Hao,et al. A memetic algorithm for the Minimum Sum Coloring Problem , 2013, Comput. Oper. Res..
[139] Jean-Charles Billaut,et al. Single-machine multi-agent scheduling problems with a global objective function , 2011, Journal of Scheduling.
[140] Frédéric Lardeux,et al. Tabu search for the cyclic bandwidth problem , 2015, Comput. Oper. Res..
[141] James Smith,et al. A tutorial for competent memetic algorithms: model, taxonomy, and design issues , 2005, IEEE Transactions on Evolutionary Computation.
[142] Jérôme Darbon,et al. Fast nonlocal filtering applied to electron cryomicroscopy , 2008, 2008 5th IEEE International Symposium on Biomedical Imaging: From Nano to Macro.
[143] F. D. Whisler,et al. Crop simulation models in agronomic systems , 1986 .
[144] Wendi Heinzelman,et al. Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.
[145] Shengxiang Yang,et al. A hybrid immigrants scheme for genetic algorithms in dynamic environments , 2007, Int. J. Autom. Comput..
[146] Xiaodong Li. Multimodal Optimization using Niching Methods , 2016 .
[147] Claudio De Stefano,et al. Variable-Length Representation for EC-Based Feature Selection in High-Dimensional Data , 2019, EvoApplications.
[148] Fred W. Glover,et al. Memetic Search for Identifying Critical Nodes in Sparse Graphs , 2017, IEEE Transactions on Cybernetics.
[149] Anthony A. Saka,et al. MODEL FOR DETERMINING OPTIMUM BUS-STOP SPACING IN URBAN AREAS , 2001 .
[150] Ponnuthurai Nagaratnam Suganthan,et al. Problem Definitions and Evaluation Criteria for the CEC 2014 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization , 2014 .
[151] Amir Hajjam El Hassani,et al. A memetic algorithm for a home health care routing and scheduling problem , 2018 .
[152] Gary W. Heiman. Understanding Research Methods and Statistics: An Integrated Introduction for Psychology , 1997 .
[153] R. Vohra,et al. The Orienteering Problem , 1987 .
[154] Marcin Andrychowicz,et al. Learning to learn by gradient descent by gradient descent , 2016, NIPS.
[155] Nikolaus Hansen,et al. A restart CMA evolution strategy with increasing population size , 2005, 2005 IEEE Congress on Evolutionary Computation.
[156] Xin Yao,et al. A Survey on Evolutionary Computation Approaches to Feature Selection , 2016, IEEE Transactions on Evolutionary Computation.
[157] Francisco Herrera,et al. A multi-objective evolutionary algorithm for an effective tuning of fuzzy logic controllers in heating, ventilating and air conditioning systems , 2012, Applied Intelligence.
[158] Gianpaolo Ghiani,et al. An efficient transformation of the generalized vehicle routing problem , 2000, Eur. J. Oper. Res..
[159] Jean-Michel Morel,et al. A non-local algorithm for image denoising , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[160] Patrick M. Reed,et al. How effective and efficient are multiobjective evolutionary algorithms at hydrologic model calibration , 2005 .
[161] Donald R. Jones,et al. Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..
[162] Jürgen Branke,et al. Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.
[163] Jon M. Peha,et al. Heterogeneous-criteria scheduling: Minimizing weighted number of tardy jobs and weighted completion time , 1995, Comput. Oper. Res..
[164] Adrien Goëffon,et al. Climbing combinatorial fitness landscapes , 2015, Appl. Soft Comput..
[165] A. Sima Etaner-Uyar,et al. A hybrid multi-population framework for dynamic environments combining online and offline learning , 2013, Soft Comput..
[166] M Reyes Sierra,et al. Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art , 2006 .
[167] Andrew M. Sutton,et al. Efficient identification of improving moves in a ball for pseudo-boolean problems , 2014, GECCO.
[168] Juan Carlos Rivera,et al. Selective Vehicle Routing Problem: A Hybrid Genetic Algorithm Approach , 2019, EA.
[169] Jacob Scharcanski,et al. Feature selection for face recognition based on multi-objective evolutionary wrappers , 2013, Expert Syst. Appl..
[170] Petros Koumoutsakos,et al. Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES) , 2003, Evolutionary Computation.
[171] Dirk Van Oudheusden,et al. The orienteering problem: A survey , 2011, Eur. J. Oper. Res..
[172] Sayan Mukherjee,et al. Feature Selection for SVMs , 2000, NIPS.
[173] Michel Gendreau,et al. A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows , 2013, Comput. Oper. Res..
[174] Jianqiao Yu,et al. UAV path planning using artificial potential field method updated by optimal control theory , 2016, Int. J. Syst. Sci..
[175] Qingfu Zhang,et al. MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition , 2007, IEEE Transactions on Evolutionary Computation.
[176] Olivier Grunder,et al. Multi-step ahead electricity price forecasting using a hybrid model based on two-layer decomposition technique and BP neural network optimized by firefly algorithm , 2017 .
[177] Ingo Rechenberg,et al. Evolutionsstrategie : Optimierung technischer Systeme nach Prinzipien der biologischen Evolution , 1973 .
[178] T. C. Edwin Cheng,et al. Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs , 2006, Theor. Comput. Sci..
[179] Agostinho C. Rosa,et al. Towards automatic image enhancement using genetic algorithms , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).
[180] Helen G. Cobb,et al. An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments , 1990 .
[181] Chandrika Kamath,et al. On the Selection of Dimension Reduction Techniques for Scientific Applications , 2015 .
[182] Dimitri N. Mavris,et al. Energy-Constrained Multi-UAV Coverage Path Planning for an Aerial Imagery Mission Using Column Generation , 2019, Journal of Intelligent & Robotic Systems.
[183] Janez Brest,et al. iL-SHADE: Improved L-SHADE algorithm for single objective real-parameter optimization , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).
[184] Amir Hajjam El Hassani,et al. An Improved Cuckoo Search for a Patient Transportation Problem with Consideration of Reducing Transport Emissions , 2018 .
[185] A. Sima Etaner-Uyar,et al. A new population based adaptive domination change mechanism for diploid genetic algorithms in dynamic environments , 2005, Soft Comput..
[186] Zhibin Jiang,et al. Daily scheduling of caregivers with stochastic times , 2018, Int. J. Prod. Res..
[187] R. Pesenti,et al. Multiple UAV cooperative path planning via neuro-dynamic programming , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).
[188] Siddhartha S. Srinivasa,et al. Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.
[189] Zbigniew Michalewicz,et al. Genetic Algorithms for the 0/1 Knapsack Problem , 1994, ISMIS.
[190] Changjiang Zheng,et al. The Bus Station Spacing Optimization Based on Game Theory , 2015 .
[191] Jonathan Schaeffer,et al. Checkers Is Solved , 2007, Science.
[192] Carter C. Price,et al. The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics , 2006 .
[193] Terence C. Fogarty,et al. Adaptive Combustion Balancing in Multiple Burner Boiler Using a Genetic Algorithm with Variable Range of Local Search , 1997, ICGA.
[194] Robert Hooke,et al. `` Direct Search'' Solution of Numerical and Statistical Problems , 1961, JACM.
[195] Van Genuchten,et al. A closed-form equation for predicting the hydraulic conductivity of unsaturated soils , 1980 .
[196] D. Raes,et al. AquaCrop — The FAO Crop Model to Simulate Yield Response to Water: II. Main Algorithms and Software Description , 2009 .
[197] Naomi S. Altman,et al. Points of significance: Comparing samples—part I , 2014, Nature Methods.
[198] Donald E. Knuth,et al. An Analysis of Alpha-Beta Pruning , 1975, Artif. Intell..
[199] Yaochu Jin,et al. Surrogate-assisted evolutionary computation: Recent advances and future challenges , 2011, Swarm Evol. Comput..
[200] Jin-Kao Hao,et al. An Iterated Three-Phase Search Approach for Solving the Cyclic Bandwidth Problem , 2019, IEEE Access.
[201] Kalyanmoy Deb,et al. Multimodal Optimization by Covariance Matrix Self-Adaptation Evolution Strategy with Repelling Subpopulations , 2017, Evolutionary Computation.
[202] Joseph Y.-T. Leung,et al. Scheduling two agents with controllable processing times , 2010, Eur. J. Oper. Res..
[203] Olivier Teytaud,et al. QR Mutations Improve Many Evolution Strategies: A Lot On Highly Multimodal Problems , 2016, GECCO.
[204] Michel Gendreau,et al. A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..
[205] Matthias Poloczek,et al. Bayesian Optimization of Combinatorial Structures , 2018, ICML.
[206] T. Tsiligirides,et al. Heuristic Methods Applied to Orienteering , 1984 .
[207] Trevor Hastie,et al. Statistical Learning with Sparsity: The Lasso and Generalizations , 2015 .
[208] Thomas Bartz-Beielstein,et al. Model-based methods for continuous and discrete global optimization , 2017, Appl. Soft Comput..
[209] Shengxiang Yang,et al. Environment identification-based memory scheme for estimation of distribution algorithms in dynamic environments , 2011, Soft Comput..
[210] James C. Bean,et al. Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..
[211] Tapabrata Ray,et al. A Multiple Surrogate Assisted Decomposition-Based Evolutionary Algorithm for Expensive Multi/Many-Objective Optimization , 2019, IEEE Transactions on Evolutionary Computation.
[212] Petr Posík. Estimation of Distribution Algorithms , 2006 .
[213] Gilbert Laporte,et al. The Pollution-Routing Problem , 2011 .
[214] Manmohan Sahoo. Classical and Evolutionary Image Contrast Enhancement Techniques: Comparison by Case Studies , 2017 .
[215] Aixia Guo,et al. Gene Selection for Cancer Classification using Support Vector Machines , 2014 .
[216] R. Fisher. XV.—The Correlation between Relatives on the Supposition of Mendelian Inheritance. , 1919, Transactions of the Royal Society of Edinburgh.
[217] Murray Campbell,et al. Deep Blue , 2002, Artif. Intell..
[218] Sun Xiu-xia,et al. A Route Planning's Method for Unmanned Aerial Vehicles Based on Improved A-Star Algorithm , 2008 .
[219] Pierre-François Dutot,et al. Tight Analysis of Relaxed Multi-organization Scheduling Algorithms , 2011, 2011 IEEE International Parallel & Distributed Processing Symposium.
[220] John J. Grefenstette,et al. Genetic Algorithms for Tracking Changing Environments , 1993, ICGA.
[221] J. Walsh. A Closed Set of Normal Orthogonal Functions , 1923 .
[222] Gilbert Laporte,et al. Some Applications of the Generalized Travelling Salesman Problem , 1996 .
[223] Francisco Herrera,et al. A taxonomy for the crossover operator for real‐coded genetic algorithms: An experimental study , 2003, Int. J. Intell. Syst..
[224] Gilbert Laporte,et al. The bi-objective Pollution-Routing Problem , 2014, Eur. J. Oper. Res..
[225] Kiyoshi Tanaka,et al. Controlling Dominance Area of Solutions and Its Impact on the Performance of MOEAs , 2007, EMO.
[226] Kalyanmoy Deb,et al. A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..
[227] David Sharp,et al. Ngram and Bayesian Classification of Documents for Topic and Authorship , 2003, Lit. Linguistic Comput..
[228] Eduardo Rodriguez-Tello,et al. An Improved Memetic Algorithm for the Antibandwidth Problem , 2011, Artificial Evolution.
[229] Jan Paul Siebert,et al. Vehicle Recognition Using Rule Based Methods , 1987 .
[230] Leon Messerschmidt,et al. Using Particle Swarm Optimization to Evolve Two-Player Game Agents , 2005 .
[231] Juan Carlos Rivera,et al. A Mixed-Integer Linear Programming Model for a Selective Vehicle Routing Problem , 2018, WEA.
[232] Ameur Soukhal,et al. Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs , 2017, Discret. Optim..
[233] Mike Preuss,et al. Multimodal Optimization by Means of Evolutionary Algorithms , 2015, Natural Computing Series.
[234] Andrei Horvat Marc,et al. New mathematical models of the generalized vehicle routing problem and extensions , 2012 .
[235] Christian Prins,et al. A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..
[236] Thomas Bartz-Beielstein,et al. Efficient global optimization for combinatorial problems , 2014, GECCO.
[237] Li Chen,et al. Image contrast enhancement using an artificial bee colony algorithm , 2018, Swarm Evol. Comput..
[238] Ioannis K. Nikolos,et al. Coordinated UAV path planning using Differential Evolution , 2005, Proceedings of the 2005 IEEE International Symposium on, Mediterrean Conference on Control and Automation Intelligent Control, 2005..
[239] B. Faverjon,et al. Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .
[240] Jürgen Branke,et al. Memory enhanced evolutionary algorithms for changing optimization problems , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).
[241] Sébastien Vérel,et al. SIALAC benchmark: on the design of adaptive algorithms for traffic lights problems , 2018, GECCO.
[242] Flora S. Tsai. Dimensionality reduction for computer facial animation , 2012, Expert Syst. Appl..
[243] Haibin Duan,et al. An improved constrained differential evolution algorithm for unmanned aerial vehicle global route planning , 2015, Appl. Soft Comput..
[244] Horst W. Hamacher,et al. Scheduling two agents on uniform parallel machines with makespan and cost functions , 2011, J. Sched..
[245] Enes Makalic,et al. A Simple Sampler for the Horseshoe Estimator , 2015, IEEE Signal Processing Letters.
[246] Frank Thomson Leighton,et al. A Framework for Solving VLSI Graph Layout Problems , 1983, J. Comput. Syst. Sci..
[247] Markus Wagner,et al. Learning a Reactive Restart Strategy to Improve Stochastic Search , 2017, LION.
[248] Bernd Freisleben,et al. Memetic Algorithms for the Traveling Salesman Problem , 2002, Complex Syst..
[249] Philip M. Lewis,et al. The characteristic selection problem in recognition systems , 1962, IRE Trans. Inf. Theory.
[250] Shengxiang Yang,et al. Memory-based immigrants for genetic algorithms in dynamic environments , 2005, GECCO '05.
[251] Sébastien Vérel,et al. Walsh functions as surrogate model for pseudo-boolean optimization problems , 2019, GECCO.
[252] Enrico Angelelli,et al. Optimal interval scheduling with a resource constraint , 2014, Comput. Oper. Res..
[253] Sébastien Vérel,et al. A Surrogate Model Based on Walsh Decomposition for Pseudo-Boolean Functions , 2018, PPSN.
[254] Dervis Karaboga,et al. AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .
[255] Andries Petrus Engelbrecht,et al. Comparing PSO structures to learn the game of checkers from zero knowledge , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..
[256] Paul Morris,et al. The Breakout Method for Escaping from Local Minima , 1993, AAAI.
[257] Olivier Teytaud,et al. A Rigorous Runtime Analysis for Quasi-Random Restarts and Decreasing Stepsize , 2011, Artificial Evolution.
[258] Carlos Cotta,et al. Memetic algorithms and memetic computing optimization: A literature review , 2012, Swarm Evol. Comput..
[259] Xiaohang Yue,et al. Novel Ant Colony Optimization Methods for Simplifying Solution Construction in Vehicle Routing Problems , 2016, IEEE Transactions on Intelligent Transportation Systems.
[260] Mengjie Zhang,et al. Multi-objective Feature Selection in Classification: A Differential Evolution Approach , 2014, SEAL.
[261] Jin-Kao Hao,et al. Memetic Search for the Generalized Quadratic Multiple Knapsack Problem , 2016, IEEE Transactions on Evolutionary Computation.
[262] Oliver Vornberger,et al. On Some Variants of the Bandwidth Minimization Problem , 1984, SIAM J. Comput..
[263] Yuri Pirola,et al. A study of the neutrality of Boolean function landscapes in genetic programming , 2012, Theor. Comput. Sci..
[264] Jürgen Branke,et al. Evolutionary optimization in uncertain environments-a survey , 2005, IEEE Transactions on Evolutionary Computation.
[265] Zbigniew Michalewicz,et al. Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.
[266] Thibaut Vidal,et al. Hybrid metaheuristics for the Clustered Vehicle Routing Problem , 2014, Comput. Oper. Res..