Robust maximum covering location problem (RMCLP)

Simple item page
dc.contributor.authorJafaripour, Saeid
dc.contributor.authorUniversity of Lethbridge. Faculty of Arts and Science
dc.contributor.supervisorBenkoczi, Robert
dc.date.accessioned2023-05-30T17:34:47Z
dc.date.available2023-05-30T17:34:47Z
dc.date.issued2023
dc.degree.levelMasters
dc.description.abstractThe Maximum Covering Location Problem (MCLP) is a widely recognized optimization problem used in facility location planning. The objective of this problem is to minimize costs while maximizing accessibility to customers. In this thesis, the MCLP is being solved as an optimization problem under uncertain customer benefits in a network, to minimize regret, which is the difference between the cost of the optimal solution under the worst- case scenario and the cost of the current solution under the worst-case scenario. Three algorithms were implemented to solve the problem and find the optimal solution, including an exact algorithm and two approximate algorithms. The algorithms were evalu- ated using various instances, including the OR-Library and randomly generated instances. The results indicate that the exact algorithm is better at minimizing regret, but it is unable to solve large instances within the allotted time limit. Also, one of the approximate algo- rithms based on a Mean-Scenario, which is a 2-Approximation general algorithm, indicates very competitive results to obtain the Min-Max Regret. The observations of this thesis confirm the results of related research for both the exact algorithm and the Mean-Scenario algorithm, which rely on standard and general methodologies. Also, the solutions obtained by the other approximate algorithm based on randomized rounding are within only nine percent of the Mean-Scenrio algorithm results, which proves the value of this approach.
dc.identifier.urihttps://hdl.handle.net/10133/6502
dc.language.isoen
dc.proquestyesYes
dc.publisherLethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Science
dc.publisher.departmentDepartment of Mathematics and Computer Science
dc.publisher.facultyArts and Science
dc.relation.ispartofseriesThesis (University of Lethbridge. Faculty of Arts and Science)
dc.subjectMaximum covering location problem
dc.subjectMCLP
dc.subjectMin-max regret
dc.subjectApproximate algorithms
dc.subjectExact algorithms
dc.subject.lcshDissertations, Academic
dc.titleRobust maximum covering location problem (RMCLP)
dc.typeThesis
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
JAFARIPOUR_SAEID_MSC_2023.pdf
Size:
6.2 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
3.25 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Arts and Science, Faculty of
University of Lethbridge Theses