integrated hybrid flow shop scheduling and vehicle routing problem

In this paper, a new integrated mathematical model for production and distribution planning is presented to minimize tardiness and transportation costs. a mixedinteger linear programming (milp) formulation is developed for the problem which consists of two parts. first, the production scheduling in a hybrid flow shop (hfs) environment with identical machines in each stage, and then, the delivery of completed jobs with a fleet of vehicles that have the same capacity. due to the nphard nature of the problem, a new metaheuristic approach based on particle swarm optimization algorithm (pso) and genetic algorithm (ga) is presented to solve the integrated problem. ga’s operators are used to update the particle position of the pso algorithm. the algorithm uses dispatching rules to represent the initial solution and searches in the solution space including active schedules. to investigate the efficiency and effectiveness of the proposed method, numerical studies are carried out with random problems. the computational results show that the proposed solution approach yields fairly good results in comparison with the pso versions in the subject literature. the algorithm is capable of generating relatively good solutions for sample cases.