Author Login IJIRT Partner Network (IPN) Login

Lexicographic optimization of Travelling Salesman Problem with multiple Job facilities and Precedence Constraints

  • Unique Paper ID: 153772
  • Volume: 5
  • Issue: 7
  • PageNo: 378-382
  • 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.
Download article email to a friend

Cite This Article

  • ISSN: 2349-6002
  • Volume: 5
  • Issue: 7
  • PageNo: 378-382

Lexicographic optimization of Travelling Salesman Problem with multiple Job facilities and Precedence Constraints

Related Articles

Impact Factor
8.01 (Year 2024)
UGC Approved
Journal no 47859

Join Our IPN

IJIRT Partner Network

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 Now

Latest Publication

Archive

View More

Recent Conferences

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024 Last Date: 15th March 2024

Submit inquiry