Metaheuristics based on decision hierarchies for the traveling purchaser problem

DOI10.1111/ITOR.12330zbMATH Open1395.90208OpenAlexW2554097742MaRDI QIDQ5374520FDOQ5374520

Authors: Raquel Bernardino, Ana Paias 

Publication date: 14 September 2018

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12330

Recommendations

• Improved heuristics for the traveling purchaser problem.
• Improved solutions for the traveling purchaser problem.
• A branch and bound algorithm for the traveling purchaser problem
• The traveling purchaser problem and its variants
• A heuristic approach for the travelling purchaser problem

zbMATH Keywords

metaheuristicslocal searchgenetic algorithmsbiased random key genetic algorithmtraveling purchaser problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Cited In (10)

• Metaheuristics for the distance constrained generalized covering traveling salesman problem
• The vacation planning problem: a multi-level clustering-based metaheuristic approach
• A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
• Heuristic approaches for the family traveling salesman problem
• Logic-Based Decomposition Methods for the Travelling Purchaser Problem
• The traveling purchaser problem with fast service option
• Transgenetic algorithm for the traveling purchaser problem
• The bi-objective traveling purchaser problem with deliveries
• Heuristics for the traveling purchaser problem
• A biased random-key genetic algorithm for the set orienteering problem

This page was built for publication: Metaheuristics based on decision hierarchies for the traveling purchaser problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5374520)