A Compact Model for the Clustered Orienteering Problem

Roberto Montemanni () and Derek H. Smith
Additional contact information
Roberto Montemanni: Department of Sciences and Methods for Engineering, University of Modena and Reggio Emilia, Via Amendola 2, 42122 Reggio Emilia, Italy
Derek H. Smith: Computing and Mathematics, University of South Wales, Pontypridd CF37 1DL, UK

Logistics, 2024, vol. 8, issue 2, 1-15

Abstract: Background: The Clustered Orienteering Problem is an optimization problem faced in last-mile logistics. The aim is, given an available time window, to visit vertices and to collect as much profit as possible in the given time. The vertices to visit have to be selected among a set of service requests. In particular, the vertices belong to clusters, the profits are associated with clusters, and the price relative to a cluster is collected only if all the vertices of a cluster are visited. Any solving methods providing better solutions also imply a new step towards sustainable logistics since companies can rely on more efficient delivery patterns, which, in turn, are associated with an improved urban environment with benefits both to the population and the administration thanks to an optimized and controlled last-mile delivery flow. Methods: In this paper, we propose a constraint programming model for the problem, and we empirically evaluate the potential of the new model by solving it with out-of-the-box software. Results: The results indicate that, when compared to the exact methods currently available in the literature, the new approach proposed stands out. Moreover, when comparing the quality of the heuristic solutions retrieved by the new model with those found by tailored methods, a good performance can be observed. In more detail, many new best-known upper bounds for the cost of the optimal solutions are reported, and several instances are solved to optimality for the first time. Conclusions: The paper provides a new practical and easy-to-implement tool to effectively deal with an optimization problem commonly faced in last-mile logistics.

Keywords: clustered orienteering problem; constraint programming; exact solutions; heuristic solutions (search for similar items in EconPapers)
JEL-codes: L8 L80 L81 L86 L87 L9 L90 L91 L92 L93 L98 L99 M1 M10 M11 M16 M19 R4 R40 R41 R49 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2305-6290/8/2/48/pdf (application/pdf)
https://www.mdpi.com/2305-6290/8/2/48/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jlogis:v:8:y:2024:i:2:p:48-:d:1389238

Access Statistics for this article

Logistics is currently edited by Ms. Mavis Li

More articles in Logistics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().