https://journal.riverpublishers.com/index.php/JGEU/issue/feed 2026-05-25T01:50:06+00:00 JGEU Executive Editor & Editor-in-Chief mangeyram@geu.ac.in Open Journal Systems <h1>Journal of Graphic Era University</h1> <p>Published by Graphic Era (Deemed to be University), India</p> <p>The frequency of publication is Bi annual</p> <p><strong><em>Journal of Graphic Era University</em></strong> is an international journal of science and technology which published the articles/review papers/case studies that demonstrate interaction between various disciplines such as electronics engineering, mechanical and automobile engineering, petroleum engineering, computer science &amp; engineering, electrical engineering, civil engineering, management, mathematical sciences, space sciences, allied sciences and humanities, biotechnology and their applications.<br />JGEU is an Open Access Journal, and does not charge readers or their institutions for access to the journal articles. The open access supports the rights of users to read, download, copy, distribute, print, search, or link to the full texts of these articles provided they are properly acknowledged and cited.</p> https://journal.riverpublishers.com/index.php/JGEU/article/view/517 2026-05-25T01:45:24+00:00 Santosh Kumar OAM Santosh.Kumarau@gmail.com Elias Munapo emunapo@gmail.com Trust Tawanda trust.tawanda@nust.ac.za

<p>This paper presents a heuristic for solving a M-salesmen problem, when M&gt;1, and these M-salesmen have different home stations, from where their tour will begin and end. Once again, the index restricted shortest connected tree approach has been applied to identify two independent index restricted connected paths, which have been interpreted as equivalent to the required tours for M-salesmen. Situation of more than one salesman is a natural extension that can arise in all industrial and commercial situations where the salesman tours have applications.</p>

2026-05-25T00:00:00+00:00 Copyright (c) 2026