A multi-objective antlion optimizer for the ring tree problem with secondary sub-depots

Mukherjee, Anupam; Barma, Partha Sarathi; Dutta, Joydeep; Panigrahi, Goutam; Kar, Samarjit; Maiti, Manoranjan

doi:10.1007/s12351-021-00623-8

Cited by 4 publications

(6 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The authors of [30] deal with a multi-objective ring tree problem with secondary sub-depots. They specify a fixed node as depot and define other primary and secondary subdepots in combination with three types of customers.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Tackling the rich vehicle routing problem with nature-inspired algorithms

Lesch

König²,

Kounev

et al. 2022

Appl Intell

View full text Add to dashboard Cite

In the last decades, the classical Vehicle Routing Problem (VRP), i.e., assigning a set of orders to vehicles and planning their routes has been intensively researched. As only the assignment of order to vehicles and their routes is already an NP-complete problem, the application of these algorithms in practice often fails to take into account the constraints and restrictions that apply in real-world applications, the so called rich VRP (rVRP) and are limited to single aspects. In this work, we incorporate the main relevant real-world constraints and requirements. We propose a two-stage strategy and a Timeline algorithm for time windows and pause times, and apply a Genetic Algorithm (GA) and Ant Colony Optimization (ACO) individually to the problem to find optimal solutions. Our evaluation of eight different problem instances against four state-of-the-art algorithms shows that our approach handles all given constraints in a reasonable time.

show abstract

Section: Related Workmentioning

confidence: 99%

“…alike. In literature, one can identify several works that provide a multi-objective approach (e.g., [5,16,30]). However, none of them also integrates such real-world constraints as mentioned before, which highly complicates the finding of solutions.…”

Section: Practical Implicationsmentioning

confidence: 99%

Tackling the rich vehicle routing problem with nature-inspired algorithms

Lesch

König²,

Kounev

et al. 2022

Appl Intell

View full text Add to dashboard Cite

show abstract

“…To forecast students' outcomes by improving the faculty and students' learning experiences Rashid et al (2019) presented a hybrid system a multi hidden recurrent neural network with a modified grey wolf optimizer. Mukherjee et al (2021) presented the idea of a multi-objective antlion optimizer for the ring tree problem with secondary sub-depots (MORTPSSD), to overcome the problems of telecommunication and logistics networks by minimizing the circuits' total routing cost. In addition to the above optimizer for secondary depots Mukherjee et al (2021) introduced a modified discrete antlion optimizer for the ring star problem (RSPSSD) which overcomes the challenge of minimizing the cost by selecting the suitable primary and secondary subdepots.…”

Section: Literature Reviewmentioning

confidence: 99%

Optimization of Complex System Reliability using Hybrid Grey Wolf Optimizer

Negi

Kumar

Pant

et al. 2021

Decis. Mak. Appl. Manag. Eng.

View full text Add to dashboard Cite

Reliability allocation to increase the total reliability has become a successful way to increase the efficiency of the complex industrial system designs. A lot of research in the past have tackled this problem to a great extent. This is evident from the different techniques developed so far to achieve the target. Stochastic metaheuristics like simulated annealing, Tabu search (TS), Particle Swarm Optimization (PSO), Cuckoo Search Optimization (CS), Genetic Algorithm (GA), Grey wolf optimization technique (GWO) etc. have been used in recent years. This paper proposes a framework for implementing a hybrid PSO-GWO algorithm for solving some reliability allocation and optimization problems. A comparison of the results obtained is done with the results of other well-known methods like PSO, GWO, etc. The supremacy/competitiveness of the proposed framework is demonstrated from the numerical experiments. These results with regard to the time taken for the computation and quality of solution outperform the previously obtained results by the other well-known optimization methods.

show abstract

“…Recently, a hybrid algorithm consisting of dynamic programming and ant colony optimization (ACO) was developed by Salari et al (2015). Mukherjee et al ( , 2021 have worked on ring star and ring tree problems considering an extra layer of rings. This second layer consists of secondary sub-depots.…”

Section: Introductionmentioning

confidence: 99%

“…The authors have used their single and multi-objective discrete versions of the antlion optimizer. Barma et al (2021) proposed a multi-objective ring-star vehicle routing problem with perishable items. The authors have considered an m-ring star network to speed up the routing process.…”

Section: Introductionmentioning

confidence: 99%

Imprecise covering ring star problem

Mukherjee¹,

Barma²,

Dutta³

et al. 2023

Decis. Mak. Appl. Manag. Eng.

View full text Add to dashboard Cite

In this paper, we formulate and solve an Imprecise Covering Ring Star Problem (ICRSP), which is a generalization of the Ring Star Problem (RSP). Here the objective of this problem is to find a subset of nodes in a network to minimize the sum of routing costs of interconnecting cycle and assignment costs of the nodes which are out of cycle, to their nearest concentrators such that no assigned node exceeds a predetermined distance (say, covering distance) from the concentrators. The covering distance, as well as the routing and assignments costs, are considered as fuzzy in the proposed ICRSP. A Modified Genetic Algorithm (MGA) is developed and used to solve this model for different confidence levels depending on the corresponding imprecise parameters, reducing it to deterministic form with fuzzy possibility and necessity approaches. Some comparisons with existing benchmark problems are made to justify the performance of the algorithm. As individual cases, some practical ICRSPs are also solved and presented numerically.

show abstract

A multi-objective antlion optimizer for the ring tree problem with secondary sub-depots

Cited by 4 publications

References 37 publications

Tackling the rich vehicle routing problem with nature-inspired algorithms

Tackling the rich vehicle routing problem with nature-inspired algorithms

Optimization of Complex System Reliability using Hybrid Grey Wolf Optimizer

Imprecise covering ring star problem

Contact Info

Product

Resources

About