scientific article; zbMATH DE number 1975100
From MaRDI portal
Publication:4424321
zbMath1036.90561MaRDI QIDQ4424321
Publication date: 4 September 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2632/26320479.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (23)
Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example ⋮ A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems ⋮ Anytime Pareto local search ⋮ Multiobjective optimization: when objectives exhibit non-uniform latencies ⋮ An evolutionary approach to generalized biobjective traveling salesperson problem ⋮ Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem ⋮ Exact algorithms for bi-objective ring tree problems with reliability measures ⋮ Multi‐objective optimization of the maritime cargo routing and scheduling problem ⋮ Improving the anytime behavior of two-phase local search ⋮ A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems ⋮ On local optima in multiobjective combinatorial optimization problems ⋮ An interactive approach for biobjective integer programs under quasiconvex preference functions ⋮ 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 ⋮ Multi-objective vehicle routing problems ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ Comparison between MOEA/D and NSGA-II on the Multi-Objective Travelling Salesman Problem ⋮ Multiobjective Memetic Algorithm and Its Application in Robust Airfoil Shape Optimization ⋮ Clusters of Non-dominated Solutions in Multiobjective Combinatorial Optimization: An Experimental Analysis ⋮ Speed-up techniques for solving large-scale biobjective TSP ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ Adaptive Iterated Local Search with Random Restarts for the Balanced Travelling Salesman Problem
Uses Software
This page was built for publication:
