Copyright © 2025 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
@article{153772, author = {Dr. Krishan Murari Agrawal and - and - and -}, title = {Lexicographic optimization of Travelling Salesman Problem with multiple Job facilities and Precedence Constraints}, journal = {International Journal of Innovative Research in Technology}, year = {}, volume = {5}, number = {7}, pages = {378-382}, issn = {2349-6002}, url = {https://ijirt.org/article?manuscript=153772}, abstract = {Lexicographic Approach is used to solve a Travelling salesman problem with multiple Job facilities and Precedence Constraints. As multiple jobs are at various station so some stations may be left unvisited, so modified Cost matrix is made Then, according to the Lexicographic algorithm developed in this paper is followed, The Lexicographic algorithm thus developed is tested on MATLAB software also.}, keywords = { lexicographic approach, precedence constraints, travelling salesman problem,tour}, month = {}, }
Cite This Article
Submit your research paper and those of your network (friends, colleagues, or peers) through your IPN account, and receive 800 INR for each paper that gets published.
Join NowNational Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024
Submit inquiry