Title: DIALING: heuristic to solve integrated resource allocation and routing problem with upper bound
Authors: R.A. Malairajan; K. Ganesh; M.N. Qureshi; P. Sivakumar; Yves Ducq
Addresses: Department of Mechanical Engineering, Anna University of Technology Tirunelveli, Tuticorin Campus, Tuticorin – 628008, Tamilnadu, India. ' Global Business Services-Global Delivery, IBM India Private Limited, Bandra East, Mumbai – 400051, India. ' Department of Mechanical Engineering, M.S. University of Baroda, Vadodara – 390002, Gujarat, India. ' Department of Mechanical Engineering, Vickram College of Engineering, Enathi, Sivagangai, Madurai – 63056, India. ' Department LAPS – Group GRAI, University of Bordeaux, Bâtiment A4, 351 Cours de la Libération, 33405 Talence cedex, France
Abstract: An extended variant of mixed capacitated arc routing problems (MCARP) with upper bound on number of vehicle is considered in this study for the application of waste collection problem and it is termed as integrated resource allocation and routing problem with upper bound (IRARPUB) problem. Composite heuristic leveraging Dijkstra|s algorithm and local search inherent genetic algorithm (DIALING) is proposed to solve both MCARP and IRARPUB. Extensive comparisons of the proposed heuristic with the existing benchmarks or the available lower bound show that it can produce excellent results, outperforming the existing best or yielding results with minimal deviations.
Keywords: mixed capacitated arc routing; resource allocation routing problems; upper bound; IRARPUB; Dijkstra; local search; genetic algorithms; waste collection; vehicle numbers.
International Journal of Value Chain Management, 2011 Vol.5 No.3/4, pp.281 - 303
Published online: 20 Oct 2011 *Full-text access for editors Access for subscribers Purchase this article Comment on this article