A study of problems with multiple interdependent components - Part I
Mohamed El Yafrani

TL;DR
This paper explores formal models for problems with multiple interdependent components, focusing on how to define and classify dependencies by modeling components and their connections, with examples from logistics.
Contribution
It introduces a reverse perspective to model interdependent problems, formalizes dependency notions, and classifies multi-component problem dependencies.
Findings
Proposes a formal framework for modeling component dependencies.
Provides classification of dependency types in multi-component problems.
Uses real-world logistics examples to illustrate concepts.
Abstract
Recognising that real-world optimisation problems have multiple interdependent components can be quite easy. However, providing a generic and formal model for dependencies between components can be a tricky task. In fact, a PMIC can be considered simply as a single optimisation problem and the dependencies between components could be investigated by studying the decomposability of the problem and the correlations between the sub-problems. In this work, we attempt to define PMICs by reasoning from a reverse perspective. Instead of considering a decomposable problem, we model multiple problems (the components) and define how these components could be connected. In this document, we introduce notions related to problems with mutliple interndependent components. We start by introducing realistic examples from logistics and supply chain management to illustrate the composite nature and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsScheduling and Optimization Algorithms · Product Development and Customization · Process Optimization and Integration
** A study of problems with multiple interdependent components — Part I
Mohamed El Yafrani
**
Acknowledgement
This document contains the first part of my Ph.D. dissertation. This work have been prepared within the laboratory of research in computer science and telecommunications (LRIT) at Mohammed V University under the supervision of Pr. Belaïd Ahiod. This thesis was defended on 14 September 2018, before the following board members:
- •
Abdelhakim Ameur El Imrani, Jury president, Professor, Mohammed V University in Rabat
- •
Salma Mouline, Reporter, Professor, Mohammed V University in Rabat
- •
Mohamed Ouzineb, Examiner, Habilitated professor, INSEA
- •
Markus Wagner, Reporter, Senior Lecturer, The University of Adelaide
- •
Myriam Delgado, Examiner, Professor, Federal University of Technology of Paraná
- •
Belaïd Ahiod, Advisor, Habilitated professor, Mohammed V University in Rabat
**Contributors to part I:
**Belaïd Ahiod, Mohammed V University in Rabat
Mohammad Reza Bonyadi, Rio Tinto
Abstract
\justify
Recognising that real-world optimisation problems have multiple interdependent components can be quite easy. However, providing a generic and formal model for dependencies between components can be a tricky task. In fact, a PMIC can be considered simply as a single optimisation problem and the dependencies between components could be investigated by studying the decomposability of the problem and the correlations between the sub-problems. In this work, we attempt to define PMICs by reasoning from a reverse perspective. Instead of considering a decomposable problem, we model multiple problems (the components) and define how these components could be connected. In this document, we introduce notions related to problems with mutliple interndependent components. We start by introducing realistic examples from logistics and supply chain management to illustrate the composite nature and dependencies in these problems. Afterwards, we provide our attempt to formalise and classify dependency in multi-component problems.
Keywords: Interdependence, Multi-component problems, Combinatorial optimisation.
part1
part2
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1Bonyadi et al. [2013] Bonyadi, M. R., Michalewicz, Z., and Barone, L. (2013). The travelling thief problem: the first step in the transition from theoretical problems to realistic problems. In Evolutionary Computation (CEC), 2013 IEEE Congress on , pages 1037–1044. IEEE.
- 2Bonyadi et al. [2016] Bonyadi, M. R., Michalewicz, Z., Neumann, F., and Wagner, M. (2016). Evolutionary computation for multicomponent problems: opportunities and future directions. ar Xiv preprint ar Xiv:1606.06818 .
- 3Cornuéjols et al. [1983] Cornuéjols, G., Nemhauser, G. L., and Wolsey, L. A. (1983). The uncapacitated facility location problem. Technical report, Carnegie-mellon univ pittsburgh pa management sciences research group.
- 4Dantzig and Ramser [1959] Dantzig, G. B. and Ramser, J. H. (1959). The truck dispatching problem. Management science , 6(1):80–91.
- 5Graham [1966] Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell Labs Technical Journal , 45(9):1563–1581.
- 6Ibrahimov et al. [2012 a] Ibrahimov, M., Mohais, A., Schellenberg, S., and Michalewicz, Z. (2012 a). Evolutionary approaches for supply chain optimisation: part i: single and two-component supply chains. International Journal of Intelligent Computing and Cybernetics , 5(4):444–472.
- 7Ibrahimov et al. [2012 b] Ibrahimov, M., Mohais, A., Schellenberg, S., and Michalewicz, Z. (2012 b). Evolutionary approaches for supply chain optimisation. part ii: multi-silo supply chains. International Journal of Intelligent Computing and Cybernetics , 5(4):473–499.
- 8Iori and Martello [2010] Iori, M. and Martello, S. (2010). Routing problems with loading constraints. Top , 18(1):4–27.
