Exploring greedy criteria for the dynamic traveling purchaser problem

DOI10.1007/S10100-008-0080-0zbMATH Open1204.90078OpenAlexW1980888969MaRDI QIDQ623757FDOQ623757

M. Vindigni, Renata Mansini, Enrico Angelelli

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) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)
• Dynamic vehicle routing: Status and prospects
• Travelling purchaser problem
• A Branch-and-Cut Algorithm for the Undirected Traveling 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
• Supply and Redistribution Rules for Two-Location Inventory Systems: One-Period Analysis
• Sequencing many jobs on a multi-purpose facility
• A heuristic approach for the travelling purchaser problem
• The Multiperiod Multilocation Inventory Problem
• A two-echelon inventory model with purchases, dispositions, shipments, returns and transshipments

Cited In (9)

• The traveling purchaser problem with time-dependent quantities
• Models for a traveling purchaser problem with additional side-constraints
• An effective matheuristic for the capacitated total quantity discount problem
• The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach
• The traveling purchaser problem with fast service option
• The traveling purchaser problem and its variants
• 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

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

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