Home > Research > Publications & Outputs > Dynamic collection scheduling using remote asse...
View graph of relations

Dynamic collection scheduling using remote asset monitoring

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Dynamic collection scheduling using remote asset monitoring. / McLeod, Fraser; Erdogan, Gunes; Cherrett, Tom et al.
In: Transportation Research Record, Vol. 2378, No. Freight Modeling and Logistics 2013, 20.01.2014, p. 65-72.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

McLeod, F, Erdogan, G, Cherrett, T, Bektas, T, Davies, N, Speed, C, Dickinson, J & Norgate, S 2014, 'Dynamic collection scheduling using remote asset monitoring', Transportation Research Record, vol. 2378, no. Freight Modeling and Logistics 2013, pp. 65-72. https://doi.org/10.3141/2378-07

APA

McLeod, F., Erdogan, G., Cherrett, T., Bektas, T., Davies, N., Speed, C., Dickinson, J., & Norgate, S. (2014). Dynamic collection scheduling using remote asset monitoring. Transportation Research Record, 2378(Freight Modeling and Logistics 2013), 65-72. https://doi.org/10.3141/2378-07

Vancouver

McLeod F, Erdogan G, Cherrett T, Bektas T, Davies N, Speed C et al. Dynamic collection scheduling using remote asset monitoring. Transportation Research Record. 2014 Jan 20;2378(Freight Modeling and Logistics 2013):65-72. doi: 10.3141/2378-07

Author

McLeod, Fraser ; Erdogan, Gunes ; Cherrett, Tom et al. / Dynamic collection scheduling using remote asset monitoring. In: Transportation Research Record. 2014 ; Vol. 2378, No. Freight Modeling and Logistics 2013. pp. 65-72.

Bibtex

@article{7099738e77834e9282cf5fd4c08e95b1,
title = "Dynamic collection scheduling using remote asset monitoring",
abstract = "Remote sensing technology is now coming onto the market in the waste collection sector. This technology allows waste and recycling receptacles to report their fill levels at regular intervals. This reporting enables collection schedules to be optimized dynamically to meet true servicing needs in a better way and so reduce transport costs and ensure that visits to clients are made in a timely fashion. This paper describes a real-life logistics problem faced by a leading UK charity that services its textile and book donation banks and its high street stores by using a common fleet of vehicles with various carrying capacities. Use of a common fleet gives rise to a vehicle routing problem in which visits to stores are on fixed days of the week with time window constraints and visits to banks (fitted with remote fill-monitoring technology) are made in a timely fashion so that the banks do not become full before collection. A tabu search algorithm was developed to provide vehicle routes for the next day of operation on the basis of the maximization of profit. A longer look-ahead period was not considered because donation rates to banks are highly variable. The algorithm included parameters that specified the minimum fill level (e.g., 50%) required to allow a visit to a bank and a penalty function used to encourage visits to banks that are becoming full. The results showed that the algorithm significantly reduced visits to banks and increased profit by up to 2.4%, with the best performance obtained when the donation rates were more variable.",
author = "Fraser McLeod and Gunes Erdogan and Tom Cherrett and Tolga Bektas and Nigel Davies and Chris Speed and Janet Dickinson and Sarah Norgate",
year = "2014",
month = jan,
day = "20",
doi = "10.3141/2378-07",
language = "English",
volume = "2378",
pages = "65--72",
journal = "Transportation Research Record",
issn = "0361-1981",
publisher = "NATL ACAD SCIENCES",
number = "Freight Modeling and Logistics 2013",

}

RIS

TY - JOUR

T1 - Dynamic collection scheduling using remote asset monitoring

AU - McLeod, Fraser

AU - Erdogan, Gunes

AU - Cherrett, Tom

AU - Bektas, Tolga

AU - Davies, Nigel

AU - Speed, Chris

AU - Dickinson, Janet

AU - Norgate, Sarah

PY - 2014/1/20

Y1 - 2014/1/20

N2 - Remote sensing technology is now coming onto the market in the waste collection sector. This technology allows waste and recycling receptacles to report their fill levels at regular intervals. This reporting enables collection schedules to be optimized dynamically to meet true servicing needs in a better way and so reduce transport costs and ensure that visits to clients are made in a timely fashion. This paper describes a real-life logistics problem faced by a leading UK charity that services its textile and book donation banks and its high street stores by using a common fleet of vehicles with various carrying capacities. Use of a common fleet gives rise to a vehicle routing problem in which visits to stores are on fixed days of the week with time window constraints and visits to banks (fitted with remote fill-monitoring technology) are made in a timely fashion so that the banks do not become full before collection. A tabu search algorithm was developed to provide vehicle routes for the next day of operation on the basis of the maximization of profit. A longer look-ahead period was not considered because donation rates to banks are highly variable. The algorithm included parameters that specified the minimum fill level (e.g., 50%) required to allow a visit to a bank and a penalty function used to encourage visits to banks that are becoming full. The results showed that the algorithm significantly reduced visits to banks and increased profit by up to 2.4%, with the best performance obtained when the donation rates were more variable.

AB - Remote sensing technology is now coming onto the market in the waste collection sector. This technology allows waste and recycling receptacles to report their fill levels at regular intervals. This reporting enables collection schedules to be optimized dynamically to meet true servicing needs in a better way and so reduce transport costs and ensure that visits to clients are made in a timely fashion. This paper describes a real-life logistics problem faced by a leading UK charity that services its textile and book donation banks and its high street stores by using a common fleet of vehicles with various carrying capacities. Use of a common fleet gives rise to a vehicle routing problem in which visits to stores are on fixed days of the week with time window constraints and visits to banks (fitted with remote fill-monitoring technology) are made in a timely fashion so that the banks do not become full before collection. A tabu search algorithm was developed to provide vehicle routes for the next day of operation on the basis of the maximization of profit. A longer look-ahead period was not considered because donation rates to banks are highly variable. The algorithm included parameters that specified the minimum fill level (e.g., 50%) required to allow a visit to a bank and a penalty function used to encourage visits to banks that are becoming full. The results showed that the algorithm significantly reduced visits to banks and increased profit by up to 2.4%, with the best performance obtained when the donation rates were more variable.

U2 - 10.3141/2378-07

DO - 10.3141/2378-07

M3 - Journal article

VL - 2378

SP - 65

EP - 72

JO - Transportation Research Record

JF - Transportation Research Record

SN - 0361-1981

IS - Freight Modeling and Logistics 2013

ER -