Solving an urban waste collection problem using ants heuristics

被引:81
作者
Bautista, Joaquin [1 ]
Fernandez, Elena [2 ]
Pereira, Jordi [3 ]
机构
[1] Univ Politecn Cataluna, Nissan Chair, Barcelona, Spain
[2] Univ Politecn Cataluna, Dpt Estadist & Invest Operat, Barcelona, Spain
[3] Univ Politecn Cataluna, Dept Organitzac Empreses, Barcelona, Spain
关键词
urban waste management; ants heuristics; arc routing;
D O I
10.1016/j.cor.2007.01.029
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper describes the methodology that we have applied for the solution of an urban waste collection problem in the municipality of Sant Boi de Llobregat, within the metropolitan area of Barcelona (Spain). The basic nature of the considered problem is that of a capacitated arc routing problem, although it has several specific characteristics, mainly derived from traffic regulations. We present the model that we have built for the problem, which results after an appropriate transformation of the problem into a node routing one. We also present the ant colonies heuristics that we have used to obtain the solutions to the problem. These combine constructive methods, based on nearest neighbor and on nearest insertion, with a local search that explores various neighborhoods. The application of the proposed methods gives results that improve considerably the ones that were previously used in the municipality. (c) 2007 Elsevier Ltd. All rights reserved.
引用
收藏
页码:3020 / 3033
页数:14
相关论文
共 26 条
[1]  
[Anonymous], 2004, Ant colony optimization
[2]  
BAUTISTA J, 2001, PROYECTO INEGRAL GES
[3]   The capacitated arc routing problem: Valid inequalities and facets [J].
Belenguer, JM ;
Benavent, E .
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1998, 10 (02) :165-187
[4]   Lower and upper bounds for the mixed capacitated arc routing problem [J].
Belenguer, Jose-Manuel ;
Benavent, Enrique ;
Lacomme, Philippe ;
Prins, Christian .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) :3363-3383
[5]   THE CAPACITATED ARC ROUTING PROBLEM - LOWER BOUNDS [J].
BENAVENT, E ;
CAMPOS, V ;
CORBERAN, A ;
MOTA, E .
NETWORKS, 1992, 22 (07) :669-690
[6]   COMPUTER-ASSISTED SYSTEM FOR ROUTING AND SCHEDULING OF STREET SWEEPERS [J].
BODIN, LD ;
KURSH, SJ .
OPERATIONS RESEARCH, 1978, 26 (04) :525-537
[7]   DETAILED DESCRIPTION OF A COMPUTER-SYSTEM FOR THE ROUTING AND SCHEDULING OF STREET SWEEPERS [J].
BODIN, LD ;
KURSH, SJ .
COMPUTERS & OPERATIONS RESEARCH, 1979, 6 (04) :181-198
[8]   An efficient algorithm for computing least cost paths with turn constraints [J].
Boroujerdi, A ;
Uhlmann, J .
INFORMATION PROCESSING LETTERS, 1998, 67 (06) :317-321
[9]   The Rural Postman Problem on mixed graphs with turn penalties [J].
Corberán, A ;
Martí, R ;
Martínez, E ;
Soler, D .
COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (07) :887-903
[10]   IMPROVEMENTS AND EXTENSIONS TO THE MILLER-TUCKER-ZEMLIN SUBTOUR ELIMINATION CONSTRAINTS [J].
DESROCHERS, M ;
LAPORTE, G .
OPERATIONS RESEARCH LETTERS, 1991, 10 (01) :27-36