In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

Abstract We propose a tourist attraction IoT-enabled deep learning-based recommendation system to enhance experience in smart city. Travelers will enter details about their travels (traveling alone or with companion, type of companion such as partner family kids, traveling for business leisure, etc.) well user side information (age the traveler/s, hobbies, into city app/website. Our proposed pr...

this article proposes a new algorithm for finding a good approximate set of non-dominated solutions for solving generalized traveling salesman problem. Random gravitational emulation search algorithm (RGES (is presented for solving traveling salesman problem. The algorithm based on random search concepts, and uses two parameters, speed and force of gravity in physics. The proposed algorithm is ...

The Traveling Tournament Problem (TTP) is a wellknown NP-complete problem in sports scheduling that was inspired by the application of optimizing schedules for Major League Baseball to reduce total team travel. The techniques and heuristics from the n-team TTP can be extended to optimize the scheduling of other sports leagues, such as the Nippon Professional Baseball (NPB) league in Japan. In t...

The Traveling Tournament problem is a problem of scheduling round robin leagues which minimizes the total travel distance maintaining some constraints on consecutive home and away matches. The problem was proven NP-hard when the upper bound on any consecutive home or away stint is 3. In this paper, we prove that even without the constraints on the consecutive home or away matches, the problem r...

In this paper we propose an approximation for the Traveling Tournament Problem which is the problem of designing a schedule for a sports league consisting of a set of teams T such that the total traveling costs of the teams are minimized. Thereby, it is not allowed for any team to have more than k home-games or k away-games in a row. We propose an algorithm which approximates the optimal soluti...

We assessed the behavioral context of calls produced by blue whales Balaenoptera musculus off the California coast based on acoustic, behavioral, and dive data obtained through acoustic recording tags, sex determination from tissue sampling, and coordinated visual and acoustic observations. Approximately one-third of 38 monitored blue whales vocalized, with sounds categorized into 3 types: (1) ...

In this paper, a design course organization is presented, which is the result of 15 years of experience with a two-semester senior design course sequence in the Department of Electrical and Computer Engineering at the University of Detroit Mercy. An organization has been determined, which for the authors, balances team experience, individual assessment, design complexity, realism, writing conte...

The extended homogeneous balance method is used to construct exact traveling wave solutions of the Maccari system, in which the homogeneous balance method is applied to solve the Riccati equation and the reduced nonlinear ordinary differential equation. Many exact traveling wave solutions of the Maccari system equation are successfully obtained.