A Research for Scheduling Model of Vehicles in Warehouses Based on Genetic Algorithm

Author(s):  
Wang You-Zhao ◽  
Peng Yu-Xiang ◽  
Guo Xiao-Xi
JOURNAL ASRO ◽  
2019 ◽  
Vol 10 (2) ◽  
pp. 1
Author(s):  
Aris Tri Ika R ◽  
Benny Sukandari ◽  
Okol Sri Suharyo ◽  
Ayip Rivai Prabowo

Navy as a marine core in the defense force is responsible for providing security for realizing stability and security of the country.  At any time there was an invasion of other countries past through sea,  TNI AL must be able to break the enemy resistance line through a sea operation to obtain the sea superiority. But this time the endurance of Striking force Unit at only 7-10 days and required replenishment at sea to maximize the presence in the theater of operations to meet a demand of the logistics: HSD, Freshwater, Lubricating Oil, foodstuffs and amonisi. For the optimal replenishment at sea required scheduling model supporting unit to get the minimum time striking force unit was on node rendezvous. Replenishment at sea scheduling model for striking force unit refers to the problems Vehicle routing problem with time windows using Genetic Algorithms. These wheelbase used is roulette for reproduction, crossover, and mutation of genes. Genetic algorithms have obtained optimum results in the shortest route provisioning scenario uses one supporting unit with a total time of 6.89 days. In scenario two supporting unit with minimal time is 4.97 days. In the scenario, the changing of the node replenishment Genetic Algorithm also get optimal time is 4.97 days with two supporting units. Research continued by changing the parameters of the population, the probability of crossover and mutation that can affect the performance of the genetic algorithm to obtain the solution. Keywords: Genetic Algorithm, Model Scheduling, Striking Force unit


Author(s):  
Ismail M. Ali ◽  
Karam M. Sallam ◽  
Nour Moustafa ◽  
Ripon Chakraborty ◽  
Michael J. Ryan ◽  
...  

2015 ◽  
Vol 2015 ◽  
pp. 1-20 ◽  
Author(s):  
Xuejun Zhai ◽  
Xiaonan Niu ◽  
Hong Tang ◽  
Lixin Wu ◽  
Yonglin Shen

Earth observation satellites play a significant role in rapid responses to emergent events on the Earth’s surface, for example, earthquakes. In this paper, we propose a robust satellite scheduling model to address a sequence of emergency tasks, in which both the profit and robustness of the schedule are simultaneously maximized in each stage. Both the multiobjective genetic algorithm NSGA2 and rule-based heuristic algorithm are employed to obtain solutions of the model. NSGA2 is used to obtain a flexible and highly robust initial schedule. When every set of emergency tasks arrives, a combined algorithm called HA-NSGA2 is used to adjust the initial schedule. The heuristic algorithm (HA) is designed to insert these tasks dynamically to the waiting queue of the initial schedule. Then the multiobjective genetic algorithm NSGA2 is employed to find the optimal solution that has maximum revenue and robustness. Meanwhile, to improve the revenue and resource utilization, we adopt a compact task merging strategy considering the duration of task execution in the heuristic algorithm. Several experiments are used to evaluate the performance of HA-NSGA2. All simulation experiments show that the performance of HA-NSGA2 is significantly improved.


2014 ◽  
Vol 2014 ◽  
pp. 1-16 ◽  
Author(s):  
Komgrit Leksakul ◽  
Sukrit Phetsawat

This study applied engineering techniques to develop a nurse scheduling model that, while maintaining the highest level of service, simultaneously minimized hospital-staffing costs and equitably distributed overtime pay. In the mathematical model, the objective function was the sum of the overtime payment to all nurses and the standard deviation of the total overtime payment that each nurse received. Input data distributions were analyzed in order to formulate a simulation model to determine the optimal demand for nurses that met the hospital’s service standards. To obtain the optimal nurse schedule with the number of nurses acquired from the simulation model, we proposed a genetic algorithm (GA) with two-point crossover and random mutation. After running the algorithm, we compared the expenses and number of nurses between the existing and our proposed nurse schedules. For January 2013, the nurse schedule obtained by GA could save 12% in staffing expenses per month and 13% in number of nurses when compare with the existing schedule, while more equitably distributing overtime pay between all nurses.


2012 ◽  
Vol 253-255 ◽  
pp. 1330-1334
Author(s):  
Song Gao ◽  
Pei Pei Zhang ◽  
De Rong Tan ◽  
Xiao Lin Zhang

Electric bus is different from traditional bus. Its operation scheduling is constrained by the charge time, discharge time and driving range. On the base of full consideration of the electric bus driving range and charging time, the electric bus scheduling model is built. Then a genetic algorithm is selected to solve the model. Finally, an electric bus route in Zibo City is taken as an example, to adopt modeling and solving. The results verify the applicability of the model and algorithm.


Sign in / Sign up

Export Citation Format

Share Document