| dc.contributor.author | Cerdeira, J. O. | |
| dc.contributor.author | Cruz, M. | |
| dc.contributor.author | Moura, A. | |
| dc.date.accessioned | 2018-03-12T16:13:21Z | |
| dc.date.available | 2018-03-12T16:13:21Z | |
| dc.date.issued | 2015 | |
| dc.description.abstract | We address a routing/assignment problem posed by Neoturf, which is a Portuguese company working in the area of project, building and garden’s main- tenance. The aim is to define a procedure for scheduling and routing efficiently its clients of garden maintenance services. The company has two teams available throughout the year to handle all the maintenance jobs. Each team consists of two or three employees with a fully-equipped vehicle capable of carrying out every kind of maintenance service. At the beginning of each year, the number and frequency of maintenance interventions to conduct during the year, for each client, are agreed. Time windows are established so that visits to the client should occur only within these periods. There are clients that are supposed to be always served by the same team, but other clients can be served indifferently by any of the two teams. Since clients are geographically spread over a wide region, the total distance traveled while visiting clients is a factor that weighs heavily on the company costs. Neoturf is con- cerned with reducing these costs, while satisfying agreements with its clients. We give a mixed integer linear programming formulation for the problem, discuss lim- itations on the size of instances that can be solved to guarantee optimality, present a modification of the Clarke and Wright heuristic for the vehicle routing with time windows, and report preliminary computational results obtained with Neoturf data. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.doi | 10.1007/978-3-319-20328-7_9 | pt_PT |
| dc.identifier.isbn | 978-3-319-20328-7 | |
| dc.identifier.isbn | 978-3-319-20327-0 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/11095 | |
| dc.language.iso | eng | pt_PT |
| dc.peerreviewed | yes | pt_PT |
| dc.publisher | Springer | pt_PT |
| dc.relation.publisherversion | https://link.springer.com/chapter/10.1007/978-3-319-20328-7_9 | pt_PT |
| dc.subject | Optimization | pt_PT |
| dc.subject | Vehicle routing problem with time windows | pt_PT |
| dc.subject | Mixed integer linear programming | pt_PT |
| dc.subject | Clarke and Wright heuristic | pt_PT |
| dc.title | A Routing/Assignment Problem in Garden Maintenance Services | pt_PT |
| dc.type | preprint | |
| dspace.entity.type | Publication | |
| oaire.awardURI | info:eu-repo/grantAgreement/FCT/5876/UID%2FMAT%2F00144%2F2013/PT | |
| oaire.awardURI | info:eu-repo/grantAgreement/FCT/5876/UID%2FMAT%2F00297%2F2013/PT | |
| oaire.citation.endPage | 155 | pt_PT |
| oaire.citation.startPage | 145 | pt_PT |
| oaire.citation.title | Operational Research. CIM Series in Mathematical Sciences | pt_PT |
| oaire.citation.volume | 4 | pt_PT |
| oaire.fundingStream | 5876 | |
| oaire.fundingStream | 5876 | |
| project.funder.identifier | http://doi.org/10.13039/501100001871 | |
| project.funder.identifier | http://doi.org/10.13039/501100001871 | |
| project.funder.name | Fundação para a Ciência e a Tecnologia | |
| project.funder.name | Fundação para a Ciência e a Tecnologia | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | preprint | pt_PT |
| relation.isProjectOfPublication | 2fa7cef7-d0a1-4dc4-9b61-6d730623423f | |
| relation.isProjectOfPublication | 16230d17-de07-4497-bbf6-1ec991eb90da | |
| relation.isProjectOfPublication.latestForDiscovery | 2fa7cef7-d0a1-4dc4-9b61-6d730623423f |
