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

Akyüz, Ali Tümer.

Arşiv ve Dokümantasyon Merkezi Dijital Arşivi Ana Sayfası
→
Boğaziçi Üniversitesi Tezleri
→
Fen Bilimleri Enstitüsü
→
Endüstri Mühendisliği
→
M.S. Theses
→
Öğe Göster

dc.contributor	Graduate Program in Industrial Engineering.
dc.contributor.advisor	Or, İlhan.
dc.contributor.author	Akyüz, Ali Tümer.
dc.date.accessioned	2023-03-16T10:30:35Z
dc.date.available	2023-03-16T10:30:35Z
dc.date.issued	1992.
dc.identifier.other	IE 1992 Ak9
dc.identifier.uri	http://digitalarchive.boun.edu.tr/handle/123456789/13476
dc.description.abstract	Constrained 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.extent	30 cm.
dc.publisher	Thesis (M.S.) - Bogazici University. Institute for Graduate Studies in Science and Engineering, 1992.
dc.relation	Includes appendices.
dc.relation	Includes appendices.
dc.subject.lcsh	Hazardous wastes.
dc.subject.lcsh	Hazardous wastes -- Transportation.
dc.subject.lcsh	Traveling-salesman problem.
dc.title	A heuristic solution procedure for the constrained node routing problem and an implementation to hazardous solid waste collection
dc.format.pages	ix, 78 leaves;