Abstract
This paper aims at studying the Bi-Objective Insular Traveling Salesman Problem (BO-InTSP), which searches for a set of efficient, single visit sequences to collect (or distribute) freight from a set of islands. In this problem, the selection of ports (nodes) to be visited at each island, along with the associated port visit sequence, are optimized simultaneously, while the maritime transportation costs and the ground transportation costs inside the islands are minimized with a bi-objective perspective. This approach is employed since these costs are of a conflictive nature. A previous Approximated Formulation of the BO-InTSP relies on aggregating the actual demand locations within each island in a certain number of centroids for computing the ground transportation costs. Conversely, this paper proposes and develops a novel Exact Formulation for the problem based on the actual demand locations, instead of aggregating the demand inside the islands. Additionally, a systematic evaluation approach is developed to compare the two alternative formulations with different levels of demand aggregation inside the islands, considering the bi-objective nature of the problem. The results reveal that the novel Exact Formulation significantly outperforms the previous aggregated approach in terms of the solutions quality and computational resources.
Highlights
IntroductionSome examples are the Selective Vehicle Routing Problems (VRPs), SVRP ([7,8,9,10]), Orienteering Problems ([11,12,13,14,15,16,17]), and the Generalized VRP, GVRP ([18,19,20,21,22,23,24,25,26,27])
Introduction and Literature ReviewVehicle Routing Problems (VRPs) have been widely studied for decades to address a great variety of real-world problems that involve freight distribution to a set of locations ([1,2,3,4,5,6])
This comparison is performed by contrasting the set of non-dominated points obtained by the Approximated Model with the set of non-dominated points obtained with the Exact Formulation
Summary
Some examples are the Selective VRP, SVRP ([7,8,9,10]), Orienteering Problems ([11,12,13,14,15,16,17]), and the Generalized VRP, GVRP ([18,19,20,21,22,23,24,25,26,27]) With this regard, other related problems belonging to the family of extensive facility location problems, in which the main goal is to determine the topology of the network for serving a set of customers by means of tours, paths, trees, or other types of networked structures have been proposed in the literature ([28,29,30,31,32,33,34,35,36]).
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
