Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints. Issue 2 (1st September 2014)

• Record Type: Journal Article
• Authors: Riquelme‐Rodríguez, Juan‐Pablo; Langevin, André; Gamache, Michel
• Is Part Of: Networks. Volume 64:Issue 2 (2014:Sep.)
• Page Start: 125
• Page End: 139
• Publication Date: 2014-09-01
• Subjects: Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21562
• Languages: English
• ISSNs: 0028-3045

Abstract

<abstract abstract-type="main"> <title> <x xml:space="preserve">Abstract</x> </title> <p>This article describes the problem in which the edges of a network represent customers, and a quantity of material is delivered to them so that each one achieves a desired inventory level while finding the lowest‐cost route of delivery. Routing and inventory decisions are made at the same time. An example of an application of this problem is dust suppression in open‐pit mines. A fleet of trucks spray water along the roads of a mine. Humidity increases the effectiveness of dust‐particle retention. Because the level of humidity decreases, replenishment is done periodically. Other examples of applications include dust suppression in forest roads and plants watering in street medians and sidewalks. We develop a mathematical model that combines two objectives: An inventory objective that minimizes the penalty for the lack of humidity and a routing objective that minimizes watering and traversing costs. Due to the complexity of the mathematical model, we developed an adaptive large neighborhood search algorithm that combines several destroy and repair operators dynamically. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 64(2), 125–139 2014</p> </abstract>