An effective fireworks algorithm for warehouse-scheduling problem. (January 2017)

• Record Type: Journal Article
• Authors: Ye, Sengang; Ma, Haiping; Xu, Sheng; Yang, Wenqiang; Fei, Minrui
• Is Part Of: Transactions of the Institute of Measurement and Control. Volume 39:Number 1(2017)
• Page Start: 75
• Page End: 85
• Publication Date: 2017-01
• Subjects: Fireworks algorithm -- heuristic algorithm -- local search -- travel time analysis -- warehouse scheduling; Automatic control -- Periodicals; Measuring instruments -- Periodicals; Commande automatique -- Périodiques; Mesure -- Instruments -- Périodiques; 681.2
• DOI: 10.1177/0142331215600047
• Languages: English
• ISSNs: 0142-3312

Abstract

This paper proposes an effective fireworks algorithm (FWA), which is a new heuristic algorithm inspired by the phenomenon of a fireworks display, to solve the warehouse-scheduling problem. First, a real-world warehouse-scheduling problem is described in detail, and it is formulated as a constrained single-objective optimization problem. Then an effective FWA, FWA-LSCM, is developed by combining with a local search method and chaotic mutation, which are used to balance the exploration and exploitation of FWA. The experimental results show that FWA-LSCM is a competitive algorithm for a set of 2013 Congress on Evolutionary Computation (CEC) benchmark functions. Finally, the proposed FWA-LSCM is successfully applied to the warehouse-scheduling problem and outperforms other FWA algorithms studied in this paper.