A regret model applied to the maximum coverage location problem with queue discipline

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

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

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
Paper09-2013.pdf		304.66 KB	Adobe PDF	Download

Send Feedback

Authors

Nunes, Pedro Portugal de Sousa

Silva, Francisco

Lourenço, Helena Ramalhinho

Abstract(s)

This article discusses issues related to the location and allocation problems where is intended to demonstrate, through the random number generation, the influence of congestion of such systems in the final solutions. It is presented an algorithm that, in addition to the GRASP, incorporates the Regret with the pminmax method to evaluate the heuristic solution obtained in regard to its robustness for different scenarios. To the well know Maximum Coverage Location Problem from Church and Revelle [1] an alternative perspective is added in which the choice behavior of the server does not only depend on the elapsed time from the demand point looking to the center, but also includes the waiting time for service conditioned by a waiting queue.

Keywords

Allocation Coverage Heuristic Location Regret Model

URI

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

Citation

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