A decomposition-based memetic algorithm using helper objectives for shortwave radio broadcast resource allocation problem in China

Zhou, Yupeng; Fan, Mingjie; Ma, Feifei; Xu, Xin; Yin, Minghao

doi:10.1016/j.asoc.2020.106251

Cited by 4 publications

(4 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Reporter responsibilities include reporting, collecting, writing, and reporting local news stories. According to Errol, in addition to being able to write a reporter, he must also meet the qualifications of a radio reporter, including understanding and understanding various terms, theories, and journalism education (Zhou, 2020). A reporter is also required to maintain sound quality so that listeners are willing to listen to the news they report and be objective about the news they report.…”

Section: Reportermentioning

confidence: 99%

Analysis of Radio Broadcast

Ramadhani,

Ataqiya,

Haris

et al. 2022

JIDC

View full text Add to dashboard Cite

Radio is a public media that conveys the content of its message in the form of information, entertainment, news, and education by audio. In broadcasting, the Radio should have a program that suits the tastes of listeners, has excellent programs, and broadcasters who have their own privileges in communicating with their listeners, as is the case with this Fuad FM radio with some of its program programs that adjust the tastes of its listeners, besides that it does not forget to make its flagship show programs. Therefore, the purpose of this study is to analyze radio broadcast programs in general. The motto used is a qualitative research method. The results obtained from this study show an in-depth analysis of the ins and outs of radio broadcasting, starting from the programs, strategies for creating programs, factors, and others. So, a broadcast program is everything that a broadcasting station displays in the form of sound, image, or sound and image or in the form of graphics, and characters, whether interactive or not, that can be received through a broadcast receiving device to meet the needs of its audience.

show abstract

Section: Reportermentioning

confidence: 99%

Analysis of Radio Broadcast

Ramadhani,

Ataqiya,

Haris

et al. 2022

JIDC

View full text Add to dashboard Cite

show abstract

“…When solving discrete scheduling problems based on job sequence, the probability factor is mainly used to determine the crossed jobs [38]. In this study, we improved the determination method of the crossed jobs by eliminating the crossover probability factor and proposed a random crossover operator: First, select two jobs randomly from the mutated individual π V ; second, put these two jobs and jobs between them in a temporary set N temp ; third, determine the positions in π d of all jobs from N temp , remove all jobs from N temp and keep their positions.…”

Section: Crossovermentioning

confidence: 99%

“…In evolutionary computing, MA can combine various global and local strategies to construct different search frameworks, which possess the characteristics of GA but with stronger merit-seeking ability. MA was widely applied in many engineering problems, such as vehicle path planning [35], home care routing [36], bin packing problem [37], broadcast resource allocation [38], and production scheduling optimization [39][40][41]. Until now, MA has not been applied to solve DBFSP in a dynamic environment(DDBFSP), it will be of significance to extend MA as a solver for DDBFSP.…”

Section: Introductionmentioning

confidence: 99%

Rescheduling of Distributed Manufacturing System with Machine Breakdowns

et al. 2022

View full text Add to dashboard Cite

This study attempts to explore the dynamic scheduling problem from the perspective of operational research optimization. The goal is to propose a rescheduling framework for solving distributed manufacturing systems that consider random machine breakdowns as the production disruption. We establish a mathematical model that can better describe the scheduling of the distributed blocking flowshop. To realize the dynamic scheduling, we adopt an “event-driven” policy and propose a two-stage “predictive-reactive” method consisting of two steps: initial solution pre-generation and rescheduling. In the first stage, a global initial schedule is generated and considers only the deterministic problem, i.e., optimizing the maximum completion time of static distributed blocking flowshop scheduling problems. In the second stage, that is, after the breakdown occurs, the rescheduling mechanism is triggered to seek a new schedule so that both maximum completion time and the stability measure of the system can be optimized. At the breakdown node, the operations of each job are classified and a hybrid rescheduling strategy consisting of “right-shift repair + local reorder” is performed. For local reorder, we designed a discrete memetic algorithm, which embeds the differential evolution concept in its search framework. To test the effectiveness of DMA, comparisons with mainstream algorithms are conducted on instances with different scales. The statistical results show that the ARPDs obtained from DMA are improved by 88%.

show abstract

“…In this way, the heuristic algorithm becomes a good choice. Although a large number of heuristic methods have been proposed to solve various optimization problems (Zhou et al, 2018(Zhou et al, , 2020Arasteh et al, 2020;Shomali and Arasteh, 2020), as far as we know, no heuristic algorithms exist to solve the PSCP. Therefore, the purpose of this work is to enrich the repertory of solution methods for PSCP by presenting a novel Argentine ant system (AAS) algorithm.…”

Section: Introductionmentioning

confidence: 99%

An Argentine ant system algorithm for partial set covering problem

Liu

Zhou

Yin

et al. 2022

DTA

View full text Add to dashboard Cite

PurposeThe paper aims to provide an efficient meta-heuristic algorithm to solve the partial set covering problem (PSCP). With rich application scenarios, the PSCP is a fascinating and well-known non-deterministic polynomial (NP)-hard problem whose goal is to cover at least k elements with as few subsets as possible.Design/methodology/approachIn this work, the authors present a novel variant of the ant colony optimization (ACO) algorithm, called Argentine ant system (AAS), to deal with the PSCP. The developed AAS is an integrated system of different populations that use the same pheromone to communicate. Moreover, an effective local search framework with the relaxed configuration checking (RCC) and the volatilization-fixed weight mechanism is proposed to improve the exploitation of the algorithm.FindingsA detailed experimental evaluation of 75 instances reveals that the proposed algorithm outperforms the competitors in terms of the quality of the optimal solutions. Also, the performance of AAS gradually improves with the growing instance size, which shows the potential in handling complex practical scenarios. Finally, the designed components of AAS are experimentally proved to be beneficial to the whole framework. Finally, the key components in AAS have been demonstrated.Originality/valueAt present, there is no heuristic method to solve this problem. The authors present the first implementation of heuristic algorithm for solving PSCP and provide competitive solutions.

show abstract

A decomposition-based memetic algorithm using helper objectives for shortwave radio broadcast resource allocation problem in China

Cited by 4 publications

References 38 publications

Analysis of Radio Broadcast

Analysis of Radio Broadcast

Rescheduling of Distributed Manufacturing System with Machine Breakdowns

An Argentine ant system algorithm for partial set covering problem

Contact Info

Product

Resources

About