An employee transporting problem
نویسنده
چکیده مقاله:
An employee transporting problem is described and a set partitioning model is developed. An investigation of the model leads to a knapsack problem as a surrogate problem. Finding a partition corresponding to the knapsack problem provides a solution to the problem. An exact algorithm is proposed to obtain a partition (subset-vehicle combination) corresponding to the knapsack solution. It requires testing and matching too many alternatives to obtain a partition. The sweep algorithm is implemented in obtaining a partition (subset-vehicle combination) in an efficient manner. Illustrations are provided to show how the algorithms obtain solutions.
منابع مشابه
Cut generation for an employee timetabling problem
Motivated by an industrial application, we study a specific employee timetabling problem. Several investigations are being conducted: a lower bound by Lagrangian relaxation, a heuristic based on a cut generation process and an exact method by Benders decomposition. Experimental results on real and generated instances are reported.
متن کاملA Bayesian stochastic programming approach to an employee scheduling problem
Bayesian forecasting models provide distributional estimates for random parameters, and relative to classical schemes, have the advantage that they can rapidly capture changes in nonstationary systems using limited historical data. Unlike deterministic optimization, stochastic programs explicitly incorporate distributions for random parameters in the model formulation, and thus have the advanta...
متن کاملDealing with the problem of employee turnover.
Employee turnover is expensive, costing American industry billions of dollars every year. It strikes operations of all sizes and is not any less devastating in the public sector than it is in the private sector. These financial costs can be classified as both direct (additional fees for recruitment, steeper assessments for unemployment taxes, and the rising expenses of payroll administration fo...
متن کاملReal - Life Employee Timetabling Problem : Instance Example
This technical report focuses on a concrete instance of the real-life employee timetabling problem presented in the paper “Applying CP(FD), CLP(FD) and CFLP(FD) to a Real-Life Employee Timetabling Problem”. It provides additional material that would help the reader of the paper in both understanding the algorithm proposed as well as the code of the models provided online.
متن کاملTransporting an Image through a Subwavelength Hole.
The manipulation of optical waves in the subwavelength scale is limited by diffraction. In the vicinity of a narrow aperture, the amplitude of the electric field is approximately uniform and the transmissivity is extremely low. Here we show that despite these fundamental constraints it may be possible to transport and redirect a complex electromagnetic image through a tiny subwavelength hole wi...
متن کاملThe general employee scheduling problem. An integration of MS and AI
The general employee scheduling problem extends the standard shift scheduling problem by discarding key limitations such as employee homogeneity and the absence of connections across time period blocks. The resulting increased generality yields a scheduling model that applies to real world problems confronted in a wide variety of areas. The price of the increased generality is a marked increase...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 9 شماره 1
صفحات -
تاریخ انتشار 2013-12-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023