A regret model applied to the maximum capture location problem

Nunes, Pedro Portugal de Sousa; Silva, Francisco; Lourenço, Helena Ramalhinho

http://hdl.handle.net/10400.3/5066

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
Paper12-2013.pdf		284.91 KB	Adobe PDF	Download

Send Feedback

Authors

Nunes, Pedro Portugal de Sousa

Silva, Francisco

Lourenço, Helena Ramalhinho

Abstract(s)

This article addresses issues related to location and allocation problems. Herein, we intend to demonstrate the influence of congestion, through the random number generation, of such systems in final solutions. An algorithm is presented which, in addition to the GRASP, incorporates the Regret with the pminmax method to evaluate the heuristic solution obtained with regard to its robustness for different scenarios. Taking as our point of departure the Maximum Capture Location Problem proposed by Church and Revelle [1, 26], an alternative perspective is added in which the choice behavior of the server does not depend only on the elapsed time from the demand point looking to the center, but includes also the service waiting time.

Keywords

Allocation Coverage Heuristic Location Regret Model

URI

http://hdl.handle.net/10400.3/5066

Citation

Nunes, Pedro P.; Silva, Francisco J. F.; Lourenço, Helena R. (2013). A regret model applied to the maximum capture location problem, “Working Paper Series”, nº 12/13, 29 pp.. Ponta Delgada: Universidade dos Açores, CEEAplA-A.