Journal of Graphic Era University

A Heuristic for Solving the M-salesmen (M > 1) Travelling Salesmen Tour Problem with Different Home Stations

Santosh Kumar OAM, Elias Munapo, Trust Tawanda — Mon, 25 May 2026 00:00:00 -0400

This paper presents a heuristic for solving a M-salesmen problem, when M>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.

A Comprehensive Overview of Sentiment Analysis: Evolution, Approaches, and Applications

Tue, 09 Jun 2026 00:00:00 -0400

Sentiment analysis (SA) also known as opinion mining is a tool to determine the sentiments associated with linguistic data and is used by a variety of organisations over various domain. SA analysis has proved to be an effective tool at various business levels, organisational levels etc. Big companies, organisations, governments use social media platforms to identify the sentiments of the target audience in order to enhance their services and products. Current study is a chronological survey of SA, its applications and various approaches that were developed over the time for SA. This paper focuses on various SA techniques developed and their real-world applications. Details of SA, types of SA, terminology and approaches related and developed overtime are discussed at length. Applications and works related SA in domains related to social media, big business, and political campaigns are also discussed.

Fuzzy Bounded Separation Method for Solving Fully Fuzzy Interval Integer Transportation Problems: A New Approach

Govind Pathak, Haridas Roy, Rakesh Kumar, Zahid Amin Malik — Wed, 17 Jun 2026 00:00:00 -0400

To solve fully fuzzy interval integer transportation problems, a new approach, known as the fuzzy bounded separation method, is proposed. This approach is based on the maximum modulus zero suffix method. The given problem is split into two fuzzy transportation problems, the fuzzy upper bounded interval transportation problem (FUBITP) and fuzzy lower bounded interval transportation problem (FLBITP), and the maximum modulus zero suffix approach is used to get the best solution. Without using any ranking approaches, the suggested strategy applies to a very similar situation. Numerical examples are used to demonstrate the solution process. When treating different types of logistic problems with fully fuzzy integer interval problems, decision makers may find the fuzzy bounded separation method to be extremely useful. This method follows a methodical process and is simple to use and comprehend.