期刊
APPLIED SOFT COMPUTING
卷 13, 期 9, 页码 3806-3815出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.asoc.2013.05.009
关键词
Ant colony optimization; Compressed simulated annealing; Travelling salesman problem with time windows; Hybridization
资金
- Spanish Government [TIN2012-37930-C02-02]
- Belgian F.R.S.-FNRS
In combinatorial optimization it is not rare to find problems whose mathematical structure is nearly the same, differing only in some aspect related to the motivating application. For example, many problems in machine scheduling and vehicle routing have equivalent formulations and only differ with respect to the optimization objective, or particular constraints. Moreover, while some problems receive a lot of attention from the research community, their close relatives receive hardly any attention at all. Given two closely related problems, it is intuitive that it may be effective to adapt state-of-the-art algorithms-initially introduced for the well-studied problem variant-to the less-studied problem variant. In this paper we provide an example based on the travelling salesman problem with time windows that supports this intuition. In this context, the well-studied problem variant minimizes the travel time, while the less-studied problem variant minimizes the makespan. Indeed, the results show that the algorithms that we adapt from travel-time minimization to makespan minimization significantly outperform the existing state-of-the-art approaches for makespan minimization. (C) 2013 Elsevier B. V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据