Lower and upper bounds for the mixed capacitated arc routing problem |
| |
| Authors: | Jos -Manuel Belenguer, Enrique Benavent, Philippe Lacomme,Christian Prins |
| |
| Affiliation: | aDept d’Estadística i Investigació Operativa, Universitat de València, C / Dr. Moliner, 50-46100 Burjassot (València), Spain;bLIMOS, Université Blaise Pascal, BP 10125, 63173 Aubière Cedex, France;cISTIT, Université de Technologie de Troyes, BP 2060, 10010 Troyes Cedex, France |
| |
| Abstract: | This paper presents a linear formulation, valid inequalities, and a lower bounding procedure for the mixed capacitated arc routing problem (MCARP). Moreover, three constructive heuristics and a memetic algorithm are described. Lower and upper bounds have been compared on two sets of randomly generated instances. Computational results show that the average gaps between lower and upper bounds are 0.51% and 0.33%, respectively. |
| |
| Keywords: | Capacitated arc routing problem Mixed graph Lower bound Cutting plane Heuristic Memetic algorithm Waste collection |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
