Computational study for workforce scheduling and routing problems
We present a computational study on 112 instances of the Workforce Scheduling and Routing Problem (WSRP). This problem has applications in many service provider industries where employees visit customers to perform activities. Given their similarity, we adapt a mathematical programming model from th...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Scipress
2014
|
| Subjects: | |
| Online Access: | https://eprints.nottingham.ac.uk/31326/ |
| _version_ | 1848794177794473984 |
|---|---|
| author | Castillo-Salazar, J. Arturo Landa-Silva, Dario Qu, Rong |
| author_facet | Castillo-Salazar, J. Arturo Landa-Silva, Dario Qu, Rong |
| author_sort | Castillo-Salazar, J. Arturo |
| building | Nottingham Research Data Repository |
| collection | Online Access |
| description | We present a computational study on 112 instances of the Workforce Scheduling and Routing Problem (WSRP). This problem has applications in many service provider industries where employees visit customers to perform activities. Given their similarity, we adapt a mathematical programming model from the literature on vehicle routing problem with time windows (VRPTW) to conduct this computational study on the WSRP. We generate a set of WSRP instances from a well-known VRPTW data set. This work has three objectives. First, to investigate feasibility and optimality on a range of medium size WSRP instances with different distribution of visiting locations and including teaming and connected activities constraints. Second, to compare the generated WSRP instances to their counterpart VRPTW instances with respect to their difficulty. Third, to determine the computation time required by a mathematical programming solver to find feasible solutions for the generated WSRP instances. It is observed that although the solver can achieve feasible solutions for some instances, the current solver capabilities are still limited. Another observation is the WSRP instances present an increased degree of difficulty because of the additional constraints. The key contribution of this paper is to present some test instances and corresponding benchmark study for the WSRP. |
| first_indexed | 2025-11-14T19:12:03Z |
| format | Conference or Workshop Item |
| id | nottingham-31326 |
| institution | University of Nottingham Malaysia Campus |
| institution_category | Local University |
| last_indexed | 2025-11-14T19:12:03Z |
| publishDate | 2014 |
| publisher | Scipress |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | nottingham-313262020-05-04T20:16:14Z https://eprints.nottingham.ac.uk/31326/ Computational study for workforce scheduling and routing problems Castillo-Salazar, J. Arturo Landa-Silva, Dario Qu, Rong We present a computational study on 112 instances of the Workforce Scheduling and Routing Problem (WSRP). This problem has applications in many service provider industries where employees visit customers to perform activities. Given their similarity, we adapt a mathematical programming model from the literature on vehicle routing problem with time windows (VRPTW) to conduct this computational study on the WSRP. We generate a set of WSRP instances from a well-known VRPTW data set. This work has three objectives. First, to investigate feasibility and optimality on a range of medium size WSRP instances with different distribution of visiting locations and including teaming and connected activities constraints. Second, to compare the generated WSRP instances to their counterpart VRPTW instances with respect to their difficulty. Third, to determine the computation time required by a mathematical programming solver to find feasible solutions for the generated WSRP instances. It is observed that although the solver can achieve feasible solutions for some instances, the current solver capabilities are still limited. Another observation is the WSRP instances present an increased degree of difficulty because of the additional constraints. The key contribution of this paper is to present some test instances and corresponding benchmark study for the WSRP. Scipress 2014 Conference or Workshop Item PeerReviewed Castillo-Salazar, J. Arturo, Landa-Silva, Dario and Qu, Rong (2014) Computational study for workforce scheduling and routing problems. In: 3rd International Conference on Operations Research and Enterprise Systems (ICORES 2014), 6-8 March, 2014, Angers, Loire Valley, France. personnel scheduling vehicle routing exact algorithms mathematical programming http://www.scitepress.org/DigitalLibrary/Link.aspx?doi=10.5220/0004833904340444 |
| spellingShingle | personnel scheduling vehicle routing exact algorithms mathematical programming Castillo-Salazar, J. Arturo Landa-Silva, Dario Qu, Rong Computational study for workforce scheduling and routing problems |
| title | Computational study for workforce scheduling and routing problems |
| title_full | Computational study for workforce scheduling and routing problems |
| title_fullStr | Computational study for workforce scheduling and routing problems |
| title_full_unstemmed | Computational study for workforce scheduling and routing problems |
| title_short | Computational study for workforce scheduling and routing problems |
| title_sort | computational study for workforce scheduling and routing problems |
| topic | personnel scheduling vehicle routing exact algorithms mathematical programming |
| url | https://eprints.nottingham.ac.uk/31326/ https://eprints.nottingham.ac.uk/31326/ |