Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands

DOI10.1016/J.COR.2023.106507MaRDI QIDQ6551107zbMATH OpenFDO

Authors Mourad Terzi, Yassine Ouazene, Alice Yalaoui, Farouk Yalaoui

Publication date 6 June 2024

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

Full work available at URL https://doi.org/10.1016/J.COR.2023.106507

zbMATH Keywords

dynamic pricinglot-sizingmatheuristicsmetaheuristicsmixed integer nonlinear programmingnonlinear demand model

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A genetic algorithm heuristic approach to general outsourcing capacitated production planning problems
• A review of multi-product pricing models
• Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
• An algorithmic framework for convex mixed integer nonlinear programs
• An inventory system with demand dependent on both time and price assuming backlogged shortages
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Computational Complexity of the Capacitated Lot Size Problem
• Deterministic Production Planning: Algorithms and Complexity
• Dynamic pricing models for electronic business
• Dynamic version of the economic lot size model
• Generalized Benders decomposition
• Heuristic genetic algorithms for general capacitated lot-sizing problems
• scientific article; zbMATH DE number 5010413 (Why is no real title available?)
• Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: theoretical and computational analysis
• Late acceptance hill-climbing for high school timetabling
• Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
• Optimal Lot-Sizing Algorithms for Complex Product Structures
• Optimization by simulated annealing
• Paramils: an automatic algorithm configuration framework
• Price-Production Decisions with Deterministic Demand
• Pricing and lot-sizing decisions for perishable goods when demand depends on selling price, reference price, product freshness, and displayed stocks
• Review of nonlinear mixed-integer and disjunctive programming techniques
• SATenstein: automatically building local search SAT solvers from components
• The late acceptance hill-climbing heuristic
• Variable neighborhood search

Cited in

(5)

• Integrating lot-sizing and pricing decisions in multi-channel markets with discrete menus of prices
• Coordination of lot-sizing and pricing decisions with cross-price demand and discrete menu of prices
• A choice-based approach to dynamic capacitated multi-item lot sizing with demand uncertainty
• Contemporary approaches in matheuristics an updated survey
• Pricing and operations planning for new product launch: introducing adopters' variant willingness to pay

This page was built for publication: Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands

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