LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Castillo-Salazar, J. Arturo; Landa-Silva, Dario; Qu, Rong (2014)
Publisher: Scipress
Languages: English
Types: Unknown
Subjects:
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.
  • No references.
  • No related research data.
  • No similar publications.

Share - Bookmark

Download from

Cite this article