An effective matheuristic for the capacitated total quantity discount problem

DOI10.1016/j.cor.2013.07.019zbMath1348.90640OpenAlexW1971331599MaRDI QIDQ336744

Daniele Manerba, Renata Mansini

Publication date: 10 November 2016

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

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

zbMATH Keywords

matheuristicsupplier selectionILP refinementtotal quantity discount

Mathematics Subject Classification ID

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

Related Items

New solution approaches for the capacitated supplier selection problem with total quantity discount and activation costs under demand uncertainty, Optimal pricing and inventory strategies with multiple price markdowns over time, Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities, Comprehensive quantity discount model for dynamic green supplier selection and order allocation, The traveling purchaser problem and its variants, A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts, A multi-period multi-commodity lot-sizing problem with supplier selection, storage selection and discounts for the process industry

Uses Software

• VRP

Cites Work

• Unnamed Item
• Kernel search: a new heuristic framework for portfolio selection
• Exploring greedy criteria for the dynamic traveling purchaser problem
• A heuristic approach for the travelling purchaser problem
• Vendor selection criteria and methods
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• Exact algorithms for procurement problems under a total quantity discount structure
• A proposal for a hybrid meta-strategy for combinatorial optimization problems
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• A hybrid tabu search/branch \& bound approach to solving the generalized assignment problem
• The traveling purchaser problem with budget constraint
• Local branching
• Exploring relaxation induced neighborhoods to improve MIP solutions
• The concave cost supply problem.
• Variable neighborhood decomposition search
• Dynamic tabu search strategies for the traveling purchaser problem
• A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search
• A hybrid algorithm for the heterogeneous fleet vehicle routing problem
• An exact algorithm for the capacitated total quantity discount problem
• Heuristics for sourcing from multiple suppliers with alternative quantity discounts
• A new ILP-based refinement heuristic for vehicle routing problems
• Quantity discount decisions under conditions of multiple items, multiple suppliers and resource limitations
• An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems
• Capacitated Multiple Item Ordering with Incremental Quantity Discounts
• A branch-and-bound-based local search method for the flow shop problem
• Using a hybrid genetic-algorithm/branch and bound approach to solve feasibility and optimization integer programming problems