The Travelling Salesman Problem with Precedence Constraints

Author:

Ahmed Zakir Hussain,Pandit S. N. Narahari

Publisher

Springer Science and Business Media LLC

Subject

Management Science and Operations Research,Computer Science Applications,Information Systems,Management Information Systems

Reference14 articles.

1. Bianco L., Mingozzi S, Ricciardelli S, and Spadoni M. “Exact and Heuristic Procedures for the Travelling Salesman Problem with Precedence Constraints, Based on Dynamic Programming”. Information Systems & Operational Research, 32 (1994) 19–32.

2. Das S. “Routing And Allied Combinatorial Programming Problems: A Lexicographic Search Approach”. Ph.D. Thesis, Dibrugarh University, Assam, India (1976).

3. Deb K. “Optimization for Engineering Design: Algorithms and Examples”. Prentice Hall of India Pvt. Ltd., New Delhi, India (1995).

4. Goldberg D. E. “Genetic Algorithms in Search, Optimization, and Machine Learning”. Addison-Wesley, New York (1989).

5. Holland J. H. “Adaptation in Natural and Artificial Systems”. University of Michigan Press, Ann Arbor, MI (1975).

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

1. Unloading sequence planning for autonomous robotic container-unloading system using A-star search algorithm;Engineering Science and Technology, an International Journal;2024-02

2. Optimization of Non-Productive Tool Path in Drilling: A Review;IFAC-PapersOnLine;2021

3. Lexisearch for Modeling Pushbroom Imaging Systems;Proceedings of the 2019 3rd International Symposium on Computer Science and Intelligent Control;2019-09-25

4. An exact algorithm for the clustered travelling salesman problem;OPSEARCH;2012-09-28

5. A Data-Guided Lexisearch Algorithm for the Asymmetric Traveling Salesman Problem;Mathematical Problems in Engineering;2011

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3