A Comparison of Optimization Algorithms for Practical Staff Scheduling Problems in Logistics and Retailing
نویسندگان
چکیده
The current paper uses real-life scenarios of staff scheduling applications to compare the effectiveness and efficiency of two fundamentally different solution approaches. One can be called centralised and is based on search in the solution space with two adapted metaheuristic, namely particle swarm optimization (PSO) and evolution strategy (ES). The second approach, a multi-agent system (MAS), is distributed. PSO and ES outperform MAS. ES often delivers the best overall results in terms of solution quality and is the method of choice, when CPU-time is not limited. MAS is vastly quicker in finding solutions. But the results of MAS are not useful, if the problems are very complex. The results suggest that agents could be an interesting method for real-time scheduling or re-scheduling tasks on problems with less complex constraints.
منابع مشابه
Optimization of a Bi-objective Scheduling for Two Groups of Experienced and Inexperienced Distribution Staff Based on Capillary Marketing
Developing an appropriate plan for distribution department is significant because of its influence on company's other costs and customers' satisfaction. In this study, a new bi-objective mix-integer linear programming model developed for scheduling two groups of experienced and inexperienced distribution staff based on capillary marketingin Pak Pasteurized Dairy Products Company of Guilan provi...
متن کاملA comparison of three heuristics on a practical case of sub-daily staff scheduling
Sub-daily personnel planning, which is the focus of our work offers considerable productivity reserves for companies in certain industries, such as logistics, retail and call centres. However, it also creates complex challenges for the planning software. We compare particle swarm optimisation (PSO), the evolution strategy (ES) and a constructive agent-based heuristic on a set of staff schedulin...
متن کاملA multi-objective resource-constrained optimization of time-cost trade-off problems in scheduling project
This paper presents a multi-objective resource-constrained project scheduling problem with positive and negative cash flows. The net present value (NPV) maximization and making span minimization are this study objectives. And since this problem is considered as complex optimization in NP-Hard context, we present a mathematical model for the given problem and solve three evolutionary algorithms;...
متن کاملA comparison of algorithms for minimizing the sum of earliness and tardiness in hybrid flow-shop scheduling problem with unrelated parallel machines and sequence-dependent setup times
In this paper, the flow-shop scheduling problem with unrelated parallel machines at each stage as well as sequence-dependent setup times under minimization of the sum of earliness and tardiness are studied. The processing times, setup times and due-dates are known in advance. To solve the problem, we introduce a hybrid memetic algorithm as well as a particle swarm optimization algorithm combine...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011