Modeling and solving the mixed capacitated general routing problem |
| |
Authors: | Adamo Bosco Demetrio Laganà Roberto Musmanno Francesca Vocaturo |
| |
Institution: | 1. Dipartimento di Elettronica, Informatica e Sistemistica, Università della Calabria, Arcavacata di Rende (CS), 87036, Italy 2. Dipartimento di Economia e Statistica, Università della Calabria, Arcavacata di Rende (CS), 87036, Italy
|
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|