New parallel randomized algorithms for the traveling salesman problem
Computers and Operations Research - Special issue on the traveling salesman problem
Proceedings of the 31st conference on Winter simulation: Simulation---a bridge to the future - Volume 1
A New Algorithm for Stochastic Discrete Resource AllocationOptimization
Discrete Event Dynamic Systems
Unresolved Issues in Supply Chain Network Design
Information Systems Frontiers
Production-distribution planning in supply chain considering capacity constraints
Computers and Industrial Engineering - Supply chain management
A strategic model for supply chain design with logical constraints: formulation and solution
Computers and Operations Research
Warehouse-Retailer Network Design Problem
Operations Research
Maufacturing supply chain applications 1: supply chain multi-objective simulation optimization
Proceedings of the 34th conference on Winter simulation: exploring new frontiers
Proceedings of the 35th conference on Winter simulation: driving innovation
A large deviations perspective on ordinal optimization
WSC '04 Proceedings of the 36th conference on Winter simulation
A hybrid computing scheme for shape optimisation in thermo-fluid problems
International Journal of Computational Intelligence Studies
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
GBOM-oriented management of production disruption risk and optimization of supply chain construction
Expert Systems with Applications: An International Journal
Hi-index | 12.06 |
Supply chain optimization, as a key determinant of strategic resources mobility along the value-added chain, allows each participant in the global network to capitalize on its particular strategic competency. Simulation is widely used to test the impact on supply chain performance for the strategic level decisions, such as the number of plants, the modes of transport, or the relocation of warehouses. However, the complexity of supply chain optimization problem and the stochastic nature of simulation cause the unaffordable computational load; the evaluation of a large number of alternatives for supply chain optimization is in a class of NP-hard problem and the number of simulation replications is required for accurately evaluating the performance of each alternative. The objective of the present work is to propose hybrid algorithm with the application of the nested partitioning (NP) method and the optimal computing budget allocation (OCBA) method to reduce the computational load, hence, to improve the efficiency of supply chain optimization via discrete event simulation. The NP method is a global sampling strategy that is continuously adapted via a partitioning of the feasible solution region. The number of candidate alternatives to be evaluated can be reduced by the application of NP. The OCBA method minimizes the number of samples (simulation replications) required to evaluate a particular alternative by allocating computing resources to potentially critical alternative. Carefully designed experiments show extensive numerical result to illustrate the benefits of the proposed approach.