Skip to main content
赵
赵亚军1-Visitor
1-Visitor
February 20, 2012
Solved

can anybody achieve genetic algorithms by programming in mathcad

  • February 20, 2012
  • 2 replies
  • 7747 views

when i do some multi-objective parameter optimization cases in mathcad,i find that there are only three algorithms that can be used，L-M，Conjugate gradient method and Quasi-Newton method. these methods may can't find the global optimum,or take very long time.nowadays,there are many other algorithms,such as GA(Genetic Algorithm),it may solve these problems easily.

but my mathematics is poor，can any body do it,or has anybody done that?

i want to have a try,but my methematics is poor,at the same time,i am not proficient in programming.

wish for your help.

Best answer by ValeryOchkov

See the atach

2 replies

V
24-Ruby IV
ValeryOchkov24-Ruby IV
24-Ruby IV
February 20, 2012

See please - http://communities.ptc.com/docs/DOC-2565

    赵
    赵亚军1-VisitorAuthor
    1-Visitor
    February 21, 2012

    wow,you are so intelligent

    but your function don't apply to my case.i have more than 2 parameters,can you afford me your worksheet about GA program，my version is Mathcad 15.

    if you can develop a model that can be used to solve all the multi-objective parameter optimization cases,that's more better.such as Minerr,minimize,a generic model，not limited to two parameters.

    V
    24-Ruby IV
    ValeryOchkov24-Ruby IVAnswer
    24-Ruby IV
    February 21, 2012

    See the atach

      R
      RichardJ19-Tanzanite
      19-Tanzanite
      February 20, 2012

      these methods may can't find the global optimum

      There is no algorithm that can be guaranteed to find the global optimum of a non-linear optimization problem.

      nowadays,there are many other algorithms,such as GA(Genetic Algorithm),it may solve these problems easily.

      Maybe. Maybe not. It depends on the problem: http://en.wikipedia.org/wiki/No_free_lunch_in_search_and_optimization

      赵
      赵亚军1-VisitorAuthor
      1-Visitor
      February 21, 2012


      Richard Jackson 编写:

      There is no algorithm that can be guaranteed to find the global optimum of a non-linear optimization problem.

      as what you said,but i want to have a try,my task got stuck,the most important reason is that it takes so long time，i have tried minimize and minerr,they all failed. if this problem can't be solved,i will get in big trouble. do you have any idea to sovle the problem that the time required to find the minimum is so long?

      this is only a small part of data,if i add more data,it may can't finish the caculation.what i am most concerned about is it can give a result,no matter the local optimum or the global optimum.

      Terms & ConditionsAccessibility statement