IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v29y2018i2d10.1007_s10845-015-1109-6.html
   My bibliography  Save this article

A genetic algorithm for operation sequencing in CAPP using edge selection based encoding strategy

Author

Listed:
  • Yuliang Su

    (Shanghai Jiao Tong University)

  • Xuening Chu

    (Shanghai Jiao Tong University)

  • Dongping Chen

    (Shanghai Jiao Tong University)

  • Xiwu Sun

    (Shanghai Aerospace Equipment Manufacturer)

Abstract

Operation sequencing in CAPP aims at determining the optimal order of machining operations with minimal machining cost and satisfying all the precedence constraints. The genetic algorithm (GA) is widely used to solve precedence constrained operation sequencing problem (PCOSP) due to its efficiency and parallel processing capability. How to guarantee the precedence constraints is always a hot research topic and there are mainly two classes of methods. The first ones use additional adjustment approaches to repair the infeasible solutions that break precedence constraints. It is unreliable and low efficient. The second ones avoid infeasible solutions in initialization through some encoding approaches such as topological storing based encoding approach, but the premature convergence problem may occur facing some complicated PCOSPs. To solve these problems, an edge selection strategy based GA is proposed. The edge selection based strategy could produce feasible solutions in initialization, and assures that every feasible solution will be generated with acceptable probability so as to improve GA’s converging efficiency. Then the precedence constraints are kept by order crossover. Modified mutation operator is designed to optimize the selection of machine tool, tool access direction and cutting tool for each operation. The experiments illustrate that the proposed algorithm is effective and efficient.

Suggested Citation

  • Yuliang Su & Xuening Chu & Dongping Chen & Xiwu Sun, 2018. "A genetic algorithm for operation sequencing in CAPP using edge selection based encoding strategy," Journal of Intelligent Manufacturing, Springer, vol. 29(2), pages 313-332, February.
  • Handle: RePEc:spr:joinma:v:29:y:2018:i:2:d:10.1007_s10845-015-1109-6
    DOI: 10.1007/s10845-015-1109-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-015-1109-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10845-015-1109-6?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Moon, Chiung & Kim, Jongsoo & Choi, Gyunghyun & Seo, Yoonho, 2002. "An efficient genetic algorithm for the traveling salesman problem with precedence constraints," European Journal of Operational Research, Elsevier, vol. 140(3), pages 606-617, August.
    2. Gilbert Laporte & Jorge Riera-Ledesma & Juan-José Salazar-González, 2003. "A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem," Operations Research, INFORMS, vol. 51(6), pages 940-951, December.
    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. Abdullah Falih & Ahmed Z. M. Shammari, 2020. "Hybrid constrained permutation algorithm and genetic algorithm for process planning problem," Journal of Intelligent Manufacturing, Springer, vol. 31(5), pages 1079-1099, June.
    2. Oscar Alberto Alvarez-Flores & Raúl Rivera-Blas & Luis Armando Flores-Herrera & Emmanuel Zenén Rivera-Blas & Miguel Angel Funes-Lora & Paola Andrea Niño-Suárez, 2024. "A Novel Modified Discrete Differential Evolution Algorithm to Solve the Operations Sequencing Problem in CAPP Systems," Mathematics, MDPI, vol. 12(12), pages 1-20, June.
    3. Luo, Kaiping & Shen, Guangya & Li, Liheng & Sun, Jianfei, 2023. "0-1 mathematical programming models for flexible process planning," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1160-1175.

    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. Bianchessi, N. & Mansini, R. & Speranza, M.G., 2014. "The distance constrained multiple vehicle traveling purchaser problem," European Journal of Operational Research, Elsevier, vol. 235(1), pages 73-87.
    2. Jorge Riera-Ledesma & Juan-José Salazar-González, 2006. "Solving the asymmetric traveling purchaser problem," Annals of Operations Research, Springer, vol. 144(1), pages 83-97, April.
    3. Jaehn, Florian & Meissner, Finn, 2022. "The rebound effect in transportation," Omega, Elsevier, vol. 108(C).
    4. Manerba, Daniele & Mansini, Renata & Riera-Ledesma, Jorge, 2017. "The Traveling Purchaser Problem and its variants," European Journal of Operational Research, Elsevier, vol. 259(1), pages 1-18.
    5. Mina Roohnavazfar & Seyed Hamid Reza Pasandideh, 2022. "Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints," Operational Research, Springer, vol. 22(4), pages 4253-4285, September.
    6. Carter, Arthur E. & Ragsdale, Cliff T., 2006. "A new approach to solving the multiple traveling salesperson problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 175(1), pages 246-257, November.
    7. Mingyu Xiao & Jianan Zhang & Weibo Lin, 0. "Parameterized algorithms and complexity for the traveling purchaser problem and its variants," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-17.
    8. E. Angelelli & R. Mansini & M. Vindigni, 2016. "The Stochastic and Dynamic Traveling Purchaser Problem," Transportation Science, INFORMS, vol. 50(2), pages 642-658, May.
    9. Mingyu Xiao & Jianan Zhang & Weibo Lin, 2022. "Parameterized algorithms and complexity for the traveling purchaser problem and its variants," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2269-2285, November.
    10. Ljubić, Ivana & Moreno, Eduardo, 2018. "Outer approximation and submodular cuts for maximum capture facility location problems with random utilities," European Journal of Operational Research, Elsevier, vol. 266(1), pages 46-56.
    11. Merve Kayacı Çodur & Mustafa Yılmaz, 2020. "A time-dependent hierarchical Chinese postman problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 28(1), pages 337-366, March.
    12. Gustavo Erick Anaya Fuentes & Eva Selene Hernández Gress & Juan Carlos Seck Tuoh Mora & Joselito Medina Marín, 2018. "Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-20, August.
    13. Kaj Holmberg, 2019. "The (Over)zealous Snow Remover Problem," Transportation Science, INFORMS, vol. 53(3), pages 867-881, May.
    14. Manerba, Daniele & Mansini, Renata, 2012. "An exact algorithm for the Capacitated Total Quantity Discount Problem," European Journal of Operational Research, Elsevier, vol. 222(2), pages 287-300.
    15. E. Angelelli & R. Mansini & M. Vindigni, 2009. "Exploring greedy criteria for the dynamic traveling purchaser problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 17(2), pages 141-158, June.
    16. Monkman, Susan K. & Morrice, Douglas J. & Bard, Jonathan F., 2008. "A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1100-1114, June.
    17. Carter, Arthur E. & Ragsdale, Cliff T., 2009. "Quality inspection scheduling for multi-unit service enterprises," European Journal of Operational Research, Elsevier, vol. 194(1), pages 114-126, April.
    18. Nikolakopoulos, Athanassios & Sarimveis, Haralambos, 2007. "A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 1911-1929, March.
    19. Abdullah Falih & Ahmed Z. M. Shammari, 2020. "Hybrid constrained permutation algorithm and genetic algorithm for process planning problem," Journal of Intelligent Manufacturing, Springer, vol. 31(5), pages 1079-1099, June.
    20. Matteo Fischetti & Ivana Ljubić & Markus Sinnl, 2017. "Redesigning Benders Decomposition for Large-Scale Facility Location," Management Science, INFORMS, vol. 63(7), pages 2146-2162, July.

    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:spr:joinma:v:29:y:2018:i:2:d:10.1007_s10845-015-1109-6. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.