Particle Swarm Optimization for Just-In-Time Order Acceptance Scheduling and Batch Delivery Problem

In this paper, we consider just-in-time order acceptance scheduling problem in an integrated production-distribution supply chain where the manufacturing system is as parallel machine and the delivery is as batch delivery. Examples of such supply chain occur in food and beverage, pharmaceutical, and steel industries. The aim of this problem is to determine accepted orders in order to maximize Total Net Profit. A mathematical formulation is proposed for the problem. In addition, this problem is NP-hard and hence a particle swarm optimization algorithm is proposed. To explore and to locate the algorithm in a better neighborhood, a Local Search is presented. A comprehensive set of data were generated to test our approach with respect to solution quality and run time, to verify the developed model and to evaluate the performance of proposed algorithm against the exact solution. The results show the efficiency of proposed model and the algorithm.

کلیدواژه ها:

Order Acceptance ، Just-In-Time ، Parallel machine ، Batch Delivery ، Particle Swarm Optimization ، Local Search ،