An Efficient Heuristic Algorithm for the Traveling Salesman Problem

机译：旅行商问题的一种有效启发式算法

获取原文

获取原文并翻译 | 示例

页面导航

摘要
著录项
相似文献
相关主题

摘要

This paper presents a new heuristic algorithm based on combining branch and bound algorithm and a dynamic simulation model for the traveling salesman problem. The approach uses the simulation results for creating the best tours within the branch and bound tree. The most advantage of this approach lies in the learning profcedure both in simulation process and B&B algorithm. In order to test the efficiency of the proposed algorithm, several computational experiments were conducted over middle-scale and large-scale problems. As the computational results show the algorithm can be used easily in practice with reasonable accuracy and speed.

机译：提出了一种结合分支定界算法的启发式算法和旅行商问题的动态仿真模型。该方法使用模拟结果在分支树和绑定树中创建最佳游览。这种方法的最大优势在于模拟过程和B＆B算法的学习过程。为了测试所提算法的效率，针对中，大型问题进行了多次计算实验。计算结果表明，该算法可在实际中以合理的准确性和速度轻松地使用。

著录项

来源
《Advanced manufacturing and sustainable logistics》|2010年|P.384-395|共12页
会议地点 Paderborn(DE);Paderborn(DE)
作者
Parham Azimi; Peyman Daneshvar;
展开▼
作者单位

Islamic Azad University (Qazvin Branch);

rnIslamic Azad University (Naragh Branch);

展开▼
会议组织
原文格式 PDF
正文语种 eng
中图分类电子贸易、网上贸易;信息处理（信息加工）;
关键词
traveling salesman problem; simulation; mathematical programming; branch and bound algorithm;

机译：旅行商问题；模拟;数学编程；分支定界算法;

相似文献

外文文献
中文文献
专利

1. Implementation analysis of efficient heuristic algorithms for the traveling salesman problem [J] . Dorabela Gamboa, Cesar Rego, Fred Glover Computers & operations research . 2006,第4期

机译：旅行商问题高效启发式算法的实现分析
2. An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem [J] . Majid Yousefikhoshbakht, Azam Dolatnejad BRAIN. Broad Research in Artificial Intelligence and Neurosciences . 2016,第3期

机译：求解旅行商问题的高效组合元启发式算法
3. An efficient heuristic algorithm for the bottleneck traveling salesman problem [J] . Ravi Ramakrishnan, Prabha Sharma, Abraham P. Punnen OPSEARCH . 2009,第3期

机译：瓶颈旅行商问题的一种有效启发式算法
4. An Efficient Heuristic for the Traveling Salesman Problem Based on a Growing SOM-like Algorithm [C] . Cristina Garcia, Jose Ali Moreno International Conference on Adaptive and Natural Computing Algorithms; 2005; Coimbra(PT) . 2005

机译：基于类SOM算法的旅行商问题高效启发式算法
5. A neural network heuristic for the traveling salesman problem. [D] . Nguyen, Tim Dang. 2002

机译：用于旅行商问题的启发式神经网络。
6. Efficient Constraint Handling in Electromagnetism-Like Algorithm for Traveling Salesman Problem with Time Windows [O] . Alkın Yurtkuran, Erdal Emel -1

机译：带时间窗的旅行商问题的类似电磁算法的有效约束处理
7. Implementation Analysis of Efficient Heuristic Algorithms for the Traveling Salesman Problem [O] . Dorabela Gamboa, César Rego, Fred Glover 2004

机译：旅行商问题高效启发式算法的实现分析

An Efficient Heuristic Algorithm for the Traveling Salesman Problem

摘要

著录项

相似文献

相关主题

期刊订阅