Optimal Scheduling of Trucks for the Clearance of Garbage of a City.

Date of Submission

December 1993

Date of Award

Winter 12-12-1994

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Applied Statistics Unit (ASU-Kolkata)


Roy, Bimal Kumar (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

The problem of constructing an optimal schedule of trucks for garbage clearance of a city is considered. The garbage is assumed to be accumulated along the streets of the city. The requirement is to minimize the total distance covered and also the number of trips. The optimasation problem of minimization of distance is shown to be NP- complete. It is also shown that there does not exist any k-absolute approximate algorithm for the above problem. An algorithm, however, has been found which yields a 1-relative approximate schedule for the case of two trips. This algorithm is generalised for the case of more than two trips using the divide and conquer strategy. this general algorithm is shown to require an optimal number of trips, along with an upper bound on the total distance covered. Further, this algorithm is modified to a heuristic, which is empirically seen to require a lesser amount of distance covered but at the cost of slight increase in the number of trips. However, there exists an upper bound on the number of trips required.


ProQuest Collection ID: http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:28843755

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.



This document is currently not available here.