Article Dans Une Revue International Journal of Production Research Année : 2025

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-04878306 , version 1 (09-01-2025)

Identifiants

Citer

Shijin Wang, Hanyu Zhang, Feng Chu, Kan Fang. A cutting-plane algorithm for an orienteering problem with mandatory visits and simultaneous production. International Journal of Production Research, In press, pp.1-19. ⟨10.1080/00207543.2024.2447932⟩. ⟨hal-04878306⟩
30 Consultations
0 Téléchargements

Altmetric

Partager

More