Mixed-model Sequencing with Reinsertion of Failed Vehicles: A Case Study for Automobile Industry

by   I. Ozan Yilmazlar, et al.

In the automotive industry, some vehicles, failed vehicles, cannot be produced according to the planned schedule due to some reasons such as material shortage, paint failure, etc. These vehicles are pulled out of the sequence, potentially resulting in an increased work overload. On the other hand, the reinsertion of failed vehicles is executed dynamically as suitable positions occur. In case such positions do not occur enough, either the vehicles waiting for reinsertion accumulate or reinsertions are made to worse positions by sacrificing production efficiency. This study proposes a bi-objective two-stage stochastic program and formulation improvements for a mixed-model sequencing problem with stochastic product failures and integrated reinsertion process. Moreover, an evolutionary optimization algorithm, a two-stage local search algorithm, and a hybrid approach are developed. Numerical experiments over a case study show that while the hybrid algorithm better explores the Pareto front representation, the local search algorithm provides more reliable solutions regarding work overload objective. Finally, the results of the dynamic reinsertion simulations show that we can decrease the work overload by  20% while significantly decreasing the waiting time of the failed vehicles by considering vehicle failures and integrating the reinsertion process into the mixed-model sequencing problem.


page 1

page 2

page 3

page 4


Mixed-model Sequencing with Stochastic Failures: A Case Study for Automobile Industry

In the automotive industry, the sequence of vehicles to be produced is d...

Hybrid Metaheuristics for the Clustered Vehicle Routing Problem

The Clustered Vehicle Routing Problem (CluVRP) is a variant of the Capac...

Hybrid Evolutionary Computation for Continuous Optimization

Hybrid optimization algorithms have gained popularity as it has become a...

A Three-Stage Algorithm for the Large Scale Dynamic Vehicle Routing Problem with an Industry 4.0 Approach

Industry 4.0 is a concept which helps companies to have a smart supply c...

A New Perspective on Stochastic Local Search and the Lovasz Local Lemma

We present a new perspective on the analysis of stochastic local search ...

Evolutionary Computation plus Dynamic Programming for the Bi-Objective Travelling Thief Problem

This research proposes a novel indicator-based hybrid evolutionary appro...

A Model of Competitive Assortment Planning Algorithm

With a novel search algorithm or assortment planning or assortment optim...

Please sign up or login with your details

Forgot password? Click here to reset