Truck scheduling for solid waste collection in the City of Porto Alegre, Brazil
This paper considers a truck scheduling problem in the context of solid waste collection in the City of Porto Alegre, Brazil. The problem consists of designing "good" daily truck schedules over a set of previously defined collection trips, on which the trucks collect solid waste in fixed routes and empty loads in one of several operational recycling facilities in the system. These facilities are managed by cooperatives whose members are poor and not part of the mainstream economy. The main objective is to minimize the total operating and fixed truck costs. We show that the problem can be modeled as a special case of the single-depot vehicle scheduling problem, which is polynomially solvable. However, due to the social benefits of the solid waste program, it is desirable to obtain balanced assignments of collection trips unloading their cargo at the recycling facilities. We prove that the truck scheduling problem considering balanced unloading is NP-hard. A heuristic approach, incorporating an auction algorithm and a dynamic penalty method, is designed to acquire a good solution. Finally, computational experiments are conducted on real data. The results show that the heuristic approach simultaneously reduces total costs and balances the number of trips assigned to each recycling facility.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 36 (2008)
Issue (Month): 6 (December)
|Contact details of provider:|| Web page: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description|
|Order Information:|| Postal: http://www.elsevier.com/wps/find/supportfaq.cws_home/regional|
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Kirca, Omer & Erkip, Nesim, 1988. "Selecting transfer station locations for large solid waste systems," European Journal of Operational Research, Elsevier, vol. 35(3), pages 339-349, June.
- Bokinge, Ulf & Hasselstrom, Dick, 1980. "Improved vehicle scheduling in public transport through systematic changes in the time-table," European Journal of Operational Research, Elsevier, vol. 5(6), pages 388-395, December.
- Lorena, Luiz Antonio N. & Narciso, Marcelo G., 1996. "Relaxation heuristics for a generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 600-610, June.
- Donald D. Eisenstein & Ananth. V. Iyer, 1997. "Garbage Collection in Chicago: A Dynamic Scheduling Model," Management Science, INFORMS, vol. 43(7), pages 922-933, July.
- Tung, Dang Vu & Pinnoi, Anulark, 2000. "Vehicle routing-scheduling for waste collection in Hanoi," European Journal of Operational Research, Elsevier, vol. 125(3), pages 449-468, September.
- Mauro Dell'Amico & Matteo Fischetti & Paolo Toth, 1993. "Heuristic Algorithms for the Multiple Depot Vehicle Scheduling Problem," Management Science, INFORMS, vol. 39(1), pages 115-125, January.
- Marshall L. Fisher & R. Jaikumar & Luk N. Van Wassenhove, 1986. "A Multiplier Adjustment Method for the Generalized Assignment Problem," Management Science, INFORMS, vol. 32(9), pages 1095-1103, September.
When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:36:y:2008:i:6:p:1133-1149. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.