Optimizing Shift Scheduling for Tank Trucks Using an Effective Stochastic Variable Neighbourhood Approach
In this contribution we introduce the application of a stochastic variable neighbourhood algorithm in order to solve a problem taken from a real world situation faced by a small oil company. The problem at hand is an optimization problem and relates to shift scheduling of tank trucks. Input data consists of a set of tank trucks with different properties along with a set of drivers having different driving skills. The objective is to establish a one-to-one assignment between the set of available drivers and the set of tank trucks shifts so as all related hard and soft constraints are satisfied and the tank truck shifts are optimized. This specific problem has been already addressed at the literature and some encouraging results have been published (Knust and Schumacher, 2011). Nevertheless, the optimization algorithm proposed in current contribution manages to achieve better solutions for all but one instance among thirty of them in the same reasonable amount of computational time.
Disclaimer/Regarding indexing issue:
We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.