Selection of a fleet of vehicles for tasks based on the statistical characteristics of their operational parameters
Open Access
- 21 May 2022
- journal article
- research article
- Published by Polskie Naukowo-Techniczne Towarzystwo Eksploatacyjne in Eksploatacja i Niezawodność – Maintenance and Reliability
- Vol. 24 (3) , 407-418
Abstract
The article presents a method of selecting a fleet of vehicles with a homogeneous structure for tasks based on the statistical characteristics of their operational parameters. The selection of a vehicle fleet for tasks is one of the stages of vehicle fleet management in transport companies. The selection of a vehicle fleet for tasks has been defined as the allocation of a vehicle model to a given company, which is associated with the unification of the vehicle fleet to one specific type. The problem of selecting a fleet of vehicles has been presented in a multi-criteria approach. The operational parameters assessing the selection of vehicles for the tasks are mileage and the number of days to the first and subsequent failure, and vehicle maintenance costs. The developed method of selecting a fleet of vehicles for the tasks consists of two stages. In the first stage, the average operating parameter values are determined using statistical inference. In the second stage, using the MAJA method, a unified model of the fleet of vehicles operating in the enterprise is established.Keywords
This publication has 36 references indexed in Scilit:
- Solving Vehicle Assignment Problem Using Evolutionary Computation2010
- Maintenance and reliability analysis of a fleet of load-haul-dump vehicles in an underground hard rock mineInternational Journal of Mining, Reclamation and Environment, 2009
- Assignment problems: A golden anniversary surveyEuropean Journal of Operational Research, 2007
- Multiple-Depot Integrated Vehicle and Crew SchedulingTransportation Science, 2005
- A guide to vehicle routing heuristicsJournal of the Operational Research Society, 2002
- Simultaneous Vehicle and Crew Scheduling in Urban Mass Transit SystemsTransportation Science, 2001
- A genetic algorithm for the generalised assignment problemComputers & Operations Research, 1997
- Heuristics for the generalised assignment problem: simulated annealing and tabu search approachesOR Spectrum, 1995
- The smallest networks on which the Ford-Fulkerson maximum flow procedure may fail to terminateTheoretical Computer Science, 1995
- Categorized Assignment Scheduling: a Tabu Search ApproachJournal of the Operational Research Society, 1993