A Multi-Objective Anti-Predatory NIA for E-Commerce Logistics Optimization Problem

2021 ◽  
Vol 12 (4) ◽  
pp. 1-27
Author(s):  
Rohit Kumar Sachan ◽  
Dharmender Singh Kushwaha
Keyword(s):  
Optimization Problems ◽  
Rank Test ◽  
Hub Location ◽  
Hub Location Problem ◽  
Defense Behavior ◽  
Logistics Industry ◽  
Multi Objective ◽  
Self Defense ◽  
Nature Inspired Algorithms ◽  
Single Objective

Nature-inspired algorithms (NIAs) have established their promising performance to solve both single-objective optimization problems (SOOPs) and multi-objective optimization problems (MOOPs). Anti-predatory NIA (APNIA) is one of the recently introduced single-objective algorithm based on the self-defense behavior of frogs. This paper extends APNIA as multi-objective algorithm and presents the first proposal of APNIA to solve MOOPs. The proposed algorithm is a posteriori version of APNIA, which is named as multi-objective anti-predatory NIA (MO-APNIA). It uses the concept of Pareto dominance to determine the non-dominated solutions. The performance of the MO-APNIA is established through the experimental evaluation and statistically verified using the Friedman rank test and Holm-Sidak test. MO-APNIA is also employed to solve a multi-objective variant of hub location problem (HLP) from the perspective of the e-commerce logistics. Results indicate that the MO-APNIA is also capable to finds the non-dominated solutions of HLP. This finds immense use in logistics industry.

scholarly journals An Overview of Few Nature Inspired Optimization Techniques and Its Reliability Applications

2020 ◽  
Vol 5 (4) ◽  
pp. 732-743
Author(s):  
Nitin Uniyal ◽  
Sangeeta Pant ◽  
Anuj Kumar
Keyword(s):  
Optimization Problems ◽  
Optimization Techniques ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Research Fields ◽  
Research Problems ◽  
Nature Inspired Algorithms ◽  
New Algorithms ◽  
Single Objective

Optimization has been a hot topic due to its inevitably in the development of new algorithms in almost every applied branch of Mathematics. Despite the broadness of optimization techniques in research fields, there is always an open scope of further refinement. We present here an overview of nature-inspired optimization with a subtle background of fundamentals and classification and their reliability applications. An attempt has been made to exhibit the contrast nature of multi objective optimization as compared to single objective optimization. Though there are various techniques to achieve the optimality in optimization problems but nature inspired algorithms have proved to be very efficient and gained special attention in modern research problems. The purpose of this article is to furnish the foundation of few nature inspired optimization techniques and their reliability applications to an interested researcher.

Anti-Predatory NIA for Unconstrained Mathematical Optimization Problems

2020 ◽  
Vol 11 (1) ◽  
pp. 1-23 ◽  
Author(s):  
Rohit Kumar Sachan ◽  
Dharmender Singh Kushwaha
Keyword(s):  
Defense Mechanisms ◽  
Heuristic Algorithms ◽  
Optimization Problems ◽  
Mathematical Optimization ◽  
Unconstrained Minimization ◽  
Predatory Behavior ◽  
Performance Comparison ◽  
Rank Test ◽  
Self Defense ◽  
Nature Inspired Algorithms

Nature-Inspired Algorithms (NIAs) are one of the most efficient methods to solve the optimization problems. A recently proposed NIA is the anti-predatory NIA, which is based on the anti-predatory behavior of frogs. This algorithm uses five different types of self-defense mechanisms in order to improve its anti-predatory strength. This paper demonstrates the computation steps of anti-predatory for solving the Rastrigin function and attempts to solve 20 unconstrained minimization problems using anti-predatory NIA. The performance of anti-predatory NIA is compared with the six competing meta-heuristic algorithms. A comparative study reveals that the anti-predatory NIA is a more promising than the other algorithms. To quantify the performance comparison between the algorithms, Friedman rank test and Holm-Sidak test are used as statistical analysis methods. Anti-predatory NIA ranks first in both cases of “Mean Result” and “Standard Deviation.” Result measures the robustness and correctness of the anti-predatory NIA. This signifies the worth of anti-predatory NIA in the domain of mathematical optimization.

A Generalized and Robust Anti-Predatory Nature-Inspired Algorithm for Complex Problems

2019 ◽  
Vol 10 (1) ◽  
pp. 75-91 ◽  
Author(s):  
Rohit Kumar Sachan ◽  
Dharmender Singh Kushwaha
Keyword(s):  
Standard Deviation ◽  
Defense Mechanism ◽  
Mathematical Formulation ◽  
Predatory Behavior ◽  
Rank Test ◽  
Bee Colony ◽  
Self Defense ◽  
Nature Inspired Algorithm ◽  
Nature Inspired Algorithms ◽  
Result Analysis

This article describes how nature-inspired algorithms (NIAs) have evolved as efficient approaches for addressing the complexities inherent in the optimization of real-world applications. These algorithms are designed to imitate processes in nature that provide some ways of problem solving. Although various nature-inspired algorithms have been proposed by various researchers in the past, a robust and computationally simple NIA is still missing. A novel nature-inspired algorithm that adapts to the anti-predatory behavior of the frog is proposed. The algorithm mimics the self defense mechanism of a frog. Frogs use their reflexes as a means of protecting themselves from the predators. A mathematical formulation of these reflexes forms the core of the proposed approach. The robustness of the proposed algorithm is verified through performance evaluation on sixteen different unconstrained mathematical benchmark functions based on best and worst values as well as mean and standard deviation of the computed results. These functions are representative of different properties and characteristics of the problem domain. The strength and robustness of the proposed algorithm is established through a comparative result analysis with six well-known optimization algorithms, namely: genetic, particle swarm, differential evolution, artificial bee colony, teacher learning and Jaya. The Friedman rank test and the Holm-Sidak test have been used for statistical analysis of obtained results. The proposed algorithm ranks first in the case of mean result and scores second rank in the case of “standard deviation”. This proves the significance of the proposed algorithm.

An Interactive Neural Network for Constrained Multi-Objective Optimization with Application to the Design of Digital Filters

2012 ◽  
Vol 433-440 ◽  
pp. 2808-2816
Author(s):  
Jian Jin Zheng ◽  
You Shen Xia
Keyword(s):  
Neural Network ◽  
Neural Networks ◽  
Computational Complexity ◽  
Digital Filters ◽  
Optimization Problem ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Multi Objective Optimization ◽  
Multi Objective ◽  
Single Objective

This paper presents a new interactive neural network for solving constrained multi-objective optimization problems. The constrained multi-objective optimization problem is reformulated into two constrained single objective optimization problems and two neural networks are designed to obtain the optimal weight and the optimal solution of the two optimization problems respectively. The proposed algorithm has a low computational complexity and is easy to be implemented. Moreover, the proposed algorithm is well applied to the design of digital filters. Computed results illustrate the good performance of the proposed algorithm.

The Hybrid Differential Evolution with Dynamic Scaling Mutation and Wrapper Local Search for Optimization Problems

2013 ◽  
Vol 479-480 ◽  
pp. 989-995
Author(s):  
Chun Liang Lu ◽  
Shih Yuan Chiu ◽  
Chih Hsu Hsu ◽  
Shi Jim Yen
Keyword(s):  
Local Search ◽  
Differential Evolution ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Optimization Problems ◽  
Search Space ◽  
Dynamic Scaling ◽  
Multi Objective ◽  
Wide Range ◽  
Single Objective

In this paper, an improved hybrid Differential Evolution (DE) is proposed to enhance optimization performance by cooperating Dynamic Scaling Mutation (DSM) and Wrapper Local Search (WLS) schemes. When evolution speed is standstill, DSM can improve searching ability to achieve better balance between exploitation and exploration in the search space. Furthermore, WLS can disturb individuals to fine tune the searching range around and then properly find better solutions in the evolution progress. The effective particle encoding representation named Particle Segment Operation-Machine Assignment (PSOMA) that we previously published is also applied to always produce feasible candidate solutions for hybrid DE model to solve the Flexible Job-Shop Scheduling Problem (FJSP). To test the performance of the proposed hybrid method, the experiments contain five frequently used CEC 2005 numerical functions and three representative FJSP benchmarks for single-objective and multi-objective optimization verifications, respectively. Compare the proposed method with the other related published algorithms, the simulation results indicate that our proposed method exhibits better performance for solving most the test functions for single-objective problems. In addition, the wide range of Pareto-optimal solutions and the more Gantt chart diversities can be obtained for the multi-objective FJSP in practical decision-making considerations.

scholarly journals A NEW PROBABILISTIC ALGORITHM FOR SOLVING A CLASS OF SINGLE OR MULTI-OBJECTIVE OPTIMAL PROBLEMS

2009 ◽  
Vol 12 (11) ◽  
pp. 11-26
Author(s):  
Hao Van Tran ◽  
Thong Huu Nguyen
Keyword(s):  
Numerical Optimization ◽  
Optimization Problems ◽  
Optimization Technique ◽  
Fixed Number ◽  
Optimal Solutions ◽  
Multi Objective Optimization ◽  
Probabilistic Algorithm ◽  
Multi Objective ◽  
Single Objective

We consider a class of single-objective optimization problems which haves the character: there is a fixed number k (1≤k<n) that is independent of the size n of the problem such that if we only need to change values of k variables then it has the ability to find a better solution than the current one, let us call it Ok. In this paper, we propose a new numerical optimization technique, Search Via Probability (SVP) algorithm, for solving single objective optimization problems of the class Ok. The SVP algorithm uses probabilities to control the process of searching for optimal solutions. We calculate probabilities of the appearance of a better solution than the current one on each of iterations, and on the performance of SVP algorithm we create good conditions for its appearance. We tested this approach by implementing the SVP algorithm on some test single-objective and multi objective optimization problems, and we found good and very stable results.

Nature Inspired Methods for Multi-Objective Optimization

2010 ◽  
pp. 95-108 ◽  
Author(s):  
Sanjoy Das ◽  
Bijaya K. Panigrahi ◽  
Shyam S. Pattnaik
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Problems ◽  
Artificial Immune Systems ◽  
Multi Objective Optimization ◽  
Nsga Ii ◽  
Swarm Optimization ◽  
Immune Systems ◽  
Multi Objective ◽  
Key Issues ◽  
Nature Inspired Algorithms

This chapter focuses on the concepts of dominance and Pareto-optimality. It then addresses key issues in applying three basic classes of nature inspired algorithms – evolutionary algorithms, particle swarm optimization, and artificial immune systems, to multi-objective optimization problems. As case studies, the most significant multi-objective algorithm from each class is described in detail. Two of these, NSGA-II and MOPSO, are widely used in engineering optimization, while the others show excellent performances. As hybrid algorithms are becoming increasingly popular in optimization, this chapter includes a brief discussion of hybridization within a multi-objective framework.

Sign in / Sign up

Export Citation Format

Share Document