A heuristic solution procedure for the constrained node routing problem and an implementation to hazardous solid waste collection

Simple item page
dc.contributorGraduate Program in Industrial Engineering.
dc.contributor.advisorOr, İlhan.
dc.contributor.authorAkyüz, Ali Tümer.
dc.date.accessioned2023-03-16T10:30:35Z
dc.date.available2023-03-16T10:30:35Z
dc.date.issued1992.
dc.description.abstractConstrained Node Routing is a well known Vehicle Routing Problem which has many real-life applications. In this study, first the general VRP is introduced together with solution procedures and its application to Solid Waste Collection is analysed. Then, CAVR (Computer Assisted Vehicle Routing), a new heuristic solution procedure used for solving the single depot-constrained node routing problems is presented. Its graphic displays and user friendly properties are also discussed. Thirdly, the developed procedure is tested on numerous literature problems so that an eveluation and comparison in terms of solution capabilities can be done. Finally, the suggested procedure is implemented to design routes for collecting the hazardous solid wastes of the hospitals in Istanbul.
dc.format.extent30 cm.
dc.format.pagesix, 78 leaves;
dc.identifier.otherIE 1992 Ak9
dc.identifier.urihttps://digitalarchive.library.bogazici.edu.tr/handle/123456789/13476
dc.publisherThesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 1992.
dc.relationIncludes appendices.
dc.relationIncludes appendices.
dc.subject.lcshHazardous wastes.
dc.subject.lcshHazardous wastes -- Transportation.
dc.subject.lcshTraveling-salesman problem.
dc.titleA heuristic solution procedure for the constrained node routing problem and an implementation to hazardous solid waste collection

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
b1156774.019171.001.PDF
Size:
3.12 MB
Format:
Adobe Portable Document Format
Download

Collections

M.S. Theses