This work considers the Bi-objective Traveling Salesman Problem (BTSP), where two
conflicting objectives, the travel time and monetary cost between cities, are minimized. Our …

The travelling salesperson problem is an NP-hard combinatorial optimization problem. In
this paper, we consider the multi-objective travelling salesperson problem (MTSP), both …

Many real world applications modelled as complex networks optimize multiple conflicting
objective functions that change frequently over time. Solving multi-objective optimization …

Abstract The Multiple Travelling Salesman Problem (MTSP) is a challenging combinatorial
problem that involves multiple salesman visiting a set of cities, each exactly once, starting …

In this research paper, we address the Bi-objective Traveling Salesman Problem (BTSP),
which involves minimizing two conflicting objectives: travel time and monetary cost. To tackle …

Oblique aerial images–captured with the camera's optical axis intentionally tilted from the
vertical (usually by an angle between 30–45 degrees), make it possible to record elements …