Incorporating waiting time in competitive location models: Formulations and heuristics

Mostra el registre complet Registre parcial de l'ítem

  • dc.contributor.author Silva, Francisco
  • dc.contributor.author Serra, Daniel
  • dc.contributor.other Universitat Pompeu Fabra. Departament d'Economia i Empresa
  • dc.date.accessioned 2020-05-25T09:26:59Z
  • dc.date.available 2020-05-25T09:26:59Z
  • dc.date.issued 2008-05-01
  • dc.date.modified 2020-05-25T09:22:08Z
  • dc.description.abstract In this paper we propose a metaheuristic to solve a new version of the Maximum Capture Problem. In the original MCP, market capture is obtained by lower traveling distances or lower traveling time, in this new version not only the traveling time but also the waiting time will affect the market share. This problem is hard to solve using standard optimization techniques. Metaheuristics are shown to offer accurate results within acceptable computing times.
  • dc.format.mimetype application/pdf*
  • dc.identifier https://econ-papers.upf.edu/ca/paper.php?id=1091
  • dc.identifier.citation Network and Spatial Economics, 2, 1, 2007
  • dc.identifier.uri http://hdl.handle.net/10230/616
  • dc.language.iso eng
  • dc.relation.ispartofseries Economics and Business Working Papers Series; 1091
  • dc.rights L'accés als continguts d'aquest document queda condicionat a l'acceptació de les condicions d'ús establertes per la següent llicència Creative Commons
  • dc.rights.accessRights info:eu-repo/semantics/openAccess
  • dc.rights.uri http://creativecommons.org/licenses/by-nc-nd/3.0/es/
  • dc.subject.keyword market capture
  • dc.subject.keyword queuing
  • dc.subject.keyword ant colony optimization
  • dc.subject.keyword Operations Management
  • dc.title Incorporating waiting time in competitive location models: Formulations and heuristics
  • dc.type info:eu-repo/semantics/workingPaper