Some Network Optimization Models under Diverse Uncertain Environments
- URL: http://arxiv.org/abs/2103.08327v1
- Date: Sun, 21 Feb 2021 13:48:15 GMT
- Title: Some Network Optimization Models under Diverse Uncertain Environments
- Authors: Saibal Majumder
- Abstract summary: This thesis proposes seven different network models under different uncertain paradigms.
The corresponding crisp equivalents of the uncertain network models are solved using different solution methodologies.
- Score: 0.0
- License: http://creativecommons.org/publicdomain/zero/1.0/
- Abstract: Network models provide an efficient way to represent many real life problems
mathematically. In the last few decades, the field of network optimization has
witnessed an upsurge of interest among researchers and practitioners. The
network models considered in this thesis are broadly classified into four types
including transportation problem, shortest path problem, minimum spanning tree
problem and maximum flow problem. Quite often, we come across situations, when
the decision parameters of network optimization problems are not precise and
characterized by various forms of uncertainties arising from the factors, like
insufficient or incomplete data, lack of evidence, inappropriate judgements and
randomness. Considering the deterministic environment, there exist several
studies on network optimization problems. However, in the literature, not many
investigations on single and multi objective network optimization problems are
observed under diverse uncertain frameworks. This thesis proposes seven
different network models under different uncertain paradigms. Here, the
uncertain programming techniques used to formulate the uncertain network models
are (i) expected value model, (ii) chance constrained model and (iii) dependent
chance constrained model. Subsequently, the corresponding crisp equivalents of
the uncertain network models are solved using different solution methodologies.
The solution methodologies used in this thesis can be broadly categorized as
classical methods and evolutionary algorithms. The classical methods, used in
this thesis, are Dijkstra and Kruskal algorithms, modified rough Dijkstra
algorithm, global criterion method, epsilon constraint method and fuzzy
programming method. Whereas, among the evolutionary algorithms, we have
proposed the varying population genetic algorithm with indeterminate crossover
and considered two multi objective evolutionary algorithms.
Related papers
- Diffusion Models as Network Optimizers: Explorations and Analysis [71.69869025878856]
generative diffusion models (GDMs) have emerged as a promising new approach to network optimization.
In this study, we first explore the intrinsic characteristics of generative models.
We provide a concise theoretical and intuitive demonstration of the advantages of generative models over discriminative network optimization.
arXiv Detail & Related papers (2024-11-01T09:05:47Z) - Model Based and Physics Informed Deep Learning Neural Network Structures [7.095119621199481]
Neural Networks (NN) has been used in many areas with great success.
One of the great difficulties is the choice of the NN's structure.
We consider this problem using model based signal and image processing and inverse problems methods.
arXiv Detail & Related papers (2024-08-13T07:28:38Z) - Optimizing Solution-Samplers for Combinatorial Problems: The Landscape
of Policy-Gradient Methods [52.0617030129699]
We introduce a novel theoretical framework for analyzing the effectiveness of DeepMatching Networks and Reinforcement Learning methods.
Our main contribution holds for a broad class of problems including Max-and Min-Cut, Max-$k$-Bipartite-Bi, Maximum-Weight-Bipartite-Bi, and Traveling Salesman Problem.
As a byproduct of our analysis we introduce a novel regularization process over vanilla descent and provide theoretical and experimental evidence that it helps address vanishing-gradient issues and escape bad stationary points.
arXiv Detail & Related papers (2023-10-08T23:39:38Z) - Optimization and Optimizers for Adversarial Robustness [10.279287131070157]
In this paper, we introduce a novel framework that blends a general-purpose constrained-optimization solver with Constraint Folding.
Regarding reliability, PWCF provides solutions with stationarity measures and feasibility tests to assess the solution quality.
We further explore the distinct patterns in the solutions found for solving these problems using various combinations of losses, perturbation models, and optimization algorithms.
arXiv Detail & Related papers (2023-03-23T16:22:59Z) - FAS-UNet: A Novel FAS-driven Unet to Learn Variational Image
Segmentation [3.741136641573471]
We propose a novel variational-model-informed network (FAS-Unet) that exploits the model and algorithm priors to extract the multi-scale features.
The proposed network integrates image data and mathematical models, and implements them through learning a few convolution kernels.
Experimental results show that the proposed FAS-Unet is very competitive with other state-of-the-art methods in qualitative, quantitative and model complexity evaluations.
arXiv Detail & Related papers (2022-10-27T04:15:16Z) - Multi-Objective Policy Gradients with Topological Constraints [108.10241442630289]
We present a new algorithm for a policy gradient in TMDPs by a simple extension of the proximal policy optimization (PPO) algorithm.
We demonstrate this on a real-world multiple-objective navigation problem with an arbitrary ordering of objectives both in simulation and on a real robot.
arXiv Detail & Related papers (2022-09-15T07:22:58Z) - Modeling Design and Control Problems Involving Neural Network Surrogates [1.1602089225841632]
We consider nonlinear optimization problems that involve surrogate models represented by neural networks.
We show how to directly embed neural network evaluation into optimization models, highlight a difficulty with this approach that can prevent convergence.
We present two alternative formulations of these problems in the specific case of feedforward neural networks with ReLU activation.
arXiv Detail & Related papers (2021-11-20T01:09:15Z) - A review of approaches to modeling applied vehicle routing problems [77.34726150561087]
We review the approaches for modeling vehicle routing problems.
We formulate several criteria for evaluating modeling methods.
We discuss several future research avenues in the field of modeling VRP domains.
arXiv Detail & Related papers (2021-05-23T14:50:14Z) - Binary Neural Networks: A Survey [126.67799882857656]
The binary neural network serves as a promising technique for deploying deep models on resource-limited devices.
The binarization inevitably causes severe information loss, and even worse, its discontinuity brings difficulty to the optimization of the deep network.
We present a survey of these algorithms, mainly categorized into the native solutions directly conducting binarization, and the optimized ones using techniques like minimizing the quantization error, improving the network loss function, and reducing the gradient error.
arXiv Detail & Related papers (2020-03-31T16:47:20Z) - GACEM: Generalized Autoregressive Cross Entropy Method for Multi-Modal
Black Box Constraint Satisfaction [69.94831587339539]
We present a modified Cross-Entropy Method (CEM) that uses a masked auto-regressive neural network for modeling uniform distributions over the solution space.
Our algorithm is able to express complicated solution spaces, thus allowing it to track a variety of different solution regions.
arXiv Detail & Related papers (2020-02-17T20:21:20Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.