Lexicographic optimization of Travelling Salesman Problem with multiple Job facilities and Precedence Constraints
Author(s):
Dr. Krishan Murari Agrawal, -, -, -
Keywords:
lexicographic approach, precedence constraints, travelling salesman problem,tour
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.
Article Details
Unique Paper ID: 153772

Publication Volume & Issue: Volume 5, Issue 7

Page(s): 378 - 382
Article Preview & Download


Share This Article

Join our RMS



Conference Alert

NCSEM 2024

National Conference on Sustainable Engineering and Management - 2024

Last Date: 15th March 2024

Latest Publication

Call For Paper

Volume 10 Issue 10

Last Date for paper submitting for March Issue is 25 June 2024

About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews

Contact Details

Telephone:6351679790
Email: editor@ijirt.org
Website: ijirt.org

Policies

Important Links

Browse Rsearch papers