Results 71 to 80 of about 11,422 (178)

Improved Cross Entropy Algorithm for the Optimum of Charge Planning Problem

Abstract and Applied Analysis, 2014
To solve the charge planning problem involving charges and the orders in each charge, a traveling salesman problem based charge planning model and the improved cross entropy algorithm are proposed. Firstly, the charge planning problem with unknown charge
Fan Yang, Qiqiang Li
doaj   +1 more source

THE DUBINS TRAVELING SALESMAN PROBLEM WITH CONSTRAINED COLLECTING MANEUVERS

Acta Polytechnica CTU Proceedings, 2016
In this paper, we introduce a variant of the Dubins traveling salesman problem (DTSP) that is called the Dubins traveling salesman problem with constrained collecting maneuvers (DTSP-CM).
Petr Váňa, Jan Faigl
doaj   +1 more source

On One Implementation of a Natural Approach to Solving the Traveling Salesman Problem

Кібернетика та комп'ютерні технології
Introduction. The relevance of the traveling salesman problem is associated with the need to develop computational schemes for use in situations that require the analysis of information of a sufficiently large volume.
Dmitri Terzi
doaj   +1 more source

Traveling Salesman Problem with Transportation [PDF]

Computer Science Journal of Moldova, 2006
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined – a synthesis of classical TSP and classical Transportation Problem.
Valeriu Ungureanu
doaj  

Didactic Visualization of Routing Problems

Education Sciences, 2020
The Traveling Salesman and Vehicle Routing Problems are integral parts of bachelor and master programs related to Operations Research/Management Science. This is due to their relevance in both practical applications and research.
Margaretha Gansterer, Veronika Klug
doaj   +1 more source

A formulation and a metaheuristic approach for the clustered vehicle routing problem with d‐relaxed priority rule

International Transactions in Operational Research, Volume 33, Issue 6, Page 3714-3743, November 2026.
Abstract This paper investigates an extension of the vehicle routing problem in which, in addition to minimizing the distance traveled, the sequencing of customer visits is subject to precedence constraints that impose visiting priorities among customers.
Eduardo dos Santos Teixeira, Silvio Alexandre de Araujo   +1 more
wiley   +1 more source

The 2-period balanced traveling salesman problem [PDF]

In the 2-period Balanced Traveling Salesman Problem (2B-TSP), the customers must be visited over a period of two days: some must be visited daily, and the others on alternate days (even or odd days); moreover, the number of customers visited in every ...
Francesco Mason, Tatiana Bassetto
core  

Indentations and Starting Points in Traveling Sales Tour Problems: Implications for Theory

, 2012
A complete, non-trivial, traveling sales tour problem contains at least one “indentation”, where nodes in the interior of the point set are connected between two adjacent nodes on the boundary.
MacGregor, James N
core   +1 more source

Heuristic methods using grasp, path relinking and variable neighborhood search for the clustered traveling salesman problem

Revista Produção Online, 2013
The Clustered Traveling Salesman Problem (CTSP) is a generalization of the Traveling Salesman Problem (TSP) in which the set of vertices is partitioned into disjoint clusters and objective is to find a minimum cost Hamiltonian cycle such that the ...
Mário Mestria
doaj   +1 more source

An Algorithm for the Traveling Salesman Problem [PDF]

Operations Research, 1963
A “branch and bound” algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by a procedure called branching. For each subset a lower bound on the length of the tours therein is calculated.
Little, J. D. C., Murty, K. G., Sweeney, D. W., Karel, C.   +3 more
openaire   +2 more sources