Pages that link to "Item:Q1762590"

The following pages link to Recent advances in memetic algorithms. (Q1762590):

Displaying 33 items.

• Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
• Decomposition based hybrid metaheuristics (Q319285) (← links)
• The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
• Coupling a memetic algorithm to simulation models for promising multi-period asset allocations (Q336580) (← links)
• Hybridizing local search algorithms for global optimization (Q480947) (← links)
• Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
• Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833) (← links)
• A unified framework for population-based metaheuristics (Q646652) (← links)
• Memetic algorithm based on improved inver-over operator and Lin-Kernighan local search for the Euclidean traveling salesman problem (Q660966) (← links)
• Clonal selection: an immunological algorithm for global optimization over continuous spaces (Q695337) (← links)
• A study on meme propagation in multimemetic algorithms (Q747522) (← links)
• A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration (Q833646) (← links)
• A memetic algorithm for evolutionary prototype selection: A scaling up approach (Q931710) (← links)
• A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
• A memetic algorithm with a large neighborhood crossover operator for the generalized traveling salesman problem (Q975992) (← links)
• The impact of parametrization in memetic evolutionary algorithms (Q1029357) (← links)
• Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report (Q1038282) (← links)
• Efficient sensor network management for asset localization (Q1654358) (← links)
• Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
• Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms (Q2029299) (← links)
• Local search with groups of step sizes (Q2060555) (← links)
• A comparison between memetic algorithm and genetic algorithm for an integrated logistics network with flexible delivery path (Q2241315) (← links)
• A bi-level model and memetic algorithm for arc interdiction location-routing problem (Q2244003) (← links)
• Minimizing total completion time in the flexible flowshop sequence-dependent group scheduling problem (Q2341222) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)
• A review on evolutionary algorithms in Bayesian network learning and inference tasks (Q2446376) (← links)
• Hybridizations of Metaheuristics With Branch & Bound Derivates (Q2950520) (← links)
• Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms (Q3509425) (← links)
• Implementation of Multiobjective Memetic Algorithms for Combinatorial Optimization Problems: A Knapsack Problem Case Study (Q3627774) (← links)
• A Memetic Coevolutionary Multi-Objective Differential Evolution Algorithm (Q3627802) (← links)
• Centroid-based memetic algorithm – adaptive Lamarckian and Baldwinian learning (Q5497411) (← links)
• Parallel memetic algorithm for optimal control of multi-stage catalytic reactions (Q6043115) (← links)
• Arc routing problems: A review of the past, present, and future (Q6087068) (← links)