Abstract
Discrete versions of CS are applied to solve several combinatorial optimization problems (Yang and Deb 2014; Fister et al. 2014; Shehab et al. 2017). In all these applications, the real constraint is not enhancing the robustness of CS and solve efficiently these problems, but keeping its robustness in the adaptation and implementation phases for each specific problem such as optimal Distributed Generation (DG) allocation in a smart distribution grid (Buaklee and Hongesombut 2013), parallel machine scheduling (Guo et al. 2015), flow shop scheduling (Wang et al. 2017), optimal power flow (Mishra et al. 2015), graph coloring problem (Mahmoudi and Lotfi 2015), vehicle routing problem (Zheng et al. 2013), and reliability optimization problems (Valian et al. 2013). However, even if these phases are validated, generalizing DCS to solve all these problems and others is stilling an independent issue.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Applegate D, Cook W (1991) A computational study of the job-shop scheduling problem. ORSA J Comput 3(2):149–156
Buaklee W, Hongesombut K (2013) Optimal dg allocation in a smart distribution grid using cuckoo search algorithm. In: 2013 10th international conference on electrical engineering/electronics, computer, telecommunications and information technology. IEEE, pp 1–6
Burkard RE, Karisch SE, Rendl F (1997) Qaplib-a quadratic assignment problem library. J Glob Optim 10(4):391–403
Croes A (1958) A method for solving traveling salesman problems. Oper Res: 791–812
Davendra D, Zelinka I (2012) Optimization of quadratic assignment problem using self organising migrating algorithm. Comput Inform 28(2):169–180
Fister I Jr, Yang X-S, Fister D, Fister I (2014) Cuckoo search: a brief literature review. In: Cuckoo search and firefly algorithm. Springer, pp 49–62
Guo P, Cheng W, Wang Y (2015) Parallel machine scheduling with step-deteriorating jobs and setup times by a hybrid discrete cuckoo search algorithm. Eng Optim 47(11):1564–1585
Koopmans TC, Beckmann M (1957) Assignment problems and the location of economic activities. Econ: J Econ Soc:53–76
Mahmoudi S, Lotfi S (2015) Modified cuckoo optimization algorithm (mcoa) to solve graph coloring problem. Appl Soft Comput 33:48–64
Manne AS (1960) On the job-shop scheduling problem. Oper Res 8(2):219–223
Mishra C, Singh SP, Rokadia J (2015) Optimal power flow in the presence of wind power using modified cuckoo search. IET Gener Transm Distrib 9(7):615–626
Ouaarab A, Ahiod B, Yang X-S (2014) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 24(7–8):1659–1669
Reinelt G (1991) Tspliba traveling salesman problem library. ORSA J Comput 3(4):376–384
Sahni S, Gonzalez T (1976) P-complete approximation problems. J ACM (JACM) 23(3):555–565
Shehab M, Khader AT, Al-Betar MA (2017) A survey on applications and variants of the cuckoo search algorithm. Appl Soft Comput 61:1041–1059
Taillard E (1991) Robust taboo search for the quadratic assignment problem. Parallel Comput 17(4):443–455
Valian E, Tavakoli S, Mohanna S, Haghi A (2013) Improved cuckoo search for reliability optimization problems. Comput Ind Eng 64(1):459–468
Wang H, Wang W, Sun H, Cui Z, Rahnamayan S, Zeng S (2017) A new cuckoo search algorithm with hybrid strategies for flow shop scheduling problems. Soft Comput 21(15):4297–4307
Yang XS, Deb S (2009) Cuckoo search via lévy flights. In: World congress on nature and biologically inspired computing, 2009. NaBIC 2009. IEEE, pp 210–214
Yang X-S, Deb S (2014) Cuckoo search: recent advances and applications. Neural Comput Appl 24(1):169–174
Zheng HQ, Zhou Y, Luo Q (2013) A hybrid cuckoo search algorithm-grasp for vehicle routing problem. J Converg Inf Technol 8(3)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this chapter
Cite this chapter
Ouaarab, A. (2020). DCS Applications. In: Discrete Cuckoo Search for Combinatorial Optimization. Springer Tracts in Nature-Inspired Computing. Springer, Singapore. https://doi.org/10.1007/978-981-15-3836-0_5
Download citation
DOI: https://doi.org/10.1007/978-981-15-3836-0_5
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-3835-3
Online ISBN: 978-981-15-3836-0
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)