Indexed on: 27 Sep '12Published on: 27 Sep '12Published in: Optimization Letters
We tackle the mixed capacitated general routing problem (MCGRP) which generalizes many other routing problems. We propose an integer programming model for the MCGRP and extend some inequalities originally introduced for the capacitated arc routing problem (CARP). Identification procedures for these inequalities and for some relaxed constraints are also discussed. Finally, we describe a branch and cut algorithm including the identification procedures and present computational experiments over instances derived from the CARP.
Join Sparrho today to stay on top of science
Discover, organise and share research that matters to you