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

A cutting-plane algorithm for an orienteering problem with mandatory visits and simultaneous production

Author

Listed:
  • Shijin Wang
  • Hanyu Zhang
  • Feng Chu
  • Kan Fang

Abstract

This work investigates an orienteering problem with mandatory visits and simultaneous production (denoted by OPMV-SP) in additive manufacturing, where some nodes must be visited and others are optional, and the objective is to maximise the total collected scores. The problem is firstly formulated as a mixed-integer linear programming (MILP) model. Four sets of valid inequalities are then introduced to enhance the MILP. Based on the MILP, an exact method namely cutting-plane algorithm (CPA) is developed and evaluated on both benchmark and simulated instances. The results of benchmarks demonstrate that CPA is competitive, proving the optimality for 191 out of 202 feasible instances. Additionally, the performance of different combinations of valid inequalities are evaluated. Sensitivity analysis on the effects of mandatory visits and waiting times offers managerial insights for production and delivery strategies. The results of simulated instances of real-world cases further demonstrate CPA's efficiency and effectiveness.

Suggested Citation

  • Shijin Wang & Hanyu Zhang & Feng Chu & Kan Fang, 2025. "A cutting-plane algorithm for an orienteering problem with mandatory visits and simultaneous production," International Journal of Production Research, Taylor & Francis Journals, vol. 63(12), pages 4287-4305, June.
    • Handle: RePEc:taf:tprsxx:v:63:y:2025:i:12:p:4287-4305
    DOI: 10.1080/00207543.2024.2447932
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2024.2447932
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2024.2447932?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

    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:63:y:2025:i:12:p:4287-4305. 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.