Abstract The Traveling Purchaser Problem (TPP) has been one of the most studied
generalizations of the Traveling Salesman Problem. In recent decades, the TPP attracted the …

We introduce a problem where a fleet of vehicles is available to visit suppliers offering
various products at different prices and quantities, with the aim to select a subset of suppliers …

In this paper, we propose a multi-vehicle clustered traveling purchaser problem
(MVCluTPP). Here, two types of procurement planning are proposed. In the first setup, the …

The traveling purchaser problem (TPP) is a generalization of the well-known traveling
salesman problem, in which a list of products with different quantities has to be purchased …

This paper develops a modified formulation of the traveling purchaser problem (TPP), in
capacitated markets with the availability of both original and substitute products where …

Abstract The Travelling Salesman Problem (TSP) is one of the most studied problems in the
literature due to its applicability to a large number of real cases. Most variants of the TSP …

Abstract The Traveling Purchaser Problem (TPP) is a generalization of the TSP that consists
in choosing which nodes (markets) to visit to create a tour that allows to buy a set of products …

Abstract In the Distance Constrained Multiple Vehicle Traveling Purchaser Problem (DC-
MVTPP) a fleet of vehicles is available to visit suppliers offering products at different prices …

This paper addresses the well-known traveling purchaser problem (TPP) considering
restrictions related to perishable food, which is called the traveling purchaser problem for …

Dynamic programming (DP) is a framework used in multiple disciplines to solve decision-
making problems. In particular, in computer science and operations research (OR), DP …