Results 221 to 230 of about 353 (231)

Parameterized Algorithms for the Traveling Purchaser Problem with Additional Constraints

2019
The traveling purchaser problem (TPP), a generalization of the traveling salesman problem, is to determine a tour of suppliers and purchase needed products from suppliers, while minimizing the traveling and purchasing cost. This problem finds applications in the routing and scheduling contexts and its variants with different constraints have been ...
Mingyu Xiao 0001   +2 more
openaire   +1 more source

An Application of Late Acceptance Hill-Climbing to the Traveling Purchaser Problem

2013
Late Acceptance Hill Climbing (LAHC) is a recent metaheuristic in the realm of local search based procedures. The basic idea is to delay the comparison between neighborhood solutions and to compare new candidate solutions to a solution having been current several steps ago.
Andreas Goerler   +2 more
openaire   +1 more source

The Travelling Purchaser Problem with Budget Constraint

International Journal of Mathematics Trends and Technology, 2020
Sumathi P   +2 more
openaire   +1 more source

The multi-vehicle travelling purchaser problem with priority in purchasing and uncertainty in demand

International Journal of Logistics Systems and Management, 2021
Zahra Hasanpour Jesri, Kourosh Eshghi
openaire   +1 more source

Metaheuristics based on decision hierarchies for the traveling purchaser problem

International Transactions in Operational Research, 2018
Raquel Bernardino, Ana Paias
exaly  

Design and implementation of a parallel genetic algorithm for the travelling purchaser problem

Proceedings of the 1997 ACM symposium on Applied computing - SAC '97, 1997
Luiz Satoru Ochi   +2 more
openaire   +1 more source

The dynamic traveling purchaser problem

2009
ANGELELLI, Enrico   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy