745 Hits in 5.6 sec

Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances

Md Ashikur Rahman, Rajalingam Sokkalingam, Mahmod Othman, Kallol Biswas, Lazim Abdullah, Evizal Abdul Kadir
2021 Mathematics  
Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution.  ...  As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been implemented in a wide area of combinatorial optimization problems.  ...  Acknowledgments: The authors would like to thank the Center of Graduate Studies of Universiti Teknologi PETRONAS and the YUTP research fund (015LCO-296) for the funding of this research.  ... 
doi:10.3390/math9202633 fatcat:tk2ymswg4fau3bpx2kxmcmmyoi

Weapon Target Assignment [chapter]

Mohammad Babul Hasan, Yaindrila Barua
2020 Industrial Engineering [Working Title]  
The weapon target assignment problem (WTA) is a class of combinatorial optimization problems present in the fields of optimization and operations research.  ...  It consists of finding an optimal assignment of a set of weapons of various types to a set of targets in order to maximize the total expected damage done to the opponent.  ...  So, computational algorithms are the best approach to solve the large scale dynamic WTA problem [8] .  ... 
doi:10.5772/intechopen.93665 fatcat:yjiao3zrknguhcgo4gtusbfdtm

Optimal Advertising Campaign Generation for Multiple Brands Using MOGA

Peter J. Fleming, Maksim A. Pashkevich
2007 IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews)  
The paper proposes a new modified multiobjective genetic algorithm (MOGA) for the problem of optimal television (TV) advertising campaign generation for multiple brands.  ...  To achieve these results, the special problem-specific solution encoding, genetic operators, and original local optimization routine were developed for the algorithm.  ...  ACKNOWLEDGMENT The authors are grateful to the Omega Software GmbH for the data used in the case studies.  ... 
doi:10.1109/tsmcc.2007.900651 fatcat:nccjw62rhng4nbodi6dxpffpmi

Optimal Advertisement Placement Slot Using Knapsack Problem (A Case Study of Television Advertisement of Tv 3 Ghana)

Antony Kwarteng, Ben Asante
2017 International Journal of Engineering Research and Applications  
In this paper, the research about how to model the TV3 advertisement selection problems as 0 -1 single knapsack problem so as to maximize the returns from their commercials is presented.  ...  Dynamic programming algorithm was used to solve the problem. To carry out the computations, the computer software, matlab was used to analyze the problem.  ...  Moreover, meta-heuristics such as simulated annealing, Genetic algorithm and Tabu search are used to solve large scale problems.  ... 
doi:10.9790/9622-0704044662 fatcat:5amdpatufreitibbysmiryzvuq

A new metaheuristic genetic-based placement algorithm for 2D strip packing

Jaya Thomas, Narendra S. Chaudhari
2014 Journal of Industrial Engineering International  
The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it.  ...  Such a combination resulted in better population evolution and faster solution convergence to optimal. The approach is subjected to a comprehensive test using benchmark instances.  ...  The packing problem is not limited to industries, but can also be seen in other dimensions like in very-large-scale integration design, memory allocation during storage and in the field of optical fiber  ... 
doi:10.1007/s40092-014-0047-9 fatcat:qvtswjme5bfprjtfuhbrhoqqyi

A survey: algorithms simulating bee swarm intelligence

Dervis Karaboga, Bahriye Akay
2009 Artificial Intelligence Review  
This work presents a survey of the algorithms described based on the intelligence in bee swarms and their applications. SH (2003) Queen-bee evolution for genetic algorithms.  ...  In: International conference on multivariate statistical modelling and high dimensional data mining, Kayseri, Turkey Karaboga D, Akay B (2008b) Solving large scale numerical problems using artificial bee  ...  Navigation Bees' large scale navigation behavior inspired Bianco (2004) in order to describe a mapping paradigm.  ... 
doi:10.1007/s10462-009-9127-4 fatcat:lk3bhpg4lngrvbcuc2z7uooaue

A Novel Feature Engineering Framework in Digital Advertising Platform

2019 International Journal of Artificial Intelligence & Applications  
So, the main challenge lies in the large design space to address issues of scale, where we need to rely on a subset of well-designed features.  ...  To justify our claim, a large dataset of a running marketing campaign is used to evaluate the efficiency of the proposed approaches, where the results illustrate their benefits.  ...  Therefore, one of the main challenges in digital advertising industry lies in the large design space to address issues of scale.  ... 
doi:10.5121/ijaia.2019.10403 fatcat:febmtvrxnzaxdafsznkfowynjq

Discrete Optimization for Dynamic Systems of Operations Management in Data-Driven Society

Lu Zhen, Shuaian Wang, Xiaobo Qu, Xinchang Wang
2019 Discrete Dynamics in Nature and Society  
particle swarm optimization (PMPSO) algorithm to solve combinatorial optimization problems by introducing new particles based on the optimal particles in the population and the historical optimal particles  ...  In particular, the papers address the topics related to discrete optimization methodologies for stochastic OM problems, dynamic programming based exact methods for stochastic OM problems, system dynamics  ...  Acknowledgments e guest editorial team would like to express gratitude to all the authors for their interest in selecting this special issue as a venue for disseminating their scholarly work. e editors  ... 
doi:10.1155/2019/3597314 fatcat:yycr7svztjbyfmzlnv52d757ty

Minimization of the Total Traveling Distance and Maximum Distance by Using a Transformed-Based Encoding EDA to Solve the Multiple Traveling Salesmen Problem

S. H. Chen
2015 Mathematical Problems in Engineering  
The results show that the proposed algorithm was superior to the two-part encoding genetic algorithm in terms of minimizing the total traveling distance.  ...  A well-known in-group optimization problem is the multiple traveling salesmen problem (mTSP), which involves simultaneous assignment and sequencing procedures and are shown in different forms.  ...  Acknowledgments The author would like to thank anonymous reviewers who enhance the quality of this paper and the Minister of Science and Technology with Grant nos.  ... 
doi:10.1155/2015/640231 fatcat:jhlv27warzg5loktdp5kc767s4

Survival of the flexible: explaining the recent dominance of nature-inspired optimization within a rapidly evolving world [article]

James M Whitacre
2011 arXiv   pre-print
This study presents evidence that the use of NIM is not only growing, but indeed appears to have surpassed mathematical optimization techniques (MOT) in several important metrics related to academic research  ...  Although researchers often comment on the rising popularity of nature-inspired meta-heuristics (NIM), there has been a paucity of data to directly support the claim that NIM are growing in prominence compared  ...  On 852 large scale problems (where optimal solutions are not known), ES was shown to find what they call "near optimal" solutions 12 times faster than Simulated Annealing (SA).MAThis paper surveys memetic  ... 
arXiv:0907.0332v3 fatcat:dz233e4zbzb2hn5aqnk55tbvm4

Heterogeneous Systems Testing Techniques: An Exploratory Survey [chapter]

Ahmad Nauman Ghazi, Kai Petersen, Jürgen Börstler
2015 Lecture Notes in Business Information Processing  
on the usefulness of the techniques with respect to a defined set of outcome variables.  ...  Heterogeneous systems comprising sets of inherent subsystems are challenging to integrate. In particular, testing for interoperability and conformance is a challenge.  ...  Search-Based Software Testing: In search-based testing meta-heuristics are used to solve software testing problems by using, for example genetic algorithms, to search for a solution for a problem (e.g.  ... 
doi:10.1007/978-3-319-13251-8_5 fatcat:egojrq2xh5bjvlaeghoicgar3q

Toward an Integrated Framework for Automated Development and Optimization of Online Advertising Campaigns [article]

Stamatina Thomaidou, Michalis Vazirgiannis, Kyriakos Liakopoulos
2012 arXiv   pre-print
The optimization module focuses on the learning process from existing campaign statistics and also from applied strategies of previous periods in order to invest optimally in the next period.  ...  Creating and monitoring competitive and cost-effective pay-per-click advertisement campaigns through the web-search channel is a resource demanding task in terms of expertise and effort.  ...  Vazirgiannis is partially supported by the DIGITEO Chair grant LEVETONE in France.  ... 
arXiv:1208.1187v1 fatcat:5xqrzfpnkvgtrkq3vtzzytdssi

Scheduling advertising slots for television

M J Brusco
2008 Journal of the Operational Research Society  
Bollapragada et al (2004) have recently identified another important scheduling problem in the television industry during the course of a large-scale research project designed to increase the revenues  ...  In: Reeves C (ed). Modern Heuristic Techniques For Combinatorial Problems. Blackwell: Oxford, pp 70-141. Goldberg DE (1989). Genetic Algorithms In Search, Optimization, And Machine Learning.  ... 
doi:10.1057/palgrave.jors.2602481 fatcat:nxpgwhlq3vgfvksmndfq66j7vm

A Collaborative Optimization Strategy for Energy Reduction in Ironmaking Digital Twin

Heng Zhou, Chunjie Yang, Youxian Sun
2020 IEEE Access  
The expenses of pig iron manufacturing stay in a relatively high level due to the large consumption of coke and ore.  ...  Finally, the improved genetic algorithm is applied to optimize the total production cost represented by the aggregation of seven coke ratios on a cloud computing platform.  ...  Since departure is around the corner, the author Heng Zhou would like to thank the company and dedication of his lab-mates along these years.  ... 
doi:10.1109/access.2020.3027544 fatcat:i5pmcsxdojhkxdgx3ga4tweone

Bee Colony Optimization - part II: The application survey

Dusan Teodorovic, Milica Selmic, Tatjana Davidovic
2015 Yugoslav Journal of Operations Research  
BCO has been successfully applied to various hard combinatorial optimization problems, mostly in transportation, location and scheduling fields.  ...  This technique was motivated by the analogy found between the natural behavior of bees searching for food and the behavior of optimization algorithms searching for an optimum in combinatorial optimization  ...  This work has been partially supported by the Serbian Ministry of Education Science and Technological Development, grants No. OI174010, OI174033, and TR36002.  ... 
doi:10.2298/yjor131029020t fatcat:zpiyfknyajekdde5n4aluv5r4a
« Previous Showing results 1 — 15 out of 745 results