Vehicle Scheduling Model for Fresh Agriculture Products Pickup with Uncertain Demands

2014 ◽  
Vol 974 ◽  
pp. 282-287
Author(s):  
Li Xia Rong ◽  
Huan Bin Sha
Keyword(s):  
Genetic Algorithm ◽  
Hybrid Genetic Algorithm ◽  
Optimal Solution ◽  
Vehicle Scheduling ◽  
Uncertain Measure ◽  
Uncertainty Distribution ◽  
Uncertain Variables ◽  
Scheduling Model ◽  
Agriculture Products ◽  
The Impact

A chance-constrained vehicle scheduling model for fresh agriculture products pickup with uncertain demands is proposed in this paper. The uncertain measure that vehicle loading will not exceed capacity constraint is presented in the model because of the uncertainty of demands. Based on uncertainty theory, when the demands are some special uncertain variables with uncertainty distribution such as linear, zigzag and normal uncertain distribution etc., the model can be transformed to a deterministic form and solved by genetic algorithm. When the demands are general uncertain variables, a hybrid genetic algorithm with uncertain simulation is presented to obtain the optimal solution. At last, to illustrate the effective of the model and algorithm, and to analyze the impact of parameters on model solution, an experiment is provided.

Applying Genetic Algorithm to Resource Constrained Multi-Project Scheduling Problems

2009 ◽  
Vol 419-420 ◽  
pp. 633-636 ◽  
Author(s):  
James C. Chen ◽  
Wun Hao Jaong ◽  
Cheng Ju Sun ◽  
Hung Yu Lee ◽  
Jenn Sheng Wu ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Project Scheduling ◽  
Hybrid Genetic Algorithm ◽  
Optimal Solution ◽  
Total Tardiness ◽  
Scheduling Problems ◽  
Test Bed ◽  
Resource Constrained ◽  
Multiple Resources ◽  
Practical Constraints

Resource-constrained multi-project scheduling problems (RCMPSP) consider precedence relationship among activities and the capacity constraints of multiple resources for multiple projects. RCMPSP are NP-hard due to these practical constraints indicating an exponential calculation time to reach optimal solution. In order to improve the speed and the performance of problem solving, heuristic approaches are widely applied to solve RCMPSP. This research proposes Hybrid Genetic Algorithm (HGA) and heuristic approach to solve RCMPSP with an objective to minimize the total tardiness. HGA is compared with three typical heuristics for RCMPSP: Maximum Total Work Content, Earliest Due Date, and Minimum Slack. Two typical RCMPSP from literature are used as a test bed for performance evaluation. The results demonstrate that HGA outperforms the three heuristic methods in term of the total tardiness.

scholarly journals Hybrid Genetic Algorithm and Simulated Annealing for Function Optimization

2017 ◽  
Vol 1 (2) ◽  
pp. 82 ◽  
Author(s):  
Tirana Noor Fatyanosa ◽  
Andreas Nugroho Sihananto ◽  
Gusti Ahmad Fanshuri Alfarisy ◽  
M Shochibul Burhan ◽  
Wayan Firdaus Mahmudy
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Optimization Problems ◽  
Linear Optimization ◽  
Hybrid Genetic Algorithm ◽  
Optimal Solution ◽  
Function Optimization ◽  
Non Linear ◽  
Speed Up ◽  
Linear Problems

The optimization problems on real-world usually have non-linear characteristics. Solving non-linear problems is time-consuming, thus heuristic approaches usually are being used to speed up the solution’s searching. Among of the heuristic-based algorithms, Genetic Algorithm (GA) and Simulated Annealing (SA) are two among most popular. The GA is powerful to get a nearly optimal solution on the broad searching area while SA is useful to looking for a solution in the narrow searching area. This study is comparing performance between GA, SA, and three types of Hybrid GA-SA to solve some non-linear optimization cases. The study shows that Hybrid GA-SA can enhance GA and SA to provide a better result

scholarly journals Robust Satellite Scheduling Approach for Dynamic Emergency Tasks

2015 ◽  
Vol 2015 ◽  
pp. 1-20 ◽  
Author(s):  
Xuejun Zhai ◽  
Xiaonan Niu ◽  
Hong Tang ◽  
Lixin Wu ◽  
Yonglin Shen
Keyword(s):  
Genetic Algorithm ◽  
Heuristic Algorithm ◽  
Optimal Solution ◽  
Simulation Experiments ◽  
Multiobjective Genetic Algorithm ◽  
Scheduling Model ◽  
Rapid Responses ◽  
Earth Observation Satellites ◽  
Satellite Scheduling ◽  
Combined Algorithm

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.

scholarly journals Optimal Solution for VLSI Physical Design Automation Using Hybrid Genetic Algorithm

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
I. Hameem Shanavas ◽  
R. K. Gnanamurthy
Keyword(s):  
Genetic Algorithm ◽  
Evolutionary Algorithm ◽  
Design Automation ◽  
Large Scale ◽  
Hybrid Approach ◽  
Hybrid Genetic Algorithm ◽  
Optimal Solution ◽  
Physical Design ◽  
Silicon Area ◽  
Vlsi Physical Design

In Optimization of VLSI Physical Design, area minimization and interconnect length minimization is an important objective in physical design automation of very large scale integration chips. The objective of minimizing the area and interconnect length would scale down the size of integrated chips. To meet the above objective, it is necessary to find an optimal solution for physical design components like partitioning, floorplanning, placement, and routing. This work helps to perform the optimization of the benchmark circuits with the above said components of physical design using hierarchical approach of evolutionary algorithms. The goal of minimizing the delay in partitioning, minimizing the silicon area in floorplanning, minimizing the layout area in placement, minimizing the wirelength in routing has indefinite influence on other criteria like power, clock, speed, cost, and so forth. Hybrid evolutionary algorithm is applied on each of its phases to achieve the objective. Because evolutionary algorithm that includes one or many local search steps within its evolutionary cycles to obtain the minimization of area and interconnect length. This approach combines a hierarchical design like genetic algorithm and simulated annealing to attain the objective. This hybrid approach can quickly produce optimal solutions for the popular benchmarks.

Improved Method of Hybrid Genetic Algorithm

2014 ◽  
Vol 556-562 ◽  
pp. 4014-4017
Author(s):  
Lei Ding ◽  
Yong Jun Luo ◽  
Yang Yang Wang ◽  
Zheng Li ◽  
Bing Yin Yao
Keyword(s):  
Genetic Algorithm ◽  
Conjugate Gradient Method ◽  
Conjugate Gradient ◽  
Gradient Method ◽  
Hybrid Genetic Algorithm ◽  
Optimal Solution ◽  
Local Optimum ◽  
Global Optimal Solution ◽  
Global Optimal ◽  
Better Than

On account of low convergence of the traditional genetic algorithm in the late,a hybrid genetic algorithm based on conjugate gradient method and genetic algorithm is proposed.This hybrid algorithm takes advantage of Conjugate Gradient’s certainty, but also the use of genetic algorithms in order to avoid falling into local optimum, so it can quickly converge to the exact global optimal solution. Using Two test functions for testing, shows that performance of this hybrid genetic algorithm is better than single conjugate gradient method and genetic algorithm and have achieved good results.

scholarly journals Optimal source localization problem based on TOA measurements

2017 ◽  
Vol 14 (1) ◽  
pp. 161-176
Author(s):  
Maja Rosic ◽  
Mirjana Simic ◽  
Predrag Pejovic ◽  
Milan Bjelica
Keyword(s):  
Genetic Algorithm ◽  
Lower Bound ◽  
Signal To Noise Ratio ◽  
Hybrid Genetic Algorithm ◽  
Optimal Solution ◽  
Nonlinear Least Squares ◽  
Global Optimum ◽  
Time Of Arrival ◽  
Newton Raphson ◽  
Optimum Solution

Determining an optimal emitting source location based on the time of arrival (TOA) measurements is one of the important problems in Wireless Sensor Networks (WSNs). The nonlinear least-squares (NLS) estimation technique is employed to obtain the location of an emitting source. This optimization problem has been formulated by the minimization of the sum of squared residuals between estimated and measured data as the objective function. This paper presents a hybridization of Genetic Algorithm (GA) for the determination of the global optimum solution with the local search Newton-Raphson (NR) method. The corresponding Cramer-Rao lower bound (CRLB) on the localization errors is derived, which gives a lower bound on the variance of any unbiased estimator. Simulation results under different signal-to-noise-ratio (SNR) conditions show that the proposed hybrid Genetic Algorithm-Newton-Raphson (GA-NR) improves the accuracy and efficiency of the optimal solution compared to the regular GA.

Sign in / Sign up

Export Citation Format

Share Document