Ana Moura
580 California St., Suite 400
San Francisco, CA, 94104
A Routing/Assignment Problem in Garden Maintenance Services
2015, CIM Series in Mathematical Sciences
https://doi.org/10.1007/978-3-319-20328-7_9
Sign up for access to the world's latest research
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 maintenance. 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 concerned with reducing these costs, while satisfying agreements with its clients. We give a mixed integer linear programming formulation for the problem, discuss limitations 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.
References (12)
- AMPL modelling language, March 2013 Available online at:http://www.ampl.com/
- Ascheuer, N., Fischetti, M., and Grötschel, M.: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Mathematical Programming, Ser. A 90 475- 506 (2001)
- Bräysy, O. and Gendreau, M.: Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science 39(1) 104-118 (2005)
- Clarke, G. and Wright, J. W.: Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research, 12(4) 568-581 (1964)
- Desaulniers, G., Madsen, O B. G. and Ropke, S.: Vehicle routing problems with time windows. In P. Toth and D. Vigo (eds.), Vehicle routing: Problems, methods, and applications, second edition, MOS-SIAM Series on Optimization, SIAM, Philadelphia, 119-159 (2014)
- Golden, B. L., Raghavan, S. and Wasil, E. A.: The Vehicle Routing Problem: Latest Advances and New Challenges, Springer, New York, (2008)
- Hopcroft, J. E., Karp, R. M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2(4) 225-231 (1973)
- Kumar, S. N. and Panneerselvam, R.: A Survey on the Vehicle Routing Problem and Its Vari- ants. Intelligent Information Management 4 66-74 (2012)
- MATLAB, The MathWorks, Inc., Natick, Massachusetts, United States. http://www. mathworks.com/products/matlab/
- NEOS Server, March 2013 Available online at: http://www.neos-server.org/
- Toth, P. and Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathe- matics and Applications, Philadelphia (2002)
- Toth, P. and Vigo, D.: Vehicle Routing: Problems, Methods, and Applications, second edition. MOS-SIAM Series on Optimization, SIAM, Philadelphia (2014)