.png){kind=icon}
.png){kind=icon}
Return
Genetic local search for multi-objective combinatorial optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(01)00104-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The paper presents a new genetic local search (GLS) algorithm for mufti-objective combinatorial optimization (MOCO). The goal of the algorithm is to generate in a short time a set of approximately efficient solutions that will allow the decision maker to choose a good compromise solution. In each iteration, the algorithm draws at random a utility function and constructs a temporary population composed of a number of best solutions among the prior generated solutions. Then, a pair of solutions selected at random from the temporary population is recombined. Local search procedure is applied to each offspring. Results of the presented experiment indicate that the algorithm outperforms other mufti-objective methods based on GLS and a Pareto ranking-based mufti-objective genetic algorithm (GA) on travelling salesperson problem (TSP). (C) 2002 Elsevier Science B.V. All rights reserved.
Keywords:
multi-objective combinatorial optimization
metaheuristics
genetic local search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available