Silva, FranciscoSerra, DanielUniversitat Pompeu Fabra. Departament d'Economia i Empresa2020-05-252020-05-252008-05-01Network and Spatial Economics, 2, 1, 2007http://hdl.handle.net/10230/616In 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.application/pdfengL'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 Commonsinfo:eu-repo/semantics/workingPapermarket capturequeuingant colony optimizationOperations Managementinfo:eu-repo/semantics/openAccess