Search

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.cor.2005.02.009 Byline: Jose-Manuel Belenguer (a), Enrique Benavent (a), Philippe Lacomme (b), Christian Prins (c) 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. Author Affiliation: (a) Dept d'Estadistica i Investigacio Operativa, Universitat de Valencia, C / Dr. Moliner, 50-46100 Burjassot (Valencia), Spain (b) LIMOS, Universite Blaise Pascal, BP 10125, 63173 Aubiere Cedex, France (c) ISTIT, Universite de Technologie de Troyes, BP 2060, 10010 Troyes Cedex, France

To link to full-text access for this article, visit this link: http://dx.doi.org/10.1016/j.cor.2004.04.007 Byline: Enrique Benavent (a), Angel Corberan (a), Estefania PiA[+ or -]ana (a), Isaac Plana (a), Jose M. Sanchis (b) Abstract: In this paper we deal with the windy rural postman problem. This problem generalizes several important arc routing problems and has interesting real-life applications. Here, we present several heuristics whose study has lead to the design of a scatter search algorithm for the windy rural postman problem. Extensive computational experiments over different sets of instances, with sizes up to 988 nodes and 3952 edges, are also presented. Author Affiliation: (a) Departmento d'Estadistica i Investigacio Operativa, Universitat de Valencia, Dr. Moliner 50, Burjassot, Valencia 46100, Spain (b) Departmento de Matematica Aplicada, Universidad Politecnica de Valencia, Spain