Vehicle routing problems with different service constraints: A branch‐and‐cut‐and‐price algorithm. Issue 4 (10th November 2014)

• Record Type: Journal Article
• Authors: Ceselli, Alberto; Righini, Giovanni; Tresoldi, Emanuele
• Is Part Of: Networks. Volume 64:Issue 4(2014:Dec.)
• Page Start: 282
• Page End: 291
• Publication Date: 2014-11-10
• Subjects: Network analysis (Planning) -- Periodicals; 658.4032
• DOI: 10.1002/net.21584
• Languages: English
• ISSNs: 0028-3045

Abstract

<abstract abstract-type="main"> <title> <x xml:space="preserve">Abstract</x> </title> <p>In this article, we consider a variation of the vehicle routing problem arising in the optimization of waste management systems. Constraints imposing adequate level of service to the citizens and even workload among the drivers make the problem challenging and ask for the design of specialized algorithmic approaches. We propose an exact optimization algorithm, in which dynamic generation of rows and columns is done in a branch‐and‐bound framework; exact and heuristic algorithms are proposed for the pricing problem. Experimental tests on data‐sets from the literature show that our algorithm outperforms previous ones and it is able to solve instances of realistic size to proven optimality in reasonable computing time. © 2014 Wiley Periodicals, Inc. NETWORKS, Vol. 64(4), 282–291 2014</p> </abstract>