Please use this identifier to cite or link to this item:
https://scholarhub.balamand.edu.lb/handle/uob/7176
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Daba, Jihad S. | en_US |
dc.contributor.author | Samarji, Tarek | en_US |
dc.date.accessioned | 2024-01-17T10:55:47Z | - |
dc.date.available | 2024-01-17T10:55:47Z | - |
dc.date.issued | 2023 | - |
dc.identifier.uri | https://scholarhub.balamand.edu.lb/handle/uob/7176 | - |
dc.description | Includes bibliographical references | en_US |
dc.description.abstract | In these times of high uncertainty, global recession, and lack of adequate funding for humanitarian needs, it is crucial more than ever before to optimize humanitarian operations to achieve high levels of productivity and efficiency and to cut on operational costs without compromising delivery of humanitarian aid to the most vulnerable population. One of the major contributors to cost of operations is transportation costs. In the humanitarian field, fleets are operated to deliver aid and assistance to the needy and most vulnerable population around the globe. These fleets are run in the form of field trips, which constitute of a vehicle, a professional driver, humanitarian aid officer(s), and aid cargo. This study aims to optimize resources and reduce costs of humanitarian field trips using an automated VBA program. The VBA program utilizes optimization algorithms such as compatibility and overlapping matrices to optimize field trip requisitions. It also uses the Hungarian method to optimally solve the assignment matrices of vehicles to field trips and drivers to field trips. The outcome of the study is a user-friendly tool which uses as inputs: vehicles, drivers, field trips history, and field trips requisition plan, and provides as outputs: the optimum list of combined field trips, optimum vehicles to field trips assignment based on minimum cost of transportation, and optimum drivers to field trips assignment based on the maximum productivity of drivers. The driving force behind this project was the obligation to optimize the delivery of humanitarian aid to the needy and affected people. The aspiration was to contribute with a positive impact on this crucial path. This objective has been successfully realized through the optimization of vehicle and driver assignments, thereby enhancing the efficiency of field trips in the humanitarian field. | en_US |
dc.description.statementofresponsibility | by Tarek Samarji | en_US |
dc.format.extent | 1 online resource (no pagination) : ill., tables | en_US |
dc.language.iso | eng | en_US |
dc.rights | This object is protected by copyright, and is made available here for research and educational purposes. Permission to reuse, publish, or reproduce the object beyond the personal and educational use exceptions must be obtained from the copyright holder | en_US |
dc.subject | Hungarian Method, Assignment, Fleet Management, field trips, Humanitarian, Compatibility Matrix, Overlapping Matrix, VBA. | en_US |
dc.subject.lcsh | Visual Basic for Applications (Computer program language) | en_US |
dc.subject.lcsh | Transportation-Planning | en_US |
dc.subject.lcsh | University of Balamand--Dissertations | en_US |
dc.subject.lcsh | Dissertation, Academic | en_US |
dc.title | An application of field trips planning optimization : a humanitarian context | en_US |
dc.type | Thesis | en_US |
dc.contributor.corporate | University of Balamand | en_US |
dc.contributor.department | Department of Engineering Management | en_US |
dc.contributor.faculty | Faculty of Engineering | en_US |
dc.contributor.institution | University of Balamand | en_US |
dc.date.catalogued | 2024-01-17 | - |
dc.description.degree | MS in Engineering Management | en_US |
dc.description.status | Published | en_US |
dc.identifier.ezproxyURL | http://ezsecureaccess.balamand.edu.lb/login?url=http://uoblibraries.balamand.edu.lb/projects_and_theses/1419236974.pdf | en_US |
dc.provenance.recordsource | WMS | en_US |
dc.identifier.oclcnb | 1419236974 | - |
Appears in Collections: | UOB Theses and Projects |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.