scientific article; zbMATH DE number 2102231
From MaRDI portal
Publication:4817408
zbMath1070.90102MaRDI QIDQ4817408
Marco Chiarandini, Thomas Stützle, Luís Paquete
Publication date: 22 September 2004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Variable and large neighborhood search to solve the multiobjective set covering problem, Anytime Pareto local search, The multi-objective generalized consistent vehicle routing problem, Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows, Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem, Multi-directional local search, A hybrid approach for biobjective optimization, On operators and search space topology in multi-objective flow shop scheduling, Peeking beyond peaks: challenges and research potentials of continuous multimodal multi-objective optimization, A two-phase multi-objective metaheuristic for a green UAV grid routing problem, An MO‐GVNS algorithm for solving a multiobjective hybrid flow shop scheduling problem, Improving the anytime behavior of two-phase local search, A penalty-based multi-objectivization approach for single objective optimization, A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems, A matheuristic approach to solve the multiobjective beam angle optimization problem in intensity‐modulated radiation therapy, A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems, Connectedness of efficient solutions in multiple objective combinatorial optimization, Lorenz dominance based algorithms to solve a practical multiobjective problem, On local optima in multiobjective combinatorial optimization problems, Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem, On dominance-based multiobjective local search: design, implementation and experimental analysis on scheduling and traveling salesman problems, Box-constrained multi-objective optimization: A gradient-like method without ``a priori scalarization, Multi-objective vehicle routing problems, Two-phase Pareto local search for the biobjective traveling salesman problem, Hybrid population-based algorithms for the bi-objective quadratic assignment problem, Empirical study of exact algorithms for the multi-objective spanning tree, Speed-up techniques for solving large-scale biobjective TSP, Multi-objective approaches for the open-pit mining operational planning problem, A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
Uses Software
