TAILIEUCHUNG - Convergence of estimated optimal inventory levels in models with probabilistic demands

The behavior of estimations of the optimal inventory level is analyzed. Two models are studied. The demands follow unknown probability distribution function. The included density functions are estimated and a plug-in rule is suggested for computing estimates of the optimal levels. Two search algorithms are proposed and compared using Monte Carlo experiments. | Yugoslav Journal of Operations Research 13 (2003), Number 2, 217-227 CONVERGENCE OF ESTIMATED OPTIMAL INVENTORY LEVELS IN MODELS WITH PROBABILISTIC DEMANDS Carlos N. BOUZA Departamento de Matem‹tica Aplicada Facultad de Matem‹tica y Computaci†n Universidad de La Haban bouza@ Abstract: The behavior of estimations of the optimal inventory level is analyzed. Two models are studied. The demands follow unknown probability distribution function. The included density functions are estimated and a plug-in rule is suggested for computing estimates of the optimal levels. Two search algorithms are proposed and compared using Monte Carlo experiments. Keywords: Backorders, simulated annealing, density function estimation. 1. INTRODUCTION The inventory problems to be analyzed can be formulated as follows: "given set of demands of a certain number of periods, determine the parameters that implement a policy that ensures minimum costs at a long run". We start with an inventory and at every time period t we examine the inventory position. The set-up cost c( s) is associated to each placed order. A holding cost c( h) is incurred per unit-time in the inventory stock. The backordered cost c(b) is incurred per unit-time per backordered unit of demand. The cost of using a policy is a linear combination of set-up, holding and backordered costs. We can consider this problem deterministic or we can assume that we face probabilistic demands. The later case is more realistic though a percent of the demands can be considered non-random. For example, the demands of a large buyer can be similar in any period. The level of the product in the firm should be set to reserve sufficient inventory in order to meet the deterministic demand. It is known before the next replenish. This problem is analyzed in Section 3 following the results of Haussmann-Thomas (1972). Section 4 is devoted to the analysis of an inventory model where all the demands during the stock out period are backordered

• Kinh tế học
• Simulated annealing
• Density function estimation
• Optimal inventory level
• Monte Carlo experiments
• Probability distribution function
• Reaction Processes
• Annealing Method
• Control Problem
• Fuzzy inference system
• Simulated annealing algorithm
• Malaria susceptibility mapping
• Environmental sciences
• Evolutionary simulated annealing method
• Dsign a small 200 MWt reactor core
• Average U 235 enrichment
• Floating nuclear power plant
• Evolutionary simulated annealing
• Multi objective manufacturing cell scheduling problem
• The consideration of warehouses
• Simulated annealing based procedure
• Pareto Archived Simulated
• Multi objective Optimization
• Báo cáo khoa học
• Thuật toán luyện kim
• Tổng quan thuật toán mô phỏng
• Parallel Simulated Annealing Algorithms
• Xây dựng khung thuật toán SA
• Thuật toán SA
• Hybrid cat swarm optimization
• Simulated annealing for dynamic task scheduling
• Cloud computing environment
• The proposed CSMCSOSA algorithm
• Enhance the SA
• Cloud Scalable Multi Objective Cat Swarm Optimization
• Solving uncapacitated multiple allocation p hub center problem
• Dijkstra’s algorithm based genetic algorithm and simulated annealing
• Dijkstra’s algorithm based genetic algorithm
• Large scale standard data sets
• P hub center problem
• Unequal area dynamic facility layout problems
• Flexible bay structure
• Dynamic Facility Layout Problem
• NP complete problem
• Facilities planning and design
• Supply Chain Scheduling
• Closed loop supply chain systems
• Scheduling manufacturing workshops
• Tối ưu điều độ tàu container
• Giải thuật Simulated annealing lai
• Vận chuyển hàng hóa bằng container
• Bốc xếp container
• Giải pháp tăng năng suất cảng container
• BMC Genomics
• Network alignment
• PPI networks
• Functional conserved proteins
• Proteins play essential roles
• temperature decreases
• thermal mobility
• minimum energy
• Periodic delivery
• Optimum order quantity
• Manufacturing system
• Production facility
• Resolving VLSI
• Automatic Design
• Cellular Systems
• Annealing Algorithm
• Monitoring Network
• Design Problems
• Simulated Anealing Algorithm
• Hybrid Vehicle Routing Problem
• Bi objective hybrid vehicle
• Alternative paths and reliability
• Bi objective simulated annealing
• Tự động hóa
• Điện – điện tử
• Cơ khí chế tạo máy
• Kiến trúc xây dựng
• kỹ thuật viễn thông
• automation and optimization
• Bioengineered Skin
• Skin Biopsy
• Environmental Research
• measure Fish Coloration
• Hybrid E learning
• Blended E Learning
• Hybrid Digital Library
• Rural School Concept
• Arua District
• hình học giải tích
• hình học không gian
• hình học
• đại số
• tài liệu luận văn
• giáo trình luận văn
• luận văn xã hội
• luận văn tốt nghiệp
• luận văn báo cáo
• Forward Problem
• The Mathematics
• Introduction
• Estimating Posterior
• Random Functions
• Hydrocolloids
• Food Industry
• Emulsifying Properties
• Hydrolized Sunflower
• Lecithins by Phospholipases
• Different Sources
• Local Search
• Local search basics
• General local search algorithm
• Tabu search
• Hill climbing
• Location problems
• Discrete optimization
• Particle swarm optimization
• Variable neighborhood search