IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v56y2018i14p4925-4940.html
   My bibliography  Save this article

Tool path optimisation method for large thin-wall part of spacecraft

Author

Listed:
  • Haichao Wang
  • Jie Zhang
  • Youlong Lv
  • Xiaolong Zhang
  • Guoqiang Guo
  • Wei Qin
  • Xiaoxi Wang

Abstract

Roughing tool path of panel machining, which is a bottleneck of spacecraft production, should be optimised rapidly to shorten process time. This problem has a large solution space, and surface quality should be taken into account. The decision variables are cavity machining order, feed point and cutting direction of each cavity. Our problem is presented as an asymmetric general travelling salesman problem (AGTSP). A cluster optimisation-based hybrid max–tmin ant system (CO-HMMAS) is proposed, which solves two sub-problems as a whole. The oriented pheromone and dynamic heuristic information calculating methods are designed. We analyse the differences between one-stage and two-stage AGTSP local search heuristics and combine CO-HMMAS with them properly. An improved Global 3-opt heuristic suitable for both symmetric and asymmetric cases is proposed with sharply reduced time complexity. Comparison experiments verified that, two-stage local search heuristics decrease solution error significantly and rapidly when the error is great, and one-stage ones improve a near-optimal solution costing much more computing time. Benchmarks tests show that, CO-HMMAS outperforms the state-of-the-art algorithm on several technical indexes. Experiments on typical panels reveal that all algorithm improvements are effective, and CO-HMMAS can obtain a better tool path than the best algorithm within less CPU time.

Suggested Citation

  • Haichao Wang & Jie Zhang & Youlong Lv & Xiaolong Zhang & Guoqiang Guo & Wei Qin & Xiaoxi Wang, 2018. "Tool path optimisation method for large thin-wall part of spacecraft," International Journal of Production Research, Taylor & Francis Journals, vol. 56(14), pages 4925-4940, July.
  • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:14:p:4925-4940
    DOI: 10.1080/00207543.2017.1401239
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1401239
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207543.2017.1401239?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.

    More about this item

    Statistics

    Access and download statistics

    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:taf:tprsxx:v:56:y:2018:i:14:p:4925-4940. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.