An Adaptive Large Neighbourhood Search Heuristic for the Capacitated Arc-Routing Problem with Stochastic Demands

Laporte, Gilbert; Musmanno, Roberto; Vocaturo, Francesca
February 2010
Transportation Science;Feb2010, Vol. 44 Issue 1, p125
Academic Journal
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.


Related Articles

  • INFINITELY DIVISIBLE APPROXIMATIONS FOR DISCRETE NONLATTICE VARIABLES. Čekanavičius, V. // Advances in Applied Probability;Dec2003, Vol. 35 Issue 4, p982 

    Sums of independent random variables concentrated on discrete, not necessarily lattice, set of points are approximated by infinitely divisible distributions and signed compound Poisson measures. A version of Kolmogorov's first uniform theorem is proved. Second-order asymptotic expansions are...

  • Efficient Routing using Partitive Clustering Algorithms in Ferry-based Delay Tolerant Networks. Jedari, Behrouz; Goudarzi, Rouhollah; Dehghan, Mehdi // International Journal of Future Generation Communication & Netwo;2009, Vol. 2 Issue 4, p1 

    The Delay Tolerant Networks (DTNs) generally contain relatively sparse nodes that are frequently disconnected. Message Ferrying (MF) is a mobility-assisted approach which utilizes a set of mobile elements to provide communication service in ferry-based DTNs. In this paper, we propose a...

  • A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands. Rei, Walter; Gendreau, Michel; Soriano, Patrick // Transportation Science;Feb2010, Vol. 44 Issue 1, p136 

    We present a new algorithm that uses both local branching and Monte Carlo sampling in a multidescent search strategy for solving 0-1 integer stochastic programming problems. This procedure is applied to the single-vehicle routing problem with stochastic demands. Computational results show the...

  • Global and local asymptotics for the busy period of an M/G/1 queue. Denisov, Denis; Shneer, Seva // Queueing Systems;Apr2010, Vol. 64 Issue 4, p383 

    We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the global and local asymptotics for the busy period. Our analysis relies on the explicit formula for the joint distribution for the number of customers and the length of the busy period of an M/G/1 queue.

  • A highly topology adaptable ad hoc routing protocol with complementary preemptive link breaking avoidance and path shortening mechanisms. Rei-Heng Cheng; Tung-Kuang Wu; Chang Yu // Wireless Networks (10220038);Jul2010, Vol. 16 Issue 5, p1289 

    Ad-hoc on-demand distance vector routing (AODV) is a well-known routing protocol for mobile ad hoc networks. The original AODV protocol works in a semi-dynamic fashion, by establishing a route on demand and using that route until it breaks. However, to suit the changing network topology of ad...

  • The robust network loading problem with dynamic routing. Mattia, Sara // Computational Optimization & Applications;Apr2013, Vol. 54 Issue 3, p619 

    In this paper the Robust Network Loading problem with splittable flows and dynamic routing under polyhedral uncertainty for the demands is considered. Polyhedral results for the capacity formulation of the problem are given. The first exact approach for solving the problem is presented. A...

  • Routing Algorithms, Process Model for Quality of Services (QoS) and Architectures for Two-Dimensional 4x4 Mesh Topology Network-on-Chip. Jalil, Nauman; Qureshi, Adnan; Khan, Furqan; Qazi, Sohaib Ayyaz // International Journal of Computer Theory & Engineering;Feb2012, Vol. 4 Issue 1, p85 

    In this paper we have provided routing algorithms, process model for quality of service (QoS) and architecture for new Timer based adaptive routing algorithm for a generic network, based on a two-dimensional mesh topology. Compared to previous work, our proposed work has provided with details of...

  • DYNAMIC ROUTING OF IP TRAFFIC BASED ON QOS PARAMETERS. Kriška, Martin; Janitor, Jozef; Fecilak, Peter // International Journal of Computer Networks & Communications;Jul2014, Vol. 6 Issue 4, p11 

    The article looks into the current state of the art of dynamic routing protocols with respect to their possibilities to react to changes in the Quality of Service when selecting the best route towards a destination network. New options that could leverage information about the ever changing QoS...

  • Policy Routing.  // Network Dictionary;2007, p379 

    A definition of the term "Policy Routing" is presented. Also known as Policy Based Routing, it refers to a routing scheme that forwards packets to a specific interfaces based on preconfigured policies by network administrations. These policies might specify that traffic sent from a particular...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics