A study of problems with multiple interdependent components - Part I

03/01/2019
by   Mohamed El Yafrani, et al.
0

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.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

04/25/2020

The Dynamic Travelling Thief Problem: Benchmarks and Performance of Evolutionary Algorithms

Many real-world optimisation problems involve dynamic and stochastic com...
06/22/2016

Étude de Problèmes d'Optimisation Combinatoire à Multiples Composantes Interdépendantes

This extended abstract presents an overview on NP-hard optimization prob...
06/18/2015

Simultaneous Estimation of Non-Gaussian Components and their Correlation Structure

The statistical dependencies which independent component analysis (ICA) ...
11/11/2020

Identifying Properties of Real-World Optimisation Problems through a Questionnaire

Optimisation algorithms are commonly compared on benchmarks to get insig...
03/08/2019

Approximating Optimisation Solutions for Travelling Officer Problem with Customised Deep Learning Network

Deep learning has been extended to a number of new domains with critical...
04/16/2019

Risk Bounds for Learning Multiple Components with Permutation-Invariant Losses

This paper proposes a simple approach to derive efficient error bounds f...
07/16/2021

A study on reliability of a k-out-of-n system equipped with a cold standby component based on copula

A k-out-of-n system consisting of n exchangeable components equipped wit...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

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

part1

part2

References

  • Bonyadi 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.
  • Bonyadi et al. [2016] Bonyadi, M. R., Michalewicz, Z., Neumann, F., and Wagner, M. (2016). Evolutionary computation for multicomponent problems: opportunities and future directions. arXiv preprint arXiv:1606.06818.
  • Cornué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.
  • Dantzig and Ramser [1959] Dantzig, G. B. and Ramser, J. H. (1959). The truck dispatching problem. Management science, 6(1):80–91.
  • Graham [1966] Graham, R. L. (1966). Bounds for certain multiprocessing anomalies. Bell Labs Technical Journal, 45(9):1563–1581.
  • Ibrahimov et al. [2012a] Ibrahimov, M., Mohais, A., Schellenberg, S., and Michalewicz, Z. (2012a). 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.
  • Ibrahimov et al. [2012b] Ibrahimov, M., Mohais, A., Schellenberg, S., and Michalewicz, Z. (2012b). Evolutionary approaches for supply chain optimisation. part ii: multi-silo supply chains. International Journal of Intelligent Computing and Cybernetics, 5(4):473–499.
  • Iori and Martello [2010] Iori, M. and Martello, S. (2010). Routing problems with loading constraints. Top, 18(1):4–27.
  • Johnson [1973] Johnson, D. S. (1973). Near-optimal bin packing algorithms. PhD thesis, Massachusetts Institute of Technology.
  • Michalewicz et al. [2009] Michalewicz, Z., Ibrahimov, M., Mohais, A., Schellenberg, S., and Wagner, N. (2009). Applications of evolutionary methods for complex industrial problems.
  • Perl and Daskin [1985] Perl, J. and Daskin, M. S. (1985). A warehouse location-routing problem. Transportation Research Part B: Methodological, 19(5):381 – 396.
  • Polyakovskiy et al. [2017] Polyakovskiy, S., Makarowsky, A., and M’Hallah, R. (2017). Just-in-time batch scheduling problem with two-dimensional bin packing constraints. In Proceedings of the Genetic and Evolutionary Computation Conference, pages 321–328. ACM.
  • Przybylek et al. [2016] Przybylek, M. R., Wierzbicki, A., and Michalewicz, Z. (2016). Multi-hard problems in uncertain environment. In Proceedings of the Genetic and Evolutionary Computation Conference 2016, pages 381–388. ACM.
  • Renaud et al. [1996] Renaud, J., Laporte, G., and Boctor, F. F. (1996).

    A tabu search heuristic for the multi-depot vehicle routing problem.

    Computers & Operations Research, 23(3):229–235.
  • Stolk et al. [2013] Stolk, J., Mann, I., Mohais, A., and Michalewicz, Z. (2013). Combining vehicle routing and packing for optimal delivery schedules of water tanks. OR Insight, 26(3):167–190.