Truck Dock Assignment Problem with Operational Time Constraint Within Crossdocks

2006 ◽  
pp. 262-271 ◽  
Author(s):  
Andrew Lim ◽  
Hong Ma ◽  
Zhaowei Miao
Keyword(s):  
Assignment Problem ◽  
Time Constraint ◽  
Operational Time

scholarly journals A note on ’Variable neighborhood search based algorithms for crossdock truck assignment’

2021 ◽  
Author(s):  
Shahin Gelareh
Keyword(s):  
Assignment Problem ◽  
Operational Research ◽  
Variable Neighborhood Search ◽  
Time Constraint ◽  
Neighborhood Search ◽  
Operational Time

Some implementations of variable neighborhood search based algorithms were presented in C´ecilia Daquin, Hamid Allaoui, Gilles Goncalves and Tient´e Hsu, Variable neighborhood search based algorithms for crossdock truck assignment, RAIRO-Oper. Res., 55 (2021) 2291-2323. This work is based on model in Zhaowei Miao, Andrew Lim, Hong Ma, Truck dock assignment problem with operational time constraint within crossdocks, European Journal of Operational Research 192 (1), 2009, 105-115 (see Miao et al. (2009)) which has been proven to be incorrect. We reiterate and elaborate on the deficiencies in the latter and show that the authors in the former were already aware of the deficiencies in the latter and the proposed minor amendment does not overcome any of such deficiencies.

A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints

2016 ◽  
Vol 249 (3) ◽  
pp. 1144-1152 ◽  
Author(s):  
Shahin Gelareh ◽  
Rahimeh Neamatian Monemi ◽  
Frédéric Semet ◽  
Gilles Goncalves
Keyword(s):  
Assignment Problem ◽  
Branch And Cut ◽  
Time Constraints ◽  
Operational Time

scholarly journals Optimization of Personnel Cost in Aircrew Assignment Problem using a Simple Fuzzy Logic Approach

MENDEL ◽  
2017 ◽  
Vol 23 (1) ◽  
pp. 133-140
Author(s):  
Novriana Sumarti ◽  
Ferdyanto Chandra ◽  
Jeremy Minardi
Keyword(s):  
Fuzzy Logic ◽  
Assignment Problem ◽  
Cost Optimization ◽  
Time Constraint ◽  
Optimization Process ◽  
Personnel Cost ◽  
Data Set ◽  
Final Destination ◽  
Fuzzy Logic Approach ◽  
Logic Approach

In aviation industries, the aircrew assignment problem is one of the most important factors in total operational cost optimization. This problem will be solved in two steps: flight pairing and aircrew scheduling. The constraints to be satisfied in flight pairing include having the same airport for first departure and final destination, and the limitations of flying time, duty time and transit time. The optimization process results in optimal flight pairings that minimize the number of personnel needed to serve a flight schedule over a given period of time. Further optimization is needed to obtain a schedule in which an aircrew team can serve a rotation with the largest possible number of pairings on the condition that all constraints are fulfilled. For aircrew scheduling, there are constraints on flying time, resting time, total number of takeoffs, and number of holidays and workdays. The investigated optimization process was designed to get optimal rotations along with maximum total personnel cost reduction. The data set used in this research is a one-month full flight schedule from a big airline in Indonesia. A simple fuzzy logic approach was used to find a new flying time constraint in order to optimize personnel cost and evenly distribute the assignments. The results show that the new optimal flying time constraint can reduce personnel cost up to 5.07% per month, so it can yield significant savings on a yearly basis.

Sign in / Sign up

Export Citation Format

Share Document