Replenishment policy based on modified ant colony optimisation and statistical analysis under the pre-order penetration point

DOI10.1080/00207160701609045zbMATH Open1160.90324OpenAlexW2140584177MaRDI QIDQ3615552FDOQ3615552

Authors: Jui-Tsung Wong, Chwen-Tzeng Su, Kuei-Hsien Chen 

Publication date: 20 March 2009

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160701609045

Recommendations

• A bi-level programming framework for stochastic replenishment policy in a supply chain: approach and computational test
• Dynamic order replenishment policy in internet-based supply chains
• Optimal replenishment strategy for inventory mechanism with step-shaped demand
• Mixed replenishment policy for ATO supply chain based on hybrid genetic simulated annealing algorithm
• Can-order policy for the periodic-review joint replenishment problem

zbMATH Keywords

numerical examplesalgorithmsupply chainreplenishment policynonlinear integer programmingresponse surface methodologyservice level constraintant colony optimisationcash floworder penetration pointstochastic dynamic lot-sizing problemtwo-phased transportation cost

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Transportation, logistics and supply chain management (90B06)

Cites Work

• Response surface methodology. Process and product optimization using designed experiments
• A Backlogging Model and a Multi-Echelon Model of a Dynamic Economic Lot Size Production System—A Network Approach
• Dynamic version of the economic lot size model
• Quantifying the bullwhip effect in a simple supply chain: the impact of forecasting, lead times, and information
• Optimal Lot-Sizing/Vehicle-Dispatching Policies Under Stochastic Lead Times and Stepwise Fixed Costs
• A Dynamic Model for Inventory Lot Sizing and Outbound Shipment Scheduling at a Third-Party Warehouse
• An optimal polynomial time algorithm for the common cycle economic lot and delivery scheduling problem.
• Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions
• A basic period approach to the economic lot scheduling problem with shelf life considerations
• Scheduling Trains and Containers with Due Dates and Dynamic Arrivals
• Parallel Ant Colonies for the quadratic assignment problem
• Hybrid genetic algorithm for the economic lot-scheduling problem
• On the finite-time dynamics of ant colony optimization

Cited In (1)

• Stochastic dynamic lot-sizing problem using bi-level programming base on artificial intelligence techniques

This page was built for publication: Replenishment policy based on modified ant colony optimisation and statistical analysis under the pre-order penetration point

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