A variable neighborhood search approach for the crew pairing problem

Alba Agustín; Ángel A. Juan; Eduardo G. Pardo

doi:10.1016/j.endm.2017.03.012

ScienceGate Book Chapters

JOURNAL ARTICLE

A variable neighborhood search approach for the crew pairing problem

Alba Agustín Ángel A. Juan Eduardo G. Pardo

Year: 2017 Journal: Electronic Notes in Discrete Mathematics Vol: 58 Pages: 87-94 Publisher: Elsevier BV

DOI: 10.1016/j.endm.2017.03.012

Get Full-Text PDF Get Analytical Report

Keywords:

Crew Crew scheduling Variable neighborhood search Variable (mathematics) Computer science Scheduling (production processes) Set cover problem Set (abstract data type) Mathematical optimization Operations research Mathematics Metaheuristic Engineering Aeronautics

Metrics

Cited By

0.94

FWCI (Field Weighted Citation Impact)

Refs

0.78

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Vehicle Routing Optimization Methods

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Transportation and Mobility Innovations

Physical Sciences → Engineering → Automotive Engineering

Scheduling and Timetabling Solutions

Social Sciences → Decision Sciences → Management Science and Operations Research

A variable neighborhood search approach for the crew pairing problem

Metrics

Citation History

Topics

Related Documents

Variable Neighborhood Search Approach to Community Detection Problem

MaxMinMin p-dispersion problem: A variable neighborhood search approach

A variable neighborhood search approach for the vertex bisection problem

A Variable Neighborhood Search Approach for the S-labeling Problem

General variable neighborhood search approach to group steiner tree problem