IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v8y2020i4p513-d340708.html
   My bibliography  Save this article

Gene-Similarity Normalization in a Genetic Algorithm for the Maximum k -Coverage Problem

Author

Listed:
  • Yourim Yoon

    (Department of Computer Engineering, College of Information Technology, Gachon University, 1342 Seongnamdaero, Sujeong-gu, Seongnam-si, Gyeonggi-do 13120, Korea)

  • Yong-Hyuk Kim

    (School of Software, Kwangwoon University, 20 Kwangwoon-ro, Nowon-gu, Seoul 01897, Korea)

Abstract

The maximum k -coverage problem (MKCP) is a generalized covering problem which can be solved by genetic algorithms, but their operation is impeded by redundancy in the representation of solutions to MKCP. We introduce a normalization step for candidate solutions based on distance between genes which ensures that a standard crossover such as uniform and n -point crossovers produces a feasible solution and improves the solution quality. We present results from experiments in which this normalization was applied to a single crossover operation, and also results for example MKCPs.

Suggested Citation

  • Yourim Yoon & Yong-Hyuk Kim, 2020. "Gene-Similarity Normalization in a Genetic Algorithm for the Maximum k -Coverage Problem," Mathematics, MDPI, vol. 8(4), pages 1-16, April.
  • Handle: RePEc:gam:jmathe:v:8:y:2020:i:4:p:513-:d:340708
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/8/4/513/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/8/4/513/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Dorit S. Hochbaum & Anu Pathria, 1998. "Analysis of the greedy approach in problems of maximum k‐coverage," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(6), pages 615-627, September.
    2. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    3. Yong-Hyuk Kim & Alberto Moraglio & Ahmed Kattan & Yourim Yoon, 2014. "Geometric Generalisation of Surrogate Model-Based Optimisation to Combinatorial and Program Spaces," Mathematical Problems in Engineering, Hindawi, vol. 2014, pages 1-10, April.
    4. U Aickelin, 2002. "An indirect genetic algorithm for set covering problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(10), pages 1118-1126, October.
    5. Beasley, J. E. & Chu, P. C., 1996. "A genetic algorithm for the set covering problem," European Journal of Operational Research, Elsevier, vol. 94(2), pages 392-404, October.
    6. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Jaeyoung Yang & Yong-Hyuk Kim & Yourim Yoon, 2022. "A Memetic Algorithm with a Novel Repair Heuristic for the Multiple-Choice Multidimensional Knapsack Problem," Mathematics, MDPI, vol. 10(4), pages 1-15, February.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    2. Ibrahim, Walid & El-Sayed, Hesham & El-Chouemie, Amr & Amer, Hoda, 2009. "An adaptive heuristic algorithm for VLSI test vectors selection," European Journal of Operational Research, Elsevier, vol. 199(3), pages 630-639, December.
    3. F J Vasko & P J Knolle & D S Spiegel, 2005. "An empirical study of hybrid genetic algorithms for the set covering problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(10), pages 1213-1223, October.
    4. Dimitris Bertsimas & Dan A. Iancu & Dmitriy Katz, 2013. "A New Local Search Algorithm for Binary Optimization," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 208-221, May.
    5. Naji-Azimi, Zahra & Toth, Paolo & Galli, Laura, 2010. "An electromagnetism metaheuristic for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 205(2), pages 290-300, September.
    6. Yagiura, Mutsunori & Kishida, Masahiro & Ibaraki, Toshihide, 2006. "A 3-flip neighborhood local search for the set covering problem," European Journal of Operational Research, Elsevier, vol. 172(2), pages 472-499, July.
    7. Xueping Li & Zhaoxia Zhao & Xiaoyan Zhu & Tami Wyatt, 2011. "Covering models and optimization techniques for emergency response facility location and planning: a review," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 74(3), pages 281-310, December.
    8. Maenhout, Broos & Vanhoucke, Mario, 2010. "A hybrid scatter search heuristic for personalized crew rostering in the airline industry," European Journal of Operational Research, Elsevier, vol. 206(1), pages 155-167, October.
    9. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "Minimizing fleet operating costs for a container transportation company," European Journal of Operational Research, Elsevier, vol. 171(3), pages 776-786, June.
    10. Weiqiang Shen & Chuanlin Zhang & Xiaona Zhang & Jinglun Shi, 2019. "A fully distributed deployment algorithm for underwater strong k-barrier coverage using mobile sensors," International Journal of Distributed Sensor Networks, , vol. 15(4), pages 15501477198, April.
    11. Bo Cowgill & Jonathan M. V. Davis & B. Pablo Montagnes & Patryk Perkowski, 2024. "Stable Matching on the Job? Theory and Evidence on Internal Talent Markets," CESifo Working Paper Series 11120, CESifo.
    12. Rita Portugal & Helena Ramalhinho-Lourenço & José P. Paixao, 2006. "Driver scheduling problem modelling," Economics Working Papers 991, Department of Economics and Business, Universitat Pompeu Fabra.
    13. Helena R. Lourenço & José P. Paixão & Rita Portugal, 2001. "Multiobjective Metaheuristics for the Bus Driver Scheduling Problem," Transportation Science, INFORMS, vol. 35(3), pages 331-343, August.
    14. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    15. Weihua Yang & Xu Zhang & Xia Wang, 2024. "The Wasserstein Metric between a Discrete Probability Measure and a Continuous One," Mathematics, MDPI, vol. 12(15), pages 1-13, July.
    16. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    17. Nisse, Nicolas & Salch, Alexandre & Weber, Valentin, 2023. "Recovery of disrupted airline operations using k-maximum matching in graphs," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1061-1072.
    18. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    19. Mhand Hifi & Slim Sadfi & Abdelkader Sbihi, 2004. "An Exact Algorithm for the Multiple-choice Multidimensional Knapsack Problem," Post-Print halshs-03322716, HAL.
    20. Bachtenkirch, David & Bock, Stefan, 2022. "Finding efficient make-to-order production and batch delivery schedules," European Journal of Operational Research, Elsevier, vol. 297(1), pages 133-152.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:8:y:2020:i:4:p:513-:d:340708. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.