<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article
  PUBLIC "-//NLM//DTD Journal Publishing DTD v2.0 20040830//EN" "http://dtd.nlm.nih.gov/publishing/2.0/journalpublishing.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" article-type="research-article" dtd-version="2.0" xml:lang="EN">

  <front>

    <journal-meta>

      <journal-title>Information Technology Journal</journal-title>

      <issn pub-type="ppub">1812-5638</issn>

      <issn pub-type="epub">1812-5646</issn>

      <publisher>

        <publisher-name>Asian Network for Scientific Information</publisher-name>

      </publisher>

    </journal-meta>


    <article-meta>

      <article-id pub-id-type="doi">10.3923/itj.2013.862.866</article-id>


      <title-group>

        <article-title><![CDATA[Application of Improved Dual Coding Genetic Algorithm for Contour Path Planning in Laser Processing]]></article-title>

      </title-group>


      <contrib-group>

        <contrib contrib-type="author" xlink:type="simple">


          <name name-style="western">

            <surname>Yang</surname>

            <given-names>Jianjun</given-names>

          </name>


        </contrib>

      </contrib-group>


      <pub-date pub-type="collection">


        <month>4</month>




        <year>2013</year>

      </pub-date>


      <volume>12</volume>

      <issue>4</issue>


      <abstract><![CDATA[<p>An optimization model for contour path in laser processing 
  is established, in which the minimal spare travel time is taken as objective 
  function and not the shortest path, because the spare travel time decided the 
  processing time. In the problem, two kinds of subpromlems that are the scanning 
  sequence of contours and the starting point of each contour should be optimized 
  simultaneously. Based on the features, the improved dual coding genetic algorithm 
  is designed to optimize the problem. For the contour shape, the polygon and 
  circle are all taken into account and the coding method that adapted to the 
  problem is designed. In the algorithm operational process, many crossover and 
  mutation methods are designed and also adapted to the problem, so the infeasible 
  solutions are avoided. In order to improve the performance of the algorithm, 
  the computing method of fitness function value is adjusted. The computation 
  result shows that the algorithm is efficiency.</p>]]></abstract>


    </article-meta>

  </front>


  <ref-list>




      <ref id="1020901">

        <label>1</label>

        <citation citation-type="journal" xlink:type="simple">

          <person-group person-group-type="author">

            <name name-style="western">

              <surname>Huang, Y.M. and H.Y. Lan,</surname>

              <given-names></given-names>

            </name>

          </person-group>

          <year>2006</year>

          <article-title><![CDATA[Path planning effect for the accuracy of rapid prototyping system.]]></article-title>

          <source>Int. J. Adv. Manuf. Technol.,</source>

          <volume>30</volume>

          <fpage>233</fpage>

          <lpage>246</lpage>

        </citation>

      </ref>


















      <ref id="1020902">

        <label>2</label>

        <citation citation-type="journal" xlink:type="simple">

          <person-group person-group-type="author">

            <name name-style="western">

              <surname>Liu, H.X., X. Wang and L. Cai,</surname>

              <given-names></given-names>

            </name>

          </person-group>

          <year>2004</year>

          <article-title><![CDATA[Modeling and optimizing laser torch path in laminated object manufacturing technology.]]></article-title>

          <source>Chin. J. Lasers,</source>

          <volume>31</volume>

          <fpage>1137</fpage>

          <lpage>1142</lpage>

        </citation>

      </ref>


















      <ref id="1020903">

        <label>3</label>

        <citation citation-type="journal" xlink:type="simple">

          <person-group person-group-type="author">

            <name name-style="western">

              <surname>Wang, G.G. and S.Q. Xie,</surname>

              <given-names></given-names>

            </name>

          </person-group>

          <year>2005</year>

          <article-title><![CDATA[Optimal process planning for a combined punch-and-laser cutting machine using ant colony optimization.]]></article-title>

          <source>Int. J. Prod. Res.,</source>

          <volume>43</volume>

          <fpage>2195</fpage>

          <lpage>2216</lpage>

        </citation>

      </ref>


















      <ref id="1020904">

        <label>4</label>

        <citation citation-type="journal" xlink:type="simple">

          <person-group person-group-type="author">

            <name name-style="western">

              <surname>Chou, C.C., Y.K. Chen and S.Y. Chou,</surname>

              <given-names></given-names>

            </name>

          </person-group>

          <year>2008</year>

          <article-title><![CDATA[A fundamental tool path planning problem for circles in layered manufacturing.]]></article-title>

          <source>Integr. Comput. Aided Eng.,</source>

          <volume>15</volume>

          <fpage>37</fpage>

          <lpage>52</lpage>

        </citation>

      </ref>


















      <ref id="1020905">

        <label>5</label>

        <citation citation-type="journal" xlink:type="simple">

          <person-group person-group-type="author">

            <name name-style="western">

              <surname>Wiener, J.M., N.N. Ehbauer and H.A. Mallot,</surname>

              <given-names></given-names>

            </name>

          </person-group>

          <year>2009</year>

          <article-title><![CDATA[Planning paths to multiple targets: memory involvement and planning heuristics in spatial problem solving.]]></article-title>

          <source>Psychol. Res.,</source>

          <volume>73</volume>

          <fpage>644</fpage>

          <lpage>658</lpage>

        </citation>

      </ref>


















      <ref id="1020906">

        <label>6</label>

        <citation citation-type="journal" xlink:type="simple">

          <person-group person-group-type="author">

            <name name-style="western">

              <surname>Son, S., S. Kim and K.H. Lee,</surname>

              <given-names></given-names>

            </name>

          </person-group>

          <year>2003</year>

          <article-title><![CDATA[Path planning of multi-patched freeform surfaces for laser scanning.]]></article-title>

          <source>Int. J. Adv. Manuf. Technol.,</source>

          <volume>22</volume>

          <fpage>424</fpage>

          <lpage>435</lpage>

        </citation>

      </ref>


















      <ref id="1020907">

        <label>7</label>

        <citation citation-type="journal" xlink:type="simple">

          <person-group person-group-type="author">

            <name name-style="western">

              <surname>Yang, W.D., R.H. Tan, Y.N. Yan and A.P. Xu,</surname>

              <given-names></given-names>

            </name>

          </person-group>

          <year>2005</year>

          <article-title><![CDATA[Application of genetic algorithm for scanning path planning in rapid prototyping.]]></article-title>

          <source>J. Comput. Aided Des. Comput. Graphics,</source>

          <volume>17</volume>

          <fpage>2179</fpage>

          <lpage>2183</lpage>

        </citation>

      </ref>


















      <ref id="1058478">

        <label>8</label>

        <citation citation-type="journal" xlink:type="simple">

          <person-group person-group-type="author">

            <name name-style="western">

              <surname>Huang, X., F. Xi, J. Li and Z. Zhong,</surname>

              <given-names></given-names>

            </name>

          </person-group>

          <year>2009</year>

          <article-title><![CDATA[Optimal layout and path planning for flame cutting of sheet metals.]]></article-title>

          <source>Int. J. Comput. Integr. Manuf.,</source>

          <volume>22</volume>

          <fpage>30</fpage>

          <lpage>41</lpage>

        </citation>

      </ref>
















  </ref-list>

</article>

