Solving Dietary Planning Problem using Particle Swarm Optimization with Genetic Operators

被引:4
|
作者
Porras, Edmarlyn M. [1 ]
Fajardo, Arnel C. [2 ]
Medina, Ruji P. [3 ]
机构
[1] Technol Inst Philippines, Dept Comp Studies, Quezon City, Philippines
[2] Manuel L Quezon Univ, Sch Engn & Informat Technol, Quezon City, Philippines
[3] Technol Inst Philippines, Quezon City, Philippines
来源
PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND SOFT COMPUTING (ICMLSC 2019) | 2019年
关键词
Particle swarm optimization; constriction coefficient; genetic operators; dietary planning;
D O I
10.1145/3310986.3311005
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Dietary planning problem is considered as Multi-dimensional Knapsack Problem and confirmed to be a NP-hard problem. There are different ways on how to generate a dietary plan and it includes different constraints such as having a variety of foods, meeting the required total calories, satisfying different nutrients and others. Particle swarm optimization is a promising method to solve different kinds of optimization problem due to its fast convergence, few parameters needed and ability to find good solutions to the problem. PSO using constriction coefficient method was applied in this study and genetic operators were integrated to explore the search space and improved the quality of the solution. Experimental results show that the proposed algorithm was able to generate a varied diet plans for adults wherein it satisfies the specified constraints and PSO with genetic operators was able to evolve better solutions compare to original PSO.
引用
收藏
页码:55 / 59
页数:5
相关论文
共 50 条
  • [1] An Adaptive Particle Swarm Optimization Method for Solving the Grasp Planning Problem
    Walha, Chiraz
    Bezine, Hala
    Alimi, Adel M.
    INTERNATIONAL SYMPOSIUM ON ROBOTICS AND INTELLIGENT SENSORS 2012 (IRIS 2012), 2012, 41 : 426 - 435
  • [2] Solving shortest path problem using particle swarm optimization
    Mohemmed, Ammar W.
    Sahoo, Nirod Chandra
    Geok, Tan Kim
    APPLIED SOFT COMPUTING, 2008, 8 (04) : 1643 - 1653
  • [3] Using Hybrid Particle Swarm Optimization for Process Planning Problem
    Wang, Y. F.
    Zhang, Y. F.
    Fuh, J. Y. H.
    INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 1, PROCEEDINGS, 2009, : 304 - 308
  • [4] A hybrid algorithm using particle swarm optimization for solving transportation problem
    Gurwinder Singh
    Amarinder Singh
    Neural Computing and Applications, 2020, 32 : 11699 - 11716
  • [5] Solving effectively the school timetabling problem using particle swarm optimization
    Tassopoulos, Ioannis X.
    Beligiannis, Grigorios N.
    EXPERT SYSTEMS WITH APPLICATIONS, 2012, 39 (05) : 6029 - 6040
  • [6] Solving Unit Commitment problem using Hybrid Particle Swarm Optimization
    Ting, TO
    Rao, MVC
    Loo, CK
    Ngu, SS
    JOURNAL OF HEURISTICS, 2003, 9 (06) : 507 - 520
  • [7] Solving the orienteering problem using attractive and repulsive particle swarm optimization
    Dallard, Herby
    Lam, Sarah S.
    Kulturel-Konak, Sadan
    IRI 2007: PROCEEDINGS OF THE 2007 IEEE INTERNATIONAL CONFERENCE ON INFORMATION REUSE AND INTEGRATION, 2007, : 12 - +
  • [8] A hybrid algorithm using particle swarm optimization for solving transportation problem
    Singh, Gurwinder
    Singh, Amarinder
    NEURAL COMPUTING & APPLICATIONS, 2020, 32 (15): : 11699 - 11716
  • [9] Solving Unit Commitment Problem Using Hybrid Particle Swarm Optimization
    Tiew-On Ting
    M.V.C. Rao
    C.K. Loo
    S.S. Ngu
    Journal of Heuristics, 2003, 9 : 507 - 520
  • [10] On solving the double loading problem using a modified particle swarm optimization
    Tlili, Takwa
    Krichen, Saoussen
    THEORETICAL COMPUTER SCIENCE, 2015, 598 : 118 - 128