# Evolutionary Algorithms for Optimization Sequence of Cut in the Laser Cutting Path Problem
## 4 Overview of Application of ABRKGA to LCPP
### An Eulerian Heuristic to Generate Improved Individuals for LCPP
[CrossRef]
* _[PERSON] (1994)_ [PERSON]; [PERSON] Approximation algorithms for the geometric covering salesman problem. _Discret. Appl. Math._**1994**, _55_, 197-218. [CrossRef]
* _[PERSON] (1998)_ [PERSON]; [PERSON] Optimization of the nibbling operation on an NC turret punch press. _Int. J. Prod. Res._**1998**, _36_, 1901-1916. [[PERSON]; [PERSON] [PERSON] Pierce point minimization and optimal torch path determination in flame cutting. _J. Manuf. Syst._**1984**, \(3\), 81-89. [CrossRef]
* _[PERSON] et al. (2007)_ [PERSON]; [PERSON] [PERSON]; [PERSON]; [PERSON] [PERSON] Heuristics for a dynamic rural postman problem. _Comput. Oper. Res._**2007**, _34_, 2381-3294. [CrossRef]
* _[PERSON] (1999)_ [PERSON]; [PERSON] On crossings, the Crossing Postman Problem, and the Rural Postman Problem. _Networks_**1999**, _34_, 173-180. [CrossRef]
* _[PERSON] et al. (2012)_ [PERSON]; [PERSON] [PERSON] Cutting path as a Rural Postman Problem: Solutions by Memetic Algorithms. _IJCOPI_**2012**, \(3\), 31-46. * _[PERSON] and [PERSON] (1999)_ [PERSON]; [PERSON] [PERSON] A study on torch path planning in laser cutting processes part 2: Cutting path optimization using simulated annealing. _J. Manuf. Syst._**1999**, _18_, 62-70. [CrossRef]
* _[PERSON] and [PERSON] (2006)_ [PERSON]; [PERSON] Cutting path optimization in CNC cutting processes using a two-step genetic algorithm. _Int. J. Prod. Res._**2006**, _44_, 5307-5326. * _[PERSON] et al. (2011)_ [PERSON]; [PERSON]; [PERSON] Cutting path optimization using tabu search. _Key Eng. Mater._**2011**, _473_, 739-748. [CrossRef]
* _[PERSON] et al. (1981)_ [PERSON]; [PERSON] Capacitated arc routing problems. _Networks_**1981**, _11_, 305-315. [CrossRef]
* _[PERSON] et al. (2011)_ [PERSON]; [PERSON]; [PERSON]. The open capacitated arc routing problem. _Comput. Oper. Res._**2011**, _38_, 1543-1555. [CrossRef]
* _[PERSON] et al. (2020)_ [PERSON]; [PERSON]; [PERSON]; [PERSON] Solving the Laser Cutting Path Problem Using Population-Based Simulated Annealing with Adaptive Large Neighborhood Search. _Key Eng. Mater._**2020**, _833_, 29-34. [CrossRef]
* _[PERSON] (2022)_ [PERSON] Improving Ant Colony Optimization efficiency for solving large TSP instances. _Appl. Soft Comput._**2022**, _120_, 108653. [CrossRef]
* [PERSON] and [PERSON] (2011) [PERSON]; [PERSON]. Biased random-key genetic algorithms for combinatorial optimization. _J. Heuristics_**2011**, _17_, 487-525. [CrossRef]
* _[PERSON] et al. (2007)_ [PERSON]; [PERSON]; [PERSON]; [PERSON], Parameter Control in Evolutionary Algorithms. In _Parameter Setting in Evolutionary Algorithms_; [PERSON], [PERSON], [PERSON], [PERSON]; Springer: Berlin/Heidelberg, Germany, 2007; pp. 19-46. [CrossRef]
* _[PERSON] (2010)_ [PERSON] Biased random-key genetic algorithms with applications in telecommunications. _TOP_**2010**, _20_, 130-153. [CrossRef]* [PERSON] and [PERSON] (1973) [PERSON]; [PERSON], [PERSON] and the Chinese Postman. _Math. Program._**1973**, \(5\), 88-124. [CrossRef]
* [PERSON] et al. (2015) [PERSON]; [PERSON]; [PERSON]; [PERSON] Survey on applications of biased-random key genetic algorithms for solving optimization problems. In Proceedings of the 2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEM), Singapore, 6-9 December 2015; pp. 863-870. [CrossRef]
* [PERSON] and [PERSON] (1991) [PERSON]; [PERSON]. On the virtues of parameterized uniform crossover. In Proceedings of the Fourth International Conference on Genetic Algorithms, San Diego, CA, USA, 13-16 July 1991; pp. 230-236. * [PERSON] et al. (2017) [PERSON]; [PERSON]; [PERSON] A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems. _Math. Probl. Eng._**2017**, _2017_, 1670709. [CrossRef]

Disclaimer/Publisher's Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s).