Fig 2 - uploaded by Jalel Euchi
Content may be subject to copyright.
Relative gap In Figure 3, we observed the comparison of the computation time of the proposed approach reveals that the VNSAM is computationally efficient than the TSAM.
Source publication
In this paper we propose an Adaptive memory procedure to solve the Profitable Arc Tour Problem (PATP). The PATP is a variant of the well-known Vehicle Routing Problems in which a set of vehicle tours are constructed. The objective is to find a set of cycles in the vehicle tours that maximize the collection of profits minus travel costs, subject to...
Similar publications
In this article, we deal with the Profitable Close-Enough Arc Routing Problem (PCEARP), which is an extension of the Close-Enough ARP (CEARP). The CEARP models the situation in which customers are not necessarily nodes of a network and the associated serviced can be performed from any traversed edge that is close enough to the customer. It consists...
