Abstract
In many municipal waste collection systems, it is necessary to extend the planning horizon to more than one working day. This can happen, for example, in the collection of some recyclable articles. In this case, some of the streets must be served every day but others need only once every two days service. In this paper, we focus on planning the routing of the collection vehicles while extending the planning horizon to two working days. We propose a simple, but effective, heuristic approach and we carry out extensive computational experiments to evaluate its performance. We also apply our method to solve a real-case application related to the collection of recyclable wastes in a small Italian city.
Original language | English |
---|---|
Article number | 1740015 |
Journal | Asia-Pacific Journal of Operational Research |
Volume | 34 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2017 |
Fingerprint
Keywords
- extended planning horizon
- Municipal waste collection
- periodic routing
ASJC Scopus subject areas
- Management Science and Operations Research
Cite this
Solving the Periodic Edge Routing Problem in the Municipal Waste Collection. / Triki, Chefi.
In: Asia-Pacific Journal of Operational Research, Vol. 34, No. 3, 1740015, 2017.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Solving the Periodic Edge Routing Problem in the Municipal Waste Collection
AU - Triki, Chefi
PY - 2017
Y1 - 2017
N2 - In many municipal waste collection systems, it is necessary to extend the planning horizon to more than one working day. This can happen, for example, in the collection of some recyclable articles. In this case, some of the streets must be served every day but others need only once every two days service. In this paper, we focus on planning the routing of the collection vehicles while extending the planning horizon to two working days. We propose a simple, but effective, heuristic approach and we carry out extensive computational experiments to evaluate its performance. We also apply our method to solve a real-case application related to the collection of recyclable wastes in a small Italian city.
AB - In many municipal waste collection systems, it is necessary to extend the planning horizon to more than one working day. This can happen, for example, in the collection of some recyclable articles. In this case, some of the streets must be served every day but others need only once every two days service. In this paper, we focus on planning the routing of the collection vehicles while extending the planning horizon to two working days. We propose a simple, but effective, heuristic approach and we carry out extensive computational experiments to evaluate its performance. We also apply our method to solve a real-case application related to the collection of recyclable wastes in a small Italian city.
KW - extended planning horizon
KW - Municipal waste collection
KW - periodic routing
UR - http://www.scopus.com/inward/record.url?scp=85021142225&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85021142225&partnerID=8YFLogxK
U2 - 10.1142/S0217595917400152
DO - 10.1142/S0217595917400152
M3 - Article
AN - SCOPUS:85021142225
VL - 34
JO - Asia-Pacific Journal of Operational Research
JF - Asia-Pacific Journal of Operational Research
SN - 0217-5959
IS - 3
M1 - 1740015
ER -