Design and analysis of stochastic local search for the multiobjective traveling salesman problem
نویسندگان
چکیده
منابع مشابه
Dynamics of local search heuristics for the traveling salesman problem
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algorithm is chosen as the study subject, and the well-known traveling salesman problem (TSP) serves as a problem testbed. This study constructs the search trajectory by using the time-delay method, evaluates the dynamics...
متن کاملEstimation-based Local Search for the Probabilistic Traveling Salesman Problem
In this paper, we propose an effective local search algorithm that makes use of empirical estimation techniques for a class of stochastic combinatorial optimization problems. We illustrate our approach and assess its performance on the probabilistic traveling salesman problem. Experimental results on a large set of instances show that our approach is very competitive.
متن کاملExperiments with Local Search Heuristics for the Traveling Salesman Problem
Abstract. In this paper, the experiments with local search heuristic algorithms for the traveling salesman problem (TSP) are described. Since the ordinary local search heuristics very seldom yield solutions of high quality, we investigate the enhanced local search algorithms using the extended neighbourhood structures. We also examine the performance of the local search heuristics in an iterate...
متن کاملExponential neighbourhood local search for the traveling salesman problem
Scope and Purpose { While exact algorithms can only be used for solving small or quite moderate instances of the traveling salesman problem (TSP), local search remains the main practical tool for nding near optimal solutions for large scale instances. Exponential neighbourhood local search (ENLS) is a relatively new direction in local search for the TSP. In ENLS, one nds the best among very lar...
متن کاملNew Genetic Local Search Operators for the Traveling Salesman Problem
In this paper an approach is presented to incorporate prob lem speci c knowledge into a genetic algorithm which is used to compute near optimum solutions to traveling salesman problems TSP The ap proach is based on using a tour construction heuristic for generating the initial population a tour improvement heuristic for nding local optima in a given TSP search space and new genetic operators fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2009
ISSN: 0305-0548
DOI: 10.1016/j.cor.2008.11.013