$$\epsilon$$ - DANTE : an ant colony oriented depth search procedure-Reference-Cited by-同舟云学术

$$\epsilon$$ - DANTE : an ant colony oriented depth search procedure

Published:2010-02-03 Issue:1 Volume:15 Page:149-182
ISSN:1432-7643
Container-title:Soft Computing
language:en
Short-container-title:Soft Comput

Author:

Cardoso Pedro,Jesus Mário,Márquez Alberto

Publisher

Springer Science and Business Media LLC

Subject

Geometry and Topology,Theoretical Computer Science,Software

Link

http://link.springer.com/content/pdf/10.1007/s00500-010-0543-9.pdf

Reference55 articles.

1. Aarts E, Lenstra J (1997) Local search in combinatorial optimization. Wiley-Interscience Series in discrete mathematics and optimization. Wiley, London

2. Barán B, Schaerer M (2003) A multiobjective ant colony system for vehicle routing problem with time windows. In: 21st IASTED International Multi-Conference on Applied Informatics, Innsbruck, Austria, pp 97–102

3. Blum C (2005a) Ant colony optimization: introduction and recent trends. Phys Life Rev 2(4):353–373

4. Blum C (2005b) Beam–ACO—hybridizing ant colony optimization with beam search: an application to open shop scheduling. Comput Oper Res 32(6):1565–1591

5. Blum C, Roli A (2003) Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput Surv (CSUR) 35(3):268–308

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cultural heritage visits supported on visitors’ preferences and mobile devices;Universal Access in the Information Society;2019-06-18

2. A Cultural Heritage and Points of Interest Multi-Criteria Router Supported on Visitors Preferences;Proceedings of the 7th International Conference on Software Development and Technologies for Enhancing Accessibility and Fighting Info-exclusion;2016-12

3. Multi-objective ant colony optimization based on decomposition for bi-objective traveling salesman problems;Soft Computing;2011-09-16