Pages that link to "Item:Q5956204"

The following pages link to Genetic local search for multi-objective combinatorial optimization (Q5956204):

Displaying 50 items.

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• Preference-inspired co-evolutionary algorithms using weight vectors (Q319113) (← links)
• MEALS: a multiobjective evolutionary algorithm with local search for solving the bi-objective ring star problem (Q322470) (← links)
• Efficient meta-heuristics for the multi-objective time-dependent orienteering problem (Q323359) (← links)
• Parameter-less co-clustering for star-structured heterogeneous data (Q362150) (← links)
• A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems (Q363596) (← links)
• Multiobjective vehicle routing problem with fixed delivery and optional collections (Q375980) (← links)
• On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems (Q519093) (← links)
• A multi-objective production smoothing model with compressible operating times (Q638895) (← links)
• Solving the musical orchestration problem using multiobjective constrained optimization with a genetic local search approach (Q707734) (← links)
• Guided moth-flame optimiser for multi-objective optimization problems (Q828882) (← links)
• A multi-objective particle swarm for a flow shop scheduling problem (Q867030) (← links)
• A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP (Q869157) (← links)
• Local dominance and local recombination in MOEAs on \(0/1\) multiobjective knapsack problems (Q877676) (← links)
• MOTGA: a multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem (Q883311) (← links)
• Application of a genetic algorithm to the fuel reload optimization for a research reactor (Q883909) (← links)
• Multi-start and path relinking methods to deal with multiobjective Knapsack problems (Q940855) (← links)
• A hypercube queueing model embedded into a genetic algorithm for ambulance deployment on highways (Q940863) (← links)
• An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958) (← links)
• Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem (Q954938) (← links)
• A multi-objective scatter search for a dynamic cell formation problem (Q955612) (← links)
• Two-phase Pareto local search for the biobjective traveling salesman problem (Q972646) (← links)
• Local models-an approach to distributed multi-objective optimization (Q1001209) (← links)
• Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
• A multi-objective approach for robust airline scheduling (Q1046693) (← links)
• Genetic local search with distance preserving recombination operator for a vehicle routing problem. (Q1410618) (← links)
• Fuzzy rule selection by multi-objective genetic local search algorithms and rule evaluation measures in data mining. (Q1430852) (← links)
• Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem (Q1652176) (← links)
• Towards faster convergence of evolutionary multi-criterion optimization algorithms using Karush Kuhn Tucker optimality based local search (Q1652178) (← links)
• Many-objective Pareto local search (Q1653381) (← links)
• A hybrid approach for biobjective optimization (Q1662163) (← links)
• A cooperative swarm intelligence algorithm for multi-objective discrete optimization with application to the Knapsack problem (Q1694319) (← links)
• GISMOO: A new hybrid genetic/immune strategy for multiple-objective optimization (Q1761114) (← links)
• Improving convergence of evolutionary multi-objective optimization with local search: a concurrent-hybrid algorithm (Q1761699) (← links)
• On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study (Q1876139) (← links)
• A genetic algorithm approach to multiobjective land use planning (Q1886497) (← links)
• A hybrid multiobjective genetic algorithm for robust resource-constrained project scheduling with stochastic durations (Q1955186) (← links)
• Advancing local search approximations for multiobjective combinatorial optimization problems (Q2125231) (← links)
• Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
• Pareto uncertainty index for evaluating and comparing solutions for stochastic multiple objective problems (Q2178088) (← links)
• Memetic algorithms and hyperheuristics applied to a multiobjectivised two-dimensional packing problem (Q2250117) (← links)
• City-courier routing and scheduling problems (Q2253369) (← links)
• An optimization approach for ambulance location and the districting of the response segments on highways (Q2378357) (← links)
• A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times (Q2432854) (← links)
• Hierarchical co-clustering: off-line and incremental approaches (Q2435705) (← links)
• A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: weighted mean completion time and weighted mean tardiness (Q2456478) (← links)
• An empirical study on similarity-based mating for evolutionary multiobjective combinatorial optimization (Q2469583) (← links)
• Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm (Q2476643) (← links)
• Multi-objective vehicle routing problems (Q2480968) (← links)
• Multiobjective service restoration in electric distribution networks using a local search based heuristic (Q2482747) (← links)