Scheduling multi-skilled manpower with considering teams replacement and site-dependent vehicles routing (Q2204273)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling multi-skilled manpower with considering teams replacement and site-dependent vehicles routing |
scientific article |
Statements
Scheduling multi-skilled manpower with considering teams replacement and site-dependent vehicles routing (English)
0 references
15 October 2020
0 references
Summary: In this paper, a combined manpower-vehicle routing problem (CMVRP) is presented that a central depot is considered in which a set of vehicles and a set of multi-skilled teams originate from it to move toward each customer's site for servicing tasks. This problem deals with scheduling of multi-skilled manpower to service a set of tasks with due dates and at the same, routing of the vehicles which are used for moving this manpower. Teams are in different range of competency that it will affect the service time duration. Vehicles are in different moving speeds and costs and not all the vehicles are capable to move toward all the customers' sites. The objective is to find an efficient schedule for the teams and vehicles movement in order to minimise the total cost of servicing, routing and lateness penalties. In this paper, a mixed integer programming model is presented and two meta-heuristics approaches of genetic algorithm (GA) and particle swarm optimisation (PSO) are developed to solve the generated problems. Furthermore, Taguchi experimental design method is applied to set the proper values of parameters. The available results show the higher performance of proposed GA compared with PSO, in quality of solutions within comparatively shorter periods of time.
0 references
vehicle routing problem
0 references
VRP
0 references
team competence
0 references
genetic algorithms
0 references
particle swarm optimisation
0 references
PSO
0 references
scheduling
0 references
multi-skilled teams
0 references
team replacement
0 references
site-dependent vehicle routing
0 references
due dates
0 references
servicing costs
0 references
routing costs
0 references
lateness penalties
0 references
mixed integer programming
0 references
MIP
0 references
metaheuristics
0 references
Taguchi methods
0 references
experimental design
0 references