Models for a traveling purchaser problem with additional side-constraints

DOI10.1016/j.cor.2010.07.016zbMath1231.90089MaRDI QIDQ709202

Stefan Voß, Ana Paias, Luís 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 programming; traveling purchaser problem; discretized (time-dependent) formulation; state space relaxation

Mathematics Subject Classification ID

90C10: Integer programming

90B06: Transportation, logistics and supply chain management

90C39: Dynamic programming

90C52: Methods of reduced gradient type

Related Items

Optimal capacitated ring trees, The bi-objective traveling purchaser problem with deliveries, The traveling purchaser problem with time-dependent quantities, The traveling purchaser problem and its variants, The distance constrained multiple vehicle traveling purchaser problem, The traveling purchaser problem with fast service option

Uses Software

• BRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exploring greedy criteria for the dynamic traveling purchaser problem
• Applying the corridor method to a blocks relocation problem
• A heuristic approach for the travelling purchaser problem
• Solving the asymmetric traveling purchaser problem
• The traveling purchaser problem with budget constraint
• Travelling purchaser problem
• A branch and bound algorithm for the traveling purchaser problem
• Improved solutions for the traveling purchaser problem.
• Improved heuristics for the traveling purchaser problem.
• The traveling salesman problem and its variations
• Approximate algorithms for the travelling purchaser problem
• Heuristics for the traveling purchaser problem
• Dynamic tabu search strategies for the traveling purchaser problem
• Ant colony optimization for the traveling purchaser problem
• Automatic production planning of press brakes for sheet metal bending
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• Matheuristics
• 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
• Validation of subgradient optimization
• Sequencing many jobs on a multi-purpose facility
• Effective Algorithms for a Bounded Version of the Uncapacitated TPP