Models for a traveling purchaser problem with additional side-constraints

DOI10.1016/J.COR.2010.07.016MaRDI QIDQ709202zbMATH OpenOpenAlexFDO

Authors Ana Paias, Stefan Voß, Luis Gouveia

Publication date 15 October 2010

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2010.07.016

zbMATH Keywords

dynamic programmingtraveling purchaser problemdiscretized (time-dependent) formulationstate space relaxation

Mathematics Subject Classification ID

Dynamic programming (90C39) Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Methods of reduced gradient type (90C52)

Recommendations

• Improved solutions for the traveling purchaser problem.
• The traveling purchaser problem and its variants
• A heuristic approach for the travelling purchaser problem
• The traveling purchaser problem with budget constraint
• The traveling purchaser problem with fast service option

Cites work

• scientific article; zbMATH DE number 5152600 (Why is no real title available?)
• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 1405785 (Why is no real title available?)
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• A branch and bound algorithm for the traveling purchaser problem
• A heuristic approach for the travelling purchaser problem
• Ant colony optimization for the traveling purchaser problem
• Applying the corridor method to a blocks relocation problem
• Approximate algorithms for the travelling purchaser problem
• Automatic production planning of press brakes for sheet metal bending
• Dynamic tabu search strategies for the traveling purchaser problem
• Effective algorithms for a bounded version of the uncapacitated TPP
• Exploring greedy criteria for the dynamic traveling purchaser problem
• Heuristics for the traveling purchaser problem
• Improved heuristics for the traveling purchaser problem.
• Improved solutions for the traveling purchaser problem.
• Matheuristics
• Sequencing many jobs on a multi-purpose facility
• Solving the asymmetric traveling purchaser problem
• State-space relaxation procedures for the computation of bounds to routing problems
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The traveling purchaser problem with budget constraint
• The traveling salesman problem and its variations
• Travelling purchaser problem
• Validation of subgradient optimization

Cited in

(14)

• The traveling purchaser problem with time-dependent quantities
• Optimal capacitated ring trees
• A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
• Effective algorithms for a bounded version of the uncapacitated TPP
• Exact models for the flying sidekick traveling salesman problem
• The traveling purchaser problem with fast service option
• The traveling purchaser problem with budget constraint
• Solving the asymmetric traveling purchaser problem
• Parameterized algorithms for the Traveling Purchaser problem with additional constraints
• The traveling purchaser problem and its variants
• Improved solutions for the traveling purchaser problem.
• The bi-objective traveling purchaser problem with deliveries
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants
• The distance constrained multiple vehicle traveling purchaser problem

Describes a project that uses

Uses Software

• BRP

This page was built for publication: Models for a traveling purchaser problem with additional side-constraints

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