期刊
COMPUTERS & OPERATIONS RESEARCH
卷 33, 期 12, 页码 3473-3493出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2005.02.017
关键词
capacitated arc routing problem; multi-objective optimization; metaheuristic; genetic algorithm
The capacitated arc routing problem (CARP) is a very hard vehicle routing problem for which the objective-in its classical form-is the minimization of the total cost of the routes. In addition, one can seek to minimize also the cost of the longest trip. In this paper, a multi-objective genetic algorithm is presented for this more realistic CARP. Inspired by the second version of the Non-dominated sorted genetic algorithm framework, the procedure is improved by using good constructive heuristics to seed the initial population and by including a local search procedure. The new framework and its different flavour is appraised on three sets of classical CARP instances comprising 81 files. Yet designed for a bi-objective problem, the best versions are competitive with state-of-the-art metaheuristics for the single objective CARP, both in terms of solution quality and computational efficiency: indeed, they retrieve a majority of proven optima and improve two best-known solutions. (c) 2005 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据