The capacitated arc-routing problem with stochastic demands (CARPSD) is an extension of the well-known capacitated arc-routing problem (CARP) in which demands are stochastic. This leads to the possibility of route failures whenever the realized demand exceeds the vehicle capacity. This paper presents the CARPSD in the context of garbage collection. It describes an adaptive large-scale neighbourhood search heuristic for the problem. Computational results show the superiority of this algorithm over an alternative solution approach.
This article focuses on an intermodal freight transport service in which containers represent the moved loading units. In particular, it deals with the advantages of combining sea and road transportation – sea for transferring large quantities over long distances, road for collecting and distributing over short or medium distances. With a view to minimizing the total cost of the service, we formulate a ship-truck intermodal transportation problem as a Travelling Purchaser Problem (TPP), in this way broadening the real-world applications field of the TPP. To tackle this problem, a heuristic algorithm is presented and experimentally tested. Computational results indicate that the algorithm is very efficient on a set of benchmark instances, quickly achieving optimal or near-optimal solutions. Maritime Economics & Logistics (2009) 11, 247–259. doi:10.1057/mel.2009.6
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.