A new hybrid Evolutionary Algorithm for the MinLA problem

Sharma, R.; Srivastava, Kamal

doi:10.1504/ijor.2009.025009

Cited by 5 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They used a hybrid heuristic method, which combined dual simplex and a TS to solve for the DFLP. Sharma and Srivastava (2009) presented a new hybrid evolutionary algorithm for the MinLA problem. They designed an evolutionary algorithm with a knowledge-based operator to search the solution space.…”

Section: Literature Reviewmentioning

confidence: 99%

A novel two-stage approach for solving a bi-objective facility layout problem

Mohamadi¹,

Ebrahimnejad²,

Tavakkoli–Moghaddam³

2018

IJOR

View full text Add to dashboard Cite

This paper presents a new heuristic algorithm for a facility layout problem in order to determine the entry order of departments and arrange them adjacent to each other. Additionally, another algorithm is developed to optimise the facility layout that minimises bi-objectives including the total material handling cost and dead space simultaneously. The optimised facility layout is determined by the use of three meta-heuristic algorithms, namely genetic algorithm (GA), particle swarm optimisation (PSO) and parallel simulated annealing (SA). This can be considered as a novel two-stage approach. The arrangement of facilities obtained by this approach is compared with the results of two other methods proposed in the literature. The comparison of the results shows the superiority of the proposed algorithms as compared to previous work. Furthermore, among the three algorithms, PSO and SA resulted in better overall performance with respect to cost and running time. A. Mohamadi et al.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A novel two-stage approach for solving a bi-objective facility layout problem

Mohamadi¹,

Ebrahimnejad²,

Tavakkoli–Moghaddam³

2018

IJOR

View full text Add to dashboard Cite

show abstract

“…It is worthy to mention here that the use of unary operator for producing a child is suggested by Fogel et al (1966), Eiben and Schippers (1998). In addition, such operators have been used in the EAs designed for graph layout problems (Bansal et al 2008;Sharma and Srivastava 2009). …”

Section: Reproductionmentioning

confidence: 99%

A memetic algorithm for the cyclic antibandwidth maximization problem

Bansal

Srivastava

2009

Soft Comput

Self Cite

View full text Add to dashboard Cite

The cyclic antibandwidth problem is to embed the vertices of a graph G of n vertices on a cycle C n such that the minimum distance (measured in the cycle) of adjacent vertices is maximized. Exact results/conjectures for this problem exist in the literature for some standard graphs, such as paths, cycles, two-dimensional meshes, and tori, but no algorithm has been proposed for the general graphs in the literature reviewed by us so far. In this paper, we propose a memetic algorithm for the cyclic antibandwidth problem (MACAB) that can be applied on arbitrary graphs. An important feature of this algorithm is the use of breadth first search generated level structures of a graph to explore a variety of solutions. A novel greedy heuristic is designed which explores these level structures to label the vertices of the graph. The algorithm achieves the exact cyclic antibandwidth of all the standard graphs with known optimal values. Based on our experiments we conjecture the cyclic antibandwidth of three-dimensional meshes, hypercubes, and double stars. Experiments show that results obtained by MACAB are substantially better than those given by genetic algorithm.

show abstract

Population-based iterated greedy algorithm for the S-labeling problem

Lozano

Rodríguez-Tello

2023

Computers & Operations Research

View full text Add to dashboard Cite

A new hybrid Evolutionary Algorithm for the MinLA problem

Cited by 5 publications

References 18 publications

A novel two-stage approach for solving a bi-objective facility layout problem

A novel two-stage approach for solving a bi-objective facility layout problem

A memetic algorithm for the cyclic antibandwidth maximization problem

Population-based iterated greedy algorithm for the S-labeling problem

Contact Info

Product

Resources

About