scholarly journals Storage assignment optimization for fishbone robotic mobile fulfillment systems

2022 ◽  
Author(s):  
Yanyan Wang ◽  
Rongjun Man ◽  
Wanmeng Zhao ◽  
Honglin Zhang ◽  
Hong Zhao
Keyword(s):  
Traditional Scheduling ◽  
Adaptive Genetic Algorithm ◽  
Scheduling Problems ◽  
Goods Movement ◽  
Large Size ◽  
Assignment Model ◽  
Proposed Model ◽  
Fitness Value ◽  
Storage Assignment ◽  
Storage Cells

AbstractRobotic Mobile Fulfillment System (RMFS) affects the traditional scheduling problems heavily while operating a warehouse. This paper focuses on storage assignment optimization for Fishbone Robotic Mobile Fulfilment Systems (FRMFS). Based on analyzing operation characteristics of FRMFS, a storage assignment optimization model is proposed with the objectives of maximizing operation efficiency and balancing aisle workload. Adaptive Genetic Algorithm (AGA) is designed to solve the proposed model. To validate the effectiveness of AGA in terms of iteration and optimization rate, this paper designs a variety of scenarios with different task sizes and storage cells. AGA outperforms other four algorithm in terms of fitness value and convergence and has better convergence rate and stability. The experimental results also show the advancement of AGA in large size FRMFS. In conclusion, this paper proposes a storage assignment model for FRMFS to reduce goods movement and travel distance and improve the order picking efficiency.

scholarly journals Economical Speed for Optimizing the Travel Time and Energy Consumption in Train Scheduling using a Fuzzy Multi-Objective Model

2021 ◽  
Author(s):  
Ahmad Reza Jafarian-Moghaddam
Keyword(s):  
Energy Consumption ◽  
Travel Time ◽  
Pollutant Emissions ◽  
Scheduling Problems ◽  
Train Scheduling ◽  
Multi Objective ◽  
Consumption Ratio ◽  
Proposed Model ◽  
Objective Model ◽  
Time And Energy

AbstractSpeed is one of the most influential variables in both energy consumption and train scheduling problems. Increasing speed guarantees punctuality, thereby improving railroad capacity and railway stakeholders’ satisfaction and revenues. However, a rise in speed leads to more energy consumption, costs, and thus, more pollutant emissions. Therefore, determining an economic speed, which requires a trade-off between the user’s expectations and the capabilities of the railway system in providing tractive forces to overcome the running resistance due to rail route and moving conditions, is a critical challenge in railway studies. This paper proposes a new fuzzy multi-objective model, which, by integrating micro and macro levels and determining the economical speed for trains in block sections, can optimize train travel time and energy consumption. Implementing the proposed model in a real case with different scenarios for train scheduling reveals that this model can enhance the total travel time by 19% without changing the energy consumption ratio. The proposed model has little need for input from experts’ opinions to determine the rates and parameters.

Multi-Objective Fleet Assignment Problem Based on Self-Adaptive Genetic Algorithm

2013 ◽  
Vol 694-697 ◽  
pp. 2895-2900 ◽  
Author(s):  
Xiao Yang ◽  
Bo Jiang
Keyword(s):  
Genetic Algorithm ◽  
Carbon Emissions ◽  
Assignment Problem ◽  
Network Capacity ◽  
Total Carbon ◽  
Adaptive Genetic Algorithm ◽  
Multi Objective ◽  
Route Network ◽  
Assignment Model ◽  
Key Factor

Since the beginning of the twenty-first century, energy conservation has become the theme of the development of the world. China government set the emissions-reduction targets in various industries on the 12th Five-Year Plan. And the airlines were committed to reduce their carbon emissions. From an operational perspective, the airline model assignment problem is a key factor of the total carbon emissions on the entire route network. But the traditional aircraft assignment models approach did not account for this purpose to reduce carbon emissions. By constructing the multi-objective optimization models consider carbon emissions assignment model using a genetic algorithm, numerical example shows that the model is able to meet all aspects demand which include meeting route network capacity demand, minimizing operating costs and reducing total aircraft fleet carbon emissions.

A PARTICLE SWARM OPTIMIZATION-BASED ALGORITHM FOR JOB-SHOP SCHEDULING PROBLEMS

2005 ◽  
Vol 02 (03) ◽  
pp. 419-430 ◽  
Author(s):  
H. W. GE ◽  
Y. C. LIANG ◽  
Y. ZHOU ◽  
X. C. GUO
Keyword(s):  
Particle Swarm Optimization ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Particle Swarm ◽  
Traditional Scheduling ◽  
Benchmark Problems ◽  
Scheduling Problems ◽  
Swarm Optimization ◽  
Shop Scheduling ◽  
Novel Concept

A novel particle swarm optimization (PSO)-based algorithm is developed for job-shop scheduling problems (JSSP), which are the most general and difficult issues in traditional scheduling problems. Our goal is to develop an efficient algorithm based on swarm intelligence for the JSSP. Thereafter a novel concept for the distance and velocity of particles in the PSO is proposed and introduced to pave the way for the JSSP. The proposed algorithm effectively exploits the capabilities of distributed and parallel computing systems, with simulation results showing the possibilities of high quality solutions for typical benchmark problems.

scholarly journals Group Scheduling Problems with Time-Dependent and Position-Dependent DeJong’s Learning Effect

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Li Sun ◽  
Lei Ning ◽  
Jia-zhen Huo
Keyword(s):  
Polynomial Time ◽  
Completion Time ◽  
Learning Effect ◽  
Time Dependent ◽  
Total Weighted Completion Time ◽  
Group Scheduling ◽  
Scheduling Problems ◽  
Scheduling Model ◽  
Proposed Model ◽  
Weighted Completion Time

In this paper, we introduce a group scheduling model with time-dependent and position-dependent DeJong’s learning effect. The objectives of scheduling problems are to minimize makespan, the total completion time, and the total weighted completion time, respectively. We show that the problems remain solvable in polynomial time under the proposed model.

The cycle shop scheduling: mathematical model, properties and solution algorithms

2019 ◽  
Vol 53 (1) ◽  
pp. 111-128
Author(s):  
Bahman Naderia ◽  
Sheida Goharib
Keyword(s):  
High Performance ◽  
Scatter Search ◽  
Mixed Integer ◽  
Computational Time ◽  
Neighborhood Search ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Solution Algorithms ◽  
Proposed Model ◽  
Constructive Heuristics

Conventionally, in scheduling problems it is assumed that each job visits each machine once. This paper studies a novel shop scheduling called cycle shop problems where jobs might return to each machine more than once. The problem is first formulated by two mixed integer linear programming models. The characteristics of the problem are analyzed, and it is realized that the problem suffers from a shortcoming called redundancy, i.e., several sequences represents the same schedule. In this regard, some properties are introduced by which the redundant sequences can be recognized before scheduling. Three constructive heuristics are developed. They are based on the shortest processing time first, insertion neighborhood search and non-delay schedules. Then, a metaheuristic based on scatter search is proposed. The algorithms are equipped with the redundancy prevention properties that greatly reduce the computational time of the algorithms. Two sets of experiments are conducted. The proposed model and algorithms are evaluated. The results show the high performance of model and algorithms.

Scenario-Based Integrated Assignment Model for Bi-Class User Rail Transit Networks

2013 ◽  
Vol 361-363 ◽  
pp. 1963-1966
Author(s):  
Wei Zhu
Keyword(s):  
Urban Rail Transit ◽  
Rail Transit ◽  
Transit Networks ◽  
Assignment Model ◽  
Urban Rail ◽  
Proposed Model ◽  
Scale Network ◽  
Algorithm Framework ◽  
Real Scale

An integrated assignment model for urban rail transit (URT) networks was proposed and discussed in four typical scenarios with the consideration of passenger difference between native and non-native. An overall algorithm framework for the model was also developed, which introduced three critical route choice models and combined them appropriately to different scenarios. A case study was performed on a real-scale network of Shanghai during the Expo 2010. The results revealed that the proposed model can deliver more appropriate solution to the assignment problem compared to the existing practice in the real world.

scholarly journals An Enhanced Discrete Bees Algorithm for Resource Constrained Optimization Problems

2019 ◽  
Vol 22 (64) ◽  
pp. 123-134
Author(s):  
Mohamed Amine Nemmich ◽  
Fatima Debbat ◽  
Mohamed Slimane
Keyword(s):  
Project Scheduling ◽  
Optimization Problems ◽  
Solution Space ◽  
Bees Algorithm ◽  
Problem Instance ◽  
Scheduling Problem ◽  
Scheduling Problems ◽  
Resource Constrained ◽  
Proposed Model ◽  
Project Scheduling Problem

In this paper, we propose a novel efficient model based on Bees Algorithm (BA) for the Resource-Constrained Project Scheduling Problem (RCPSP). The studied RCPSP is a NP-hard combinatorial optimization problem which involves resource, precedence, and temporal constraints. It has been applied to many applications. The main objective is to minimize the expected makespan of the project. The proposed model, named Enhanced Discrete Bees Algorithm (EDBA), iteratively solves the RCPSP by utilizing intelligent foraging behaviors of honey bees. The potential solution is represented by the multidimensional bee, where the activity list representation (AL) is considered. This projection involves using the Serial Schedule Generation Scheme (SSGS) as decoding procedure to construct the active schedules. In addition, the conventional local search of the basic BA is replaced by a neighboring technique, based on the swap operator, which takes into account the specificity of the solution space of project scheduling problems and reduces the number of parameters to be tuned. The proposed EDBA is tested on well-known benchmark problem instance sets from Project Scheduling Problem Library (PSPLIB) and compared with other approaches from the literature. The promising computational results reveal the effectiveness of the proposed approach for solving the RCPSP problems of various scales.

Sign in / Sign up

Export Citation Format

Share Document