arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2012.10053math.OCcs.AIcs.LG
收藏

车辆排序问题的实例空间分析

Instance Space Analysis for the Car Sequencing Problem

Monash University(莫纳什大学);Deakin University(迪肯大学);RMIT University(皇家墨尔本理工大学)

Yuan Sun, Samuel Esler, Dhananjay Thiruvady, Andreas T. Ernst, Xiaodong Li, Kerri Morgan

摘要:

我们研究了解决汽车排序问题的一个重要研究问题,即哪些特征使得实例难以解决?为此,我们对汽车排序问题进行了实例空间分析,通过提取问题特征向量来表征实例。为了将实例空间可视化,使用降维技术将特征向量投影到二维空间上。由此产生的二维可视化提供了新的见解用于测试的实例的特性,以及这些特性如何影响优化算法的行为。该分析指导我们构建一组新的具有一系列实例属性的基准实例。我们证明了这些新的实例比以前的基准更加多样化,包括一些更难解决的实例。我们介绍了两种新的算法来解决汽车排序问题,并将它们与文献中现有的四种方法进行比较。我们的新算法表现出竞争力,这个问题,但没有一个算法可以胜过所有其他的所有实例。这一发现促使我们建立了一个基于机器学习的算法选择模型,以识别算法在实例空间中的小生境,我们的分析有助于理解问题的难度,并选择合适的算法来解决给定的汽车排序问题实例。

英文摘要:

We investigate an important research question for solving the car sequencing problem, that is, which characteristics make an instance hard to solve? To do so, we carry out an instance space analysis for the car sequencing problem, by extracting a vector of problem features to characterize an instance. In order to visualize the instance space, the feature vectors are projected onto a two-dimensional space using dimensionality reduction techniques. The resulting two-dimensional visualizations provide new insights into the characteristics of the instances used for testing and how these characteristics influence the behaviours of an optimization algorithm. This analysis guides us in constructing a new set of benchmark instances with a range of instance properties. We demonstrate that these new instances are more diverse than the previous benchmarks, including some instances that are significantly more difficult to solve. We introduce two new algorithms for solving the car sequencing problem and compare them with four existing methods from the literature. Our new algorithms are shown to perform competitively for this problem but no single algorithm can outperform all others over all instances. This observation motivates us to build an algorithm selection model based on machine learning, to identify the niche in the instance space that an algorithm is expected to perform well on. Our analysis helps to understand problem hardness and select an appropriate algorithm for solving a given car sequencing problem instance.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑