A unique hybrid particle swarm optimisation algorithm for simulation and improvement of crew scheduling problem

DOI10.1504/IJOR.2012.046225MaRDI QIDQ2627273zbMATH OpenOpenAlexFDO

Authors Ghazal Asadipour, Hesam Eivazy, Salman Nazari-Shirkouhi, Ali Azadeh

Publication date 31 May 2017

Published in International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/ijor.2012.046225

zbMATH Keywords

crew schedulingevaluationflight crewsparticle swarm optimisationPSOscheduling improvementsimulation

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: The crew scheduling problem is a set covering or set partitioning problem. It schedules the crew members so that all flights are covered, while the cost is minimised. The crew scheduling is an non-deterministic polynomial-time hard constrained combinatorial optimisation problem, so it cannot be exactly solved in a reasonable computation time. This paper presents a particle swarm optimisation (PSO) algorithm for simulating and solving the crew scheduling problem. The proposed algorithm is extended from the discrete version of PSO. By applying PSO to the crew scheduling problem, the cost is improved when compared with other well-known algorithms. This is the first study that introduces PSO for simulation and optimisation of the crew scheduling problem.

Recommendations

• A hybrid particle swarm optimization algorithm for job-shop scheduling problem
• An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study
• A particle swarm optimization algorithm for job-shop scheduling problem
• A particle swarm optimization-based algorithm for job-shop scheduling problems
• An improved particle swarm optimization algorithm for flowshop scheduling problem
• A hybrid particle swarm optimization algorithm for the permutation flowshop scheduling problem
• Hybrid Particle Swarm Optimizers in the Single Machine Scheduling Problem: An Experimental Study
• A Constructive Hybrid Algorithm for Crew Pairing Optimization
• A hybrid particle swarm optimization and simulated annealing algorithm for the job shop scheduling problem with transport resources

Cited in

(3)

• An improved particle swarm optimization algorithm to solve hybrid flowshop scheduling problems with the effect of human factors -- a case study
• Solving a large-scale integrated fleet assignment and crew pairing problem
• Optimizing schedules of rail train circulations by tabu search algorithm

This page was built for publication: A unique hybrid particle swarm optimisation algorithm for simulation and improvement of crew scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2627273)