Truck schedule recovery for solid waste collection in Porto Alegre, Brazil

Jing Quan Li, Denis Borenstein, Pitu Mirchandani

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper considers a truck schedule recovery problem in the context of solid waste collection in the city of Porto Alegre, Brazil. When a truck on a scheduled trip breaks down, a backup truck needs to be selected to serve the cargo on that trip and other trucks might be rescheduled in order to gain the minimum operating and delay costs. The problem consists of designing, in the case of a severe disruption in a trip, new schedules taking into account the existing trucks in the system and a set of unfinished and not initiated collection trips, on which the trucks collect the solid waste in fixed routes and empty the loads in one of the several operational recycling facilities. The main objective is to minimize the total distances traveled and delay costs, as well as to obtain balanced assignments of truck unloads into the recycling facilities, due to the social benefits of the solid waste program. We modeled the problem as a mixed-integer linear problem and used CPLEX to solve it. Finally, computational experiments are conducted on real-world data. The results show that our approach successfully reduces the distances traveled and delays, simultaneously balancing the number of trucks unloading at each recycling facility, in comparison with the current manual strategy.

Original languageEnglish (US)
Pages (from-to)565-582
Number of pages18
JournalInternational Transactions in Operational Research
Volume15
Issue number5
DOIs
StatePublished - Jan 1 2008
Externally publishedYes

Fingerprint

Solid wastes
Trucks
Recovery
Recycling
Brazil
Solid waste
Schedule
Unloading
Costs

Keywords

  • Developing countries
  • Logistics
  • Solid waste management
  • Vehicle scheduling

ASJC Scopus subject areas

  • Business and International Management
  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research
  • Management of Technology and Innovation

Cite this

Truck schedule recovery for solid waste collection in Porto Alegre, Brazil. / Li, Jing Quan; Borenstein, Denis; Mirchandani, Pitu.

In: International Transactions in Operational Research, Vol. 15, No. 5, 01.01.2008, p. 565-582.

Research output: Contribution to journalArticle

@article{2f75524e7719461cbc0b1afdd329f081,
title = "Truck schedule recovery for solid waste collection in Porto Alegre, Brazil",
abstract = "This paper considers a truck schedule recovery problem in the context of solid waste collection in the city of Porto Alegre, Brazil. When a truck on a scheduled trip breaks down, a backup truck needs to be selected to serve the cargo on that trip and other trucks might be rescheduled in order to gain the minimum operating and delay costs. The problem consists of designing, in the case of a severe disruption in a trip, new schedules taking into account the existing trucks in the system and a set of unfinished and not initiated collection trips, on which the trucks collect the solid waste in fixed routes and empty the loads in one of the several operational recycling facilities. The main objective is to minimize the total distances traveled and delay costs, as well as to obtain balanced assignments of truck unloads into the recycling facilities, due to the social benefits of the solid waste program. We modeled the problem as a mixed-integer linear problem and used CPLEX to solve it. Finally, computational experiments are conducted on real-world data. The results show that our approach successfully reduces the distances traveled and delays, simultaneously balancing the number of trucks unloading at each recycling facility, in comparison with the current manual strategy.",
keywords = "Developing countries, Logistics, Solid waste management, Vehicle scheduling",
author = "Li, {Jing Quan} and Denis Borenstein and Pitu Mirchandani",
year = "2008",
month = "1",
day = "1",
doi = "10.1111/j.1475-3995.2008.00648.x",
language = "English (US)",
volume = "15",
pages = "565--582",
journal = "International Transactions in Operational Research",
issn = "0969-6016",
publisher = "Blackwell Publishing",
number = "5",

}

TY - JOUR

T1 - Truck schedule recovery for solid waste collection in Porto Alegre, Brazil

AU - Li, Jing Quan

AU - Borenstein, Denis

AU - Mirchandani, Pitu

PY - 2008/1/1

Y1 - 2008/1/1

N2 - This paper considers a truck schedule recovery problem in the context of solid waste collection in the city of Porto Alegre, Brazil. When a truck on a scheduled trip breaks down, a backup truck needs to be selected to serve the cargo on that trip and other trucks might be rescheduled in order to gain the minimum operating and delay costs. The problem consists of designing, in the case of a severe disruption in a trip, new schedules taking into account the existing trucks in the system and a set of unfinished and not initiated collection trips, on which the trucks collect the solid waste in fixed routes and empty the loads in one of the several operational recycling facilities. The main objective is to minimize the total distances traveled and delay costs, as well as to obtain balanced assignments of truck unloads into the recycling facilities, due to the social benefits of the solid waste program. We modeled the problem as a mixed-integer linear problem and used CPLEX to solve it. Finally, computational experiments are conducted on real-world data. The results show that our approach successfully reduces the distances traveled and delays, simultaneously balancing the number of trucks unloading at each recycling facility, in comparison with the current manual strategy.

AB - This paper considers a truck schedule recovery problem in the context of solid waste collection in the city of Porto Alegre, Brazil. When a truck on a scheduled trip breaks down, a backup truck needs to be selected to serve the cargo on that trip and other trucks might be rescheduled in order to gain the minimum operating and delay costs. The problem consists of designing, in the case of a severe disruption in a trip, new schedules taking into account the existing trucks in the system and a set of unfinished and not initiated collection trips, on which the trucks collect the solid waste in fixed routes and empty the loads in one of the several operational recycling facilities. The main objective is to minimize the total distances traveled and delay costs, as well as to obtain balanced assignments of truck unloads into the recycling facilities, due to the social benefits of the solid waste program. We modeled the problem as a mixed-integer linear problem and used CPLEX to solve it. Finally, computational experiments are conducted on real-world data. The results show that our approach successfully reduces the distances traveled and delays, simultaneously balancing the number of trucks unloading at each recycling facility, in comparison with the current manual strategy.

KW - Developing countries

KW - Logistics

KW - Solid waste management

KW - Vehicle scheduling

UR - http://www.scopus.com/inward/record.url?scp=78649446511&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78649446511&partnerID=8YFLogxK

U2 - 10.1111/j.1475-3995.2008.00648.x

DO - 10.1111/j.1475-3995.2008.00648.x

M3 - Article

AN - SCOPUS:78649446511

VL - 15

SP - 565

EP - 582

JO - International Transactions in Operational Research

JF - International Transactions in Operational Research

SN - 0969-6016

IS - 5

ER -