DIALING: Heuristic to Solve Integrated Resource Allocation and Routing Problem with Upper Bound - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue International Journal of Value Chain Management Année : 2011

DIALING: Heuristic to Solve Integrated Resource Allocation and Routing Problem with Upper Bound

Résumé

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.
Fichier non déposé

Dates et versions

hal-00661455 , version 1 (19-01-2012)

Identifiants

Citer

R.A. Malairajan, K. Ganesh, M.N. Qureshi, P. Sivakumar, Yves Ducq. DIALING: Heuristic to Solve Integrated Resource Allocation and Routing Problem with Upper Bound. International Journal of Value Chain Management, 2011, 5 (3/4), pp.281-303. ⟨10.1504/IJVCM.2011.043231⟩. ⟨hal-00661455⟩
94 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More