Abstract
Implementation concepts of a decision support system for large-scale periodic time-dependent vehicle routing and scheduling problems with complex constraints supporting planning and management of mobile personnel tasks (sales representatives and others) are discussed. Complex nonuniform constraints with respect to frequency, time windows, working time, etc. are taken into account with additional fast adaptive procedures for operational rescheduling of plans in presence of various disturbances. Five individual solution quality indicators with respect to a single personnel person are considered. This paper deals with modeling issues corresponding to the problem and general solution concepts.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Angelelli, E., Bianchessi, N., Mansini, R., Speranza, M.G.: Short term strategies for a dynamic multi-period routing problem. Transp. Res. Part C Emerg. Technol. 17(2), 106–119 (2009)
Angelelli, E., Speranza, M.G.: The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137(2), 233–247 (2002)
Campbell, A.M., Wilson, J.H.: Forty years of periodic vehicle routing. Networks 63(1), 2–15 (2014)
Černý, V.: Thermodynamical approach to traveling salesman problem: an efficient simulation algorithm. J. Optim. Theor. Appl. 45, 41–51 (1985)
Belhaiza, S., Hansen, P., Laporte, G.: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Comput. Oper. Res. 52, 269–281 (2014)
Favaretto, D., Moretti, E., Pellegrini, P.: Ant colony system for a VRP with multiple time windows and multiple visits. J. Interdisc. Math. 10(2), 263–284 (2007)
Francis, P., Smilowitz, K.: Modeling techniques for periodic vehicle routing problems. Transp. Res. Part B Methodol. 40(10), 872–884 (2010)
Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195(3), 791–802 (2009)
Hurkała, J.: Time-dependent traveling salesman problem with multiple time windows. In: Ganzha, M., Maciaszek, L., Paprzycki, M. (eds.) Position Papers of the 2015 Federated Conference on Computer Science and Information Systems, ACSIS 6, pp. 71–78 (2015)
Hurkała, J., Hurkała, A.: Effective design of the simulated annealing algorithm for the flowshop problem with minimum makespan criterion. J. Telecommun. Inf. Technol. 2, 92–98 (2012)
Hurkała, J., Śliwiński, T.: Threshold accepting heuristic for fair flow optimization in wireless mesh networks. J. Appl. Math., 1–11 (2014). Article ID 108673
Jong C., Kant, G., van Vliet, A.: On finding minimal route duration in the vehicle routing problem with multiple time windows, Department of Computer Science, Utrecht University, Technical report TR-120-96 (1996)
Kirkpatrick, S., Gellat, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Lee, D.S., Vassiliadis, V.S., Park, J.M.: List-based threshold-accepting algorithm for zero-wait scheduling of multiproduct batch plants. Ind. Eng. Chem. Res. 41(25), 6579–6588 (2002)
Lee, D.S., Vassiliadis, V.S., Park, J.M.: A novel thresholdaccepting meta-heuristic for the job-shop scheduling problem. Comput. Oper. Res. 31, 2199–2213 (2004)
Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)
SATIS GPS (2016). http://satisgps.com/
Savelsbergh, M.W.P.: The vehicle routing problem with time windows: minimizing route duration. ORSA J. Comput. 4(2), 146–161 (1992)
Souffriau, W., Vansteenwegen, P., Berghe, G.V., van Oudheusden, D.: The multi-constraint team orienteering problem with multiple time windows. Transp. Sci. 47(1), 53–63 (2013)
Tarantilis, C.D., Kiranoudis, C.T., Vassiliadis, V.S.: A list based threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. J. Oper. Res. Soc. 54, 65–71 (2003)
Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM, Philadelphia (2002)
Tricoire, F., Romauch, M., Doerner, K.F., Hartl, R.F.: Heuristics for the multi-period orienteering problem with multiple time windows. Comput. Oper. Res. 37, 351–367 (2010)
Acknowledgements
This research was financed by the European Union through the European Regional Development Fund under the Operational Programme “Innovative Economy” for the years 2007–2013; Priority 1 Research and development of modern technologies under the project POIG.01.03.01-14-076/12: “Decision Support System for Large-Scale Periodic Vehicle Routing and Scheduling Problems with Complex Constraints.”
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Ogryczak, W., Śliwiński, T., Hurkała, J., Kaleta, M., Pałka, P., Kozłowski, B. (2018). Large-Scale Periodic Routing Problems for Supporting Planning of Mobile Personnel Tasks. In: Atanassov, K., et al. Uncertainty and Imprecision in Decision Making and Decision Support: Cross-Fertilization, New Models and Applications. IWIFSGN 2016. Advances in Intelligent Systems and Computing, vol 559. Springer, Cham. https://doi.org/10.1007/978-3-319-65545-1_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-65545-1_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-65544-4
Online ISBN: 978-3-319-65545-1
eBook Packages: EngineeringEngineering (R0)