Results 211 to 220 of about 353 (231)
Some of the next articles are maybe not open access.

A GRASP/Path‐Relinking algorithm for the traveling purchaser problem

International Transactions in Operational Research, 2021
AbstractThe 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 at minimum transportation and purchasing cost. The TPP has gained attention due to the computational challenges it poses and the potential applications it can support
Daniel Cuellar-Usaquén   +2 more
openaire   +2 more sources

Solving the asymmetric traveling purchaser problem

Annals of Operations Research, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jorge Riera-Ledesma   +1 more
openaire   +2 more sources

The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: A branch-and-price approach

open access: yesEuropean Journal of Operational Research, 2016
In this work we study a suppliers selection and routing problem where a fleet of homogeneous vehicles with a predefined capacity is available for procuring different products from different suppliers with the aim to minimize both the traveling and the ...
Michel Gendreau   +2 more
exaly   +2 more sources

Approximate algorithms for the travelling purchaser problem

Operations Research Letters, 1982
In this paper we study the generalized savings heuristics of Golden, Levy and Dahl and propose several new heuristic procedures for solving the travelling purchaser problem. A comparative study of the four heuristics considered is provided.
openaire   +1 more source

A Constraint Programming Approach for the Traveling Purchaser Problem

2012
We present a novel approach to the Traveling Purchaser Problem (TPP), based on constraint programming and Lagrangean relaxation. The TPP is a generalization of the Traveling Salesman Problem involved in many real-world applications. Given a set of markets providing products at different prices and a list of products to be purchased, the problem is to ...
Hadrien Cambazard, Bernard Penz
openaire   +1 more source

A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem

Operations Research, 2003
The purpose of this paper is to present a branch-and-cut algorithm for the undirected Traveling Purchaser Problem which consists of determining a minimum-cost route through a subset of markets, where the cost is the sum of travel and purchase costs. The problem is formulated as an integer linear program, and several families of valid inequalities are ...
Gilbert Laporte   +2 more
openaire   +1 more source

A Transgenetic Algorithm for the bi-objective traveling purchaser problem

IEEE Congress on Evolutionary Computation, 2010
This work proposes an algorithm based on Computational Transgenetic (CT) metaphor to deal with the bi-objective traveling purchaser problem (2TPP). The 2TPP consists in determining a route through a subset of markets to collect a set of products, minimizing the travel distance and the purchasing cost simultaneously.
Carolina P. de Almeida   +4 more
openaire   +1 more source

Parameterized algorithms and complexity for the traveling purchaser problem and its variants

Journal of Combinatorial Optimization, 2020
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mingyu Xiao 0001   +2 more
openaire   +2 more sources

Metaheuristics based on decision hierarchies for the traveling purchaser problem

International Transactions in Operational Research, 2016
AbstractIn this paper we address the traveling purchaser problem, an NP‐hard problem that generalizes the traveling salesman problem. We present several metaheuristics that combine genetic algorithms and local search. The genetic algorithms are induced by different hierarchic orderings of the decision making regarding the route and the acquisition of ...
Raquel Bernardino, Ana Paias
openaire   +2 more sources

Look-ahead heuristics for the dynamic traveling purchaser problem

Computers & Operations Research, 2011
Given a set of products each with positive discrete demand, and a set of markets selling products at given prices, the traveling purchaser problem (TPP) looks for a tour visiting a subset of markets such that products demand is satisfied at minimum purchasing and traveling costs.
ANGELELLI, Enrico   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy