首页 | 本学科首页   官方微博 | 高级检索  
     


A hybrid particle swarm optimization approach for the sequential ordering problem
Authors:Davide Anghinolfi  Roberto Montemanni  Massimo Paolucci  Luca Maria Gambardella
Affiliation:1. Department of Communication, Computer and System Sciences (DIST), University of Genova, Via Opera Pia 13, 16145 Genova, Italy;2. Istituto Dalle Molle di Studi sull’Intelligenza Artificiale (IDSIA), Galleria 2, CH-6928 Manno, Switzerland
Abstract:The sequential ordering problem is a version of the asymmetric travelling salesman problem where precedence constraints on vertices are imposed. A tour is feasible if these constraints are fulfilled, and the objective is to find a feasible solution with minimum cost.
Keywords:Sequential ordering problem  Metaheuristic algorithms  Particle swarm optimization
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号