Exploring greedy criteria for the dynamic traveling purchaser problem

DOI10.1007/s10100-008-0080-0zbMath1204.90078OpenAlexW1980888969MaRDI QIDQ623757

Enrico Angelelli, Michele Vindigni, Renata Mansini

Publication date: 8 February 2011

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-008-0080-0

zbMATH Keywords

selection criteriadynamic traveling purchaser problemgreedy heuristic algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (9)

The bi-objective traveling purchaser problem with deliveries ⋮ The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach ⋮ An effective matheuristic for the capacitated total quantity discount problem ⋮ The traveling purchaser problem with time-dependent quantities ⋮ The traveling purchaser problem with fast service option ⋮ The traveling purchaser problem and its variants ⋮ The distance constrained multiple vehicle traveling purchaser problem ⋮ Models for a traveling purchaser problem with additional side-constraints ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants

Cites Work

• Unnamed Item
• A heuristic approach for the travelling purchaser problem
• Travelling purchaser problem
• A branch and bound algorithm for the traveling purchaser problem
• Improved solutions for the traveling purchaser problem.
• Approximate algorithms for the travelling purchaser problem
• Heuristics for the traveling purchaser problem
• Dynamic vehicle routing: Status and prospects
• A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem
• The Multiperiod Multilocation Inventory Problem
• Supply and Redistribution Rules for Two-Location Inventory Systems: One-Period Analysis
• A two-echelon inventory model with purchases, dispositions, shipments, returns and transshipments
• Sequencing many jobs on a multi-purpose facility

This page was built for publication: Exploring greedy criteria for the dynamic traveling purchaser problem