Design of a quality control network for an international food company
| Autor: | Simone Voldrich, Philippe Wieser, Nicolas Zufferey |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Optimization
food industry Process management Food industry risk analysis media_common.quotation_subject Supply chain 0211 other engineering and technologies reduction Context (language use) Metaheuristics 02 engineering and technology Tabu search perspectives 0502 economics and business tabu search Control network Industry Quality (business) quality control ddc:330/650 Metaheuristic supply chain media_common metaheuristics 021103 operations research business.industry 05 social sciences Quality control lead time Combinatorial Computer Science Applications Food Signal Processing Combinatorial optimization combinatorial optimization business variable neighborhood search optimization management 050203 business & management Information Systems |
| Zdroj: | INFOR: Information Systems and Operational Research (2019) pp. 1-16 |
| ISSN: | 1916-0615 0315-5986 |
| DOI: | 10.1080/03155986.2018.1533206 |
| Popis: | In this article, the design of a quality control network is considered in an entire supply chain, in the context of an international food and beverage company, denoted as ABC. For each possible control point of the network, two decisions have to be made: (1) establish a monitoring activity or not; (2) if a monitoring activity is placed, determine its acceptance level with a well-adjusted sampling plan. The objective function to minimize consists of a weighted sum of two conflicting components, namely risk (of having bad units) and processing time (to control the product batch itself). Indeed, for each control point, an accurate monitoring activity reduces risk but augments processing time. Each monitoring activity has a specific cost (if selected) and a budget constraint has to be satisfied for the entire network. Various solutions methods are proposed to tackle this NP-hard problem, ranging from a basic greedy heuristic to advanced metaheuristics involving tabu search as an internal procedure. CPLEX can be used for very small instances (with less than 20 control points), for which a basic tabu search can obtain similar results much quicker (in a fraction of second). The experiments for larger instances highlight the importance of having a good control (in terms of the involved search trajectory in the solution space) on the search process, as the methods with well-tuned diversification mechanisms perform best. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|