Results 121 to 130 of about 496 (169)

A hybrid swarm intelligent optimization algorithm for antenna design problems. [PDF]

Sci Rep
Singh S, Singh H, Mittal N, Kaur Punj G, Kumar L, Fante KA.   +5 more
europepmc   +1 more source

OPTORER: A Dynamic Routing and Touring Service for Indoors and Outdoor Tours. [PDF]

Sensors (Basel)
Vassilakis C, Polychronaki M, Margaritis D, Kogias DG, Leligou HC.   +4 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Approximations for many-visits multiple traveling salesman problems

Omega, 2023
A fundamental variant of the classical traveling salesman problem (TSP) is the so-called multiple TSP (mTSP), where a set of m salesmen jointly visit all cities from a set of n cities. The mTSP models many important real-life applications, in particular for vehicle routing problems.
Kristóf Bérczi, Matthias Mnich, Roland Vincze   +2 more
openaire   +1 more source

The Multiple Traveling Salesman Problem on Spiders

2021
Given (i) a set of \(N+1\) vertices, that corresponds to N clients and 1 depot, (ii) the travel time between each pair of vertices and (iii) a number m of salespersons, the multiple traveling salesman problem consists in finding m tours such that, starting from the depot, all clients are visited in such a way that some objective function is minimized ...
Pedro Pérez-Escalona, Ivan Rapaport, José Soto, Ian Vidal   +3 more
openaire   +1 more source

Traveling Salesman Problem with Multiple Drones

Proceedings of the Ninth International Symposium on Information and Communication Technology - SoICT 2018, 2018
Combining trucks and drones in delivering parcels is an emerging research in recent years. In this paper, we investigate an extension of the TSP-D problem in which a truck travels with m (m > 1) drones (called TSP-mD) instead of one drone in TSP-D. We adapt the greedy randomized adaptive search procedure (GRASP) (proposed by Ha et al.) and propose an ...
Phan Anh Tu, Nguyen Tuan Dat, Pham Quang Dung   +2 more
openaire   +1 more source

Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and-bound

AIP Conference Proceedings, 2013
The standard Traveling Salesman Problem (TSP) is the classical Traveling Salesman Problem (TSP) while Multiple Traveling Salesman Problem (MTSP) is an extension of TSP when more than one salesman is involved. The objective of MTSP is to find the least costly route that the traveling salesman problem can take if he wishes to visit exactly once each of a
Shakila Saad, Wan Nurhadani Wan Jaafar, Siti Jasmida Jamil   +2 more
openaire   +1 more source

A Travelling Salesman Problem (TSP) with Multiple Job Facilties

OPSEARCH, 2001
In this paper we have considered a variation of usual travelling salesman problem introducing a more realistic situation.
Das, Shila, Ahmed, Nazimuddin
openaire   +1 more source

Exact Solution of Multiple Traveling Salesman Problems

1992
This paper presents a method developed for the multiple traveling salesman problem (m-TSP), which is a generalization of the well known TSP [6]. In the m-TSP, there are m salesmen who are required to visit n customers in such a way that all customers are visited exactly once by exactly one of the salesmen.
Branco, I., Gromicho Dos Santos, J.A., Paixão, J.   +2 more
openaire   +2 more sources

Efficient algorithms for the double traveling salesman problem with multiple stacks [PDF]

Computers & Operations Research, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Casazza, A. Ceselli, M. Nunkesser
openaire   +3 more sources

A transformation for multiple depot multiple traveling salesman problem

2017 International Conference on Engineering & MIS (ICEMIS), 2017
In this paper, we present a transformation for the Multi Depot Multiple TSP (MmTSP) into Asymmetrical TSP (ATSP). The transformation is done by duplicating the depots, and with the aid of a precedence constraint, the salesman in the transformed graph will visit the original depot and its duplicates before proceeding to the next depots.
Mustafa Assaf, Malick Ndiaye
openaire   +1 more source