A memetic algorithm for the cyclic antibandwidth maximization problem

Bansal, Roli; Srivastava, Kamal

doi:10.1007/s00500-009-0538-6

Cited by 10 publications

(3 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Asymptotic results were also obtained for hypercube and Hamming graphs [27,30]. However, only two metaheuristic algorithms have been reported for this important problem, a Memetic Algorithm [31] and a hybrid algorithm combining the Artificial Bee Colony methodology with Tabu Search [32].…”

Section: Relevant Related Workmentioning

confidence: 96%

Tabu search for the cyclic bandwidth problem

Rodríguez-Tello¹,

Romero-Monsivais²,

Torres³

et al. 2015

Computers & Operations Research

View full text Add to dashboard Cite

Section: Relevant Related Workmentioning

confidence: 96%

Tabu search for the cyclic bandwidth problem

Rodríguez-Tello¹,

Romero-Monsivais²,

Torres³

et al. 2015

Computers & Operations Research

View full text Add to dashboard Cite

“…For selection, we use tournament operator [28]. Crossover and mutation operators are same as in HEA.…”

Section: Comparison Of Hea With Genetic Algorithmmentioning

confidence: 99%

A hybrid evolutionary algorithm for the cutwidth minimization problem

Bansal

Srivastava

2012

2012 IEEE Congress on Evolutionary Computation

Self Cite

View full text Add to dashboard Cite

Cutwidth minimization problem (CMP) consists of finding a linear layout of a graph such that the maximal number of cuts of a line separating consecutive vertices is minimized. CMP has significant applications in VLSI design, network communications, automatic graph drawings and information retrieval but it is proven to be a NP hard problem. Exact results of cutwidth are known for some classes of graphs but no algorithm has been proposed for the general graphs. In this paper, we present a hybrid evolutionary algorithm (HEA) for CMP which uses the depth first search of graph to generate the initial population and incorporates the simulated annealing in the selection process. HEA achieves the known optimal cutwidth of all the standard graphs tested. We also conjecture the cutwidth of some circulant graphs and generalized Peterson graphs supported by our experimental results.

show abstract

“…Though some research work has done on scheduling problem in hybrid flow shops with limited intermediate buffers, to our best knowledge, memetic algorithm, an efficient method for solving optimization problem in different fields [9][10][11], has not been adopted to solve this problem. So we propose a newly-designed memetic algorithm to solve the NP-hard problem in this paper.…”

Section: Introductionmentioning

confidence: 99%

Scheduling Hybrid Flow Shops by an Improved Memetic Algorithm

Bing-gang¹

2012

Proceedings of the 2nd International Conference on Computer Application and System Modeling

View full text Add to dashboard Cite

Abstract-This study is concerned about how to optimize the production sequences to minimize the makespan in hybrid flow shops with limited intermediate buffers. An improved memetic algorithm (IMA) is proposed for solving the NP-hard problem. In this algorithm, the method of generating the initial population, the local search procedures, the selection, crossover and mutation operators are newly designed. Optimization results are compared between the IMA and other three scheduling algorithms proposed in previous literature. Comparison results show that the IMA proposed in this paper is feasible and efficient for scheduling hybrid flow shops with limited intermediate buffers.

show abstract

A memetic algorithm for the cyclic antibandwidth maximization problem

Cited by 10 publications

References 27 publications

Tabu search for the cyclic bandwidth problem

Tabu search for the cyclic bandwidth problem

A hybrid evolutionary algorithm for the cutwidth minimization problem

Scheduling Hybrid Flow Shops by an Improved Memetic Algorithm

Contact Info

Product

Resources

About