A modeling framework and local search solution methodology for a production-distribution problem with supplier selection and time-aggregated quantity discounts
From MaRDI portal
Publication:2307262
DOI10.1016/j.apm.2018.09.036zbMath1481.90065OpenAlexW2898562400WikidataQ129079769 ScholiaQ129079769MaRDI QIDQ2307262
Aly Megahed, Goetschalckx, Marc
Publication date: 27 March 2020
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2018.09.036
Related Items
A decomposition-based algorithm for the double row layout problem ⋮ A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
Uses Software
Cites Work
- Unnamed Item
- A scenario-based stochastic model for supplier selection in global context with multiple buyers, currency fluctuation uncertainties, and price discounts
- An effective matheuristic for the capacitated total quantity discount problem
- Combining the principles of variable neighborhood decomposition search and the Fix\&Optimize heuristic to solve multi-level lot-sizing and scheduling problems
- An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
- A complement to ``A comprehensive note on: an economic order quantity with imperfect quality and quantity discounts
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
- An economic order quantity with imperfect quality and quantity discounts
- A comprehensive note on: an economic order quantity with imperfect quality and quantity discounts
- Analytical models for supplier selection and order quantity allocation
- A survey of very large-scale neighborhood search techniques
- Vendor selection criteria and methods
- Integrated analytical hierarch process and mathematical programming to supplier selection problem with quantity discount
- Exact algorithms for procurement problems under a total quantity discount structure
- Supplier selection and order lot sizing modeling: a review
- An ILP improvement procedure for the open vehicle routing problem
- A general quantity discount and supplier selection mixed integer programming model
- Multi-criteria decision making approaches for supplier evaluation and selection: a literature review
- A classification of literature on determining the lot size under quantity discounts
- Strategic production-distribution models: A critical review with emphasis on global supply chain models
- Variable neighborhood search
- An integrated model for lot sizing with supplier selection and quantity discounts
- An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem
- Tactical supply chain planning under uncertainty with an application in the wind turbines industry
- An exact algorithm for the capacitated total quantity discount problem
- Optimizing inventory decisions in a two-level supply chain with order quantity constraints
- A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems
- A reduced variable neighborhood search algorithm for uncapacitated multilevel lot-sizing problems
- An optimization algorithm for the inventory routing problem with continuous moves
- A comparison of methods for lot-sizing in a rolling horizon environment
- A new ILP-based refinement heuristic for vehicle routing problems
- General variable neighborhood search for the multi-product dynamic lot sizing problem in closed-loop supply chain
- A variable neighborhood decomposition search algorithm for multilevel capacitated lot-sizing problems
- Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem
- Introduction to Stochastic Programming
- A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
- Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
- Ending Inventory Valuation in Multiperiod Production Scheduling
- A Comparison of Mixed-Integer Programming Models for Nonconvex Piecewise Linear Cost Minimization Problems
- Improved Rolling Schedules for the Dynamic Single-Level Lot-Sizing Problem
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- Optimal Bundle Pricing
- Variable neighborhood search: Principles and applications
