Applying the Simulated Annealing Algorithm to the Set Orienteering Problem with Mandatory Visits

This study addresses the set orienteering problem with mandatory visits (SOPMV), a variant of the team orienteering problem (SOP). In SOPMV, certain critical sets must be visited. The study began by formulating the mathematical model for SOPMV. To tackle the challenge of obtaining a feasible route w...

Full description

Bibliographic Details

Published in:	Mathematics
Main Authors:	Shih-Wei Lin, Sirui Guo, Wen-Jie Wu
Format:	Article
Language:	English
Published:	MDPI AG 2024-10-01
Subjects:	set orienteering problem mandatory visits dynamic programming simulated annealing algorithm
Online Access:	https://www.mdpi.com/2227-7390/12/19/3089