American Institute of Mathematical Sciences

Advanced
April  2019, 15(2): 577-593. doi: 10.3934/jimo.2018058

An uncertain programming model for single machine scheduling problem with batch delivery

Jiayu Shen and  Yuanguo Zhu ,

School of Science, Nanjing University of Science and Technology, Nanjing 210094, Jiangsu, China

* Corresponding author: Yuanguo Zhu

Received  August 2017 Revised  January 2018 Published  April 2018

A single machine scheduling problem with batch delivery is studied in this paper. The objective is to minimize the total cost which comprises earliness penalties, tardiness penalties, holding and transportation costs. An integer programming model is proposed and two dominance properties are obtained. However, sometimes due to the lack of historical data, the worker evaluates the processing time of a job according to his past experience. A pessimistic value model of the single machine scheduling problem with batch delivery under an uncertain environment is presented. Since the objective function is non-monotonic with respect to uncertain variables, a hybrid algorithm based on uncertain simulation and a g#enetic algorithm (GA) is designed to solve the model. In addition, two dominance properties under the uncertain environment are also obtained. Finally, computational experiments are presented to illustrate the modeling idea and the effectiveness of the algorithm.

Keywords: Single machine scheduling, batch delivery, uncertain environment, genetic algorithm, uncertain simulation.
Mathematics Subject Classification: Primary: 90B99; Secondary: 90C10.
Citation: Jiayu Shen, Yuanguo Zhu. An uncertain programming model for single machine scheduling problem with batch delivery. Journal of Industrial & Management Optimization, 2019, 15 (2) : 577-593. doi: 10.3934/jimo.2018058
References:
[1]

E. Cakici, S. Mason and M. Kurz, Multi-objective analysis of an integrated supply chain scheduling problem, International Journal of Production Research, 50 (2012), 2624-2638.   Google Scholar

[2]

Y. Chen and Y. Zhu, Indefinite LQ optimal control with process state inequality constraints for discrete-time uncertain systems Journal of Industrial and Management Optimization, to appear. doi: 10.3934/jimo.2017082.  Google Scholar

[3]

T. Cheng, V. Gordon and M. Kovalyov, Single machine scheduling with batch deliveries, European Journal of Operational Research, 94 (1996), 227-283.   Google Scholar

[4]

Q. Cui and Y. Sheng, Uncertain programming model for solid transportation problem, Information: An International Interdisciplinary Journal, 16 (2013), 1207-1214.   Google Scholar

[5]

J. Framinan and P. Gonzalez, On heuristic solutions for the stochastic flow shop scheduling problem, European Journal of Operational Research, 246 (2015), 413-420.  doi: 10.1016/j.ejor.2015.05.006.  Google Scholar

[6]

B. Fu, Y. Huo and H. Zhao, Coordinated scheduling of production and delivery with production window and delivery capacity constraints, Theoretical Computer Science, 422 (2012), 39-51.  doi: 10.1016/j.tcs.2011.11.035.  Google Scholar

[7]

Y. Gao, Shortest path problem with uncertain arc lengths, Computers & Mathematics with Applications, 62 (2011), 2591-2600.  doi: 10.1016/j.camwa.2011.07.058.  Google Scholar

[8]

Y. Gao, L. Yang and S. Li, Uncertain Models on railway transportation planning problem, Applied Mathematical Modelling, 40 (2016), 4921-4934.  doi: 10.1016/j.apm.2015.12.016.  Google Scholar

[9]

N. Hall, M. Lesaoana and C. Potts, Scheduling with fixed delivery dates, Operations Research, 49 (2001), 134-144.  doi: 10.1287/opre.49.1.134.11192.  Google Scholar

[10]

N. Hall and C. Potts, Supply chain scheduling: Batching and delivery, Operation research, 51 (2003), 566-584.  doi: 10.1287/opre.51.4.566.16106.  Google Scholar

[11]

N. Hall and C. Potts, The coordination of scheduling and batch deliveries, Annals of Operations Research, 135 (2005), 41-64.  doi: 10.1007/s10479-005-6234-8.  Google Scholar

[12]

R. Hallah, Minimizing total earliness and tardiness on a single machine using a hybrid heuristic, Computers & Operations Research, 34 (2007), 3126-3142.   Google Scholar

[13]

A. Hamidinia, S. Khakabimamaghani, M. Mazdeh and M. Jafari, A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system, Computers & Industrial Engineering, 62 (2012), 29-38.   Google Scholar

[14]

S. Han, Z. Peng and S. Wang, The maximum flow problem of uncertain network, Information Sciences, 265 (2014), 167-175.  doi: 10.1016/j.ins.2013.11.029.  Google Scholar

[15]

X. Hao, L. Lin, M. Gen and K. Ohno, Effective estimation of distribution algorithm for stochastic job shop scheduling problem, Procedia Computer Science, 20 (2013), 102-107.   Google Scholar

[16]

G. Jiang, An uncertain chance-constrained programming model for empty container allocation, Information: An International Interdisciplinary Journal, 16 (2013), 1119-1124.   Google Scholar

[17]

F. Jolai, M. Rabbani, S. Amalnick, A. Dabaghi, M. Dehghan and M. YazdanParas, Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs, Applied Mathematics & Computation, 194 (2007), 552-560.  doi: 10.1016/j.amc.2007.04.063.  Google Scholar

[18]

S. Karimi, Z. Ardalan, B. Naderi and M. Mohammadi, Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm, Applied Mathematical Modelling, 47 (2017), 667-682.  doi: 10.1016/j.apm.2016.09.022.  Google Scholar

[19]

H. Ke, J. Ma and G. Tian, Hybrid multilevel programming with uncertain random parameters, Journal of Intelligent Manufacturing, 28 (2017), 589-596.   Google Scholar

[20]

S. Li and J. Peng, A new approach to risk comparison via uncertain measure, Industrial Engineering and Management Systems, 11 (2012), 176-182.   Google Scholar

[21]

B. Liu, Uncertainty Theory, Springer-Verlag, Berlin, 2004.  Google Scholar

[22]

B. Liu, Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty, Springer-Verlag, Berlin, 2010. Google Scholar

[23]

B. Liu and K. Yao, Uncertain multilevel programming: algorithm and applications, Computers & Industrial Engineering, 89 (2015), 235-240.   Google Scholar

[24]

B. Liu, Some research problems in uncertainty theory, Journal of Uncertain Systems, 3 (2009), 3-10.   Google Scholar

[25]

A. Mason and E. Anderson, Minimizing flow time on a single-machine with job classes and setup times, Naval Research Logistic, 38 (1991), 333-350.  doi: 10.1002/1520-6750(199106)38:3<333::AID-NAV3220380305>3.0.CO;2-0.  Google Scholar

[26]

Y. Ning, X. Chen, Z. Wang and X. Li, An uncertain multi-objective programming model for machine scheduling problem, International Journal of Machine Learning and Cybernetics, 8 (2017), 1493-1500.   Google Scholar

[27]

Z. Peng and K. Iwamura, A sufficient and necessary condition of uncertainty distribution, Journal of Interdisciplinary Mathematics, 13 (2010), 277-285.  doi: 10.1080/09720502.2010.10700701.  Google Scholar

[28]

X. Qi, Coordinated logistics scheduling for in-house production and outsourcing, IEEE Transactions on Automation Science and Engineering, 5 (2008), 188-192.   Google Scholar

[29]

L. Rong, Two new uncertainty programming models of inventory with uncertain costs, Journal of Information & Computational Science, 8 (2011), 280-288.   Google Scholar

[30]

J. Shen and Y. Zhu, Scheduling in a two-stage supply chain with uncertain parameters, Journal of Intelligent and Fuzzy Systems, 30 (2016), 3439-3449.   Google Scholar

[31]

A. Singh, J. ValenteMaria and M. Moreira, Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, International Journal of Machine Learning and Cybernetics, 3 (2012), 327-333.   Google Scholar

[32]

A. Soukhal, A. Oulamara and P. Martineau, Complexity of flow shop scheduling problems with transportation constraints, European Journal of Operational Research, 161 (2005), 32-41.  doi: 10.1016/j.ejor.2003.03.002.  Google Scholar

[33]

K. Stecke and X. Zhao, Production and transportation integration for a make-todelivery business mode, Manufacturing & Service Operations Management, 9 (2007), 206-224.   Google Scholar

[34]

G. Steiner and R. Zhang, Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains, Journal of Scheduling, 12 (2009), 565-574.  doi: 10.1007/s10951-009-0109-9.  Google Scholar

[35]

G. Wan and B. Yen, Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, European Journal of Operational Research, 142 (2002), 271-281.  doi: 10.1016/S0377-2217(01)00302-2.  Google Scholar

[36]

X. Wang and T. Cheng, Logistics scheduling to minimize inventory and transport costs, International Journal of Production Economics, 121 (2009), 266-273.   Google Scholar

[37]

X. Wang and T. Cheng, Production scheduling with supply and delivery considerations to minimize the makespan, European Journal of Operational Research, 194 (2009), 743-752.  doi: 10.1016/j.ejor.2007.12.033.  Google Scholar

[38]

X. Wu and X. Zhou, Stochastic scheduling to minimize expected maximum lateness, European Journal of Operational Research, 190 (2008), 103-115.  doi: 10.1016/j.ejor.2007.06.015.  Google Scholar

[39]

H. Yan, Y. Sun and Y. Zhu, A linear-quadratic control problem of uncertain discretr-time switched systems, Journal of Industrial and Management Optimization, 13 (2017), 267-282.   Google Scholar

[40]

X. Yang, Scheduling with generalized batch delivery dates and earliness penalties, IIE Transactions, 32 (2000), 735-741.   Google Scholar

[41]

K. Yao, Multi-dimensional uncertain calculus with liu process, Journal of Uncertain Systems, 8 (2014), 244-254.   Google Scholar

[42]

Y. Yin, T. Cheng, S. Cheng and C. Wu, Single-machine batch delivery scheduling with an assignable common due date and controllable processing times, Computers & Industrial Engineering, 65 (2013), 652-662.   Google Scholar

[43]

Y. Yin, T. Cheng, C. Wu and S. Cheng, Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times, International Journal of Production Research, 51 (2013), 5083-5099.   Google Scholar

[44]

Y. Yin, T. Cheng, C. Hsu and C. Wu, Single-machine batch delivery scheduling with an assignable common due window, Omega, 41 (2013), 216-225.   Google Scholar

[45]

Y. Yin, T. Cheng, C. Wu and S. Cheng, Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity, International Journal of Production Research, 52 (2014), 5583-5596. Google Scholar

[46]

Y. Yin, Y. Wang, T. Cheng, D. Wang and C. Wu, Two-agent single-machine scheduling to minimize the batch delivery cost, Computers & Industrial Engineering, 92 (2016), 16-30.   Google Scholar

[47]

S. Zdrzalka, Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times, European Journal of Operational Research, 51 (1991), 199-209.   Google Scholar

[48]

Y. Zhu, Functions of uncertain variables and uncertain programming, Journal of Uncertain Systems, 6 (2012), 278-288.   Google Scholar

show all references

References:
[1]

E. Cakici, S. Mason and M. Kurz, Multi-objective analysis of an integrated supply chain scheduling problem, International Journal of Production Research, 50 (2012), 2624-2638.   Google Scholar

[2]

Y. Chen and Y. Zhu, Indefinite LQ optimal control with process state inequality constraints for discrete-time uncertain systems Journal of Industrial and Management Optimization, to appear. doi: 10.3934/jimo.2017082.  Google Scholar

[3]

T. Cheng, V. Gordon and M. Kovalyov, Single machine scheduling with batch deliveries, European Journal of Operational Research, 94 (1996), 227-283.   Google Scholar

[4]

Q. Cui and Y. Sheng, Uncertain programming model for solid transportation problem, Information: An International Interdisciplinary Journal, 16 (2013), 1207-1214.   Google Scholar

[5]

J. Framinan and P. Gonzalez, On heuristic solutions for the stochastic flow shop scheduling problem, European Journal of Operational Research, 246 (2015), 413-420.  doi: 10.1016/j.ejor.2015.05.006.  Google Scholar

[6]

B. Fu, Y. Huo and H. Zhao, Coordinated scheduling of production and delivery with production window and delivery capacity constraints, Theoretical Computer Science, 422 (2012), 39-51.  doi: 10.1016/j.tcs.2011.11.035.  Google Scholar

[7]

Y. Gao, Shortest path problem with uncertain arc lengths, Computers & Mathematics with Applications, 62 (2011), 2591-2600.  doi: 10.1016/j.camwa.2011.07.058.  Google Scholar

[8]

Y. Gao, L. Yang and S. Li, Uncertain Models on railway transportation planning problem, Applied Mathematical Modelling, 40 (2016), 4921-4934.  doi: 10.1016/j.apm.2015.12.016.  Google Scholar

[9]

N. Hall, M. Lesaoana and C. Potts, Scheduling with fixed delivery dates, Operations Research, 49 (2001), 134-144.  doi: 10.1287/opre.49.1.134.11192.  Google Scholar

[10]

N. Hall and C. Potts, Supply chain scheduling: Batching and delivery, Operation research, 51 (2003), 566-584.  doi: 10.1287/opre.51.4.566.16106.  Google Scholar

[11]

N. Hall and C. Potts, The coordination of scheduling and batch deliveries, Annals of Operations Research, 135 (2005), 41-64.  doi: 10.1007/s10479-005-6234-8.  Google Scholar

[12]

R. Hallah, Minimizing total earliness and tardiness on a single machine using a hybrid heuristic, Computers & Operations Research, 34 (2007), 3126-3142.   Google Scholar

[13]

A. Hamidinia, S. Khakabimamaghani, M. Mazdeh and M. Jafari, A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system, Computers & Industrial Engineering, 62 (2012), 29-38.   Google Scholar

[14]

S. Han, Z. Peng and S. Wang, The maximum flow problem of uncertain network, Information Sciences, 265 (2014), 167-175.  doi: 10.1016/j.ins.2013.11.029.  Google Scholar

[15]

X. Hao, L. Lin, M. Gen and K. Ohno, Effective estimation of distribution algorithm for stochastic job shop scheduling problem, Procedia Computer Science, 20 (2013), 102-107.   Google Scholar

[16]

G. Jiang, An uncertain chance-constrained programming model for empty container allocation, Information: An International Interdisciplinary Journal, 16 (2013), 1119-1124.   Google Scholar

[17]

F. Jolai, M. Rabbani, S. Amalnick, A. Dabaghi, M. Dehghan and M. YazdanParas, Genetic algorithm for bi-criteria single machine scheduling problem of minimizing maximum earliness and number of tardy jobs, Applied Mathematics & Computation, 194 (2007), 552-560.  doi: 10.1016/j.amc.2007.04.063.  Google Scholar

[18]

S. Karimi, Z. Ardalan, B. Naderi and M. Mohammadi, Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm, Applied Mathematical Modelling, 47 (2017), 667-682.  doi: 10.1016/j.apm.2016.09.022.  Google Scholar

[19]

H. Ke, J. Ma and G. Tian, Hybrid multilevel programming with uncertain random parameters, Journal of Intelligent Manufacturing, 28 (2017), 589-596.   Google Scholar

[20]

S. Li and J. Peng, A new approach to risk comparison via uncertain measure, Industrial Engineering and Management Systems, 11 (2012), 176-182.   Google Scholar

[21]

B. Liu, Uncertainty Theory, Springer-Verlag, Berlin, 2004.  Google Scholar

[22]

B. Liu, Uncertainty Theory: A Branch of Mathematics for Modeling Human Uncertainty, Springer-Verlag, Berlin, 2010. Google Scholar

[23]

B. Liu and K. Yao, Uncertain multilevel programming: algorithm and applications, Computers & Industrial Engineering, 89 (2015), 235-240.   Google Scholar

[24]

B. Liu, Some research problems in uncertainty theory, Journal of Uncertain Systems, 3 (2009), 3-10.   Google Scholar

[25]

A. Mason and E. Anderson, Minimizing flow time on a single-machine with job classes and setup times, Naval Research Logistic, 38 (1991), 333-350.  doi: 10.1002/1520-6750(199106)38:3<333::AID-NAV3220380305>3.0.CO;2-0.  Google Scholar

[26]

Y. Ning, X. Chen, Z. Wang and X. Li, An uncertain multi-objective programming model for machine scheduling problem, International Journal of Machine Learning and Cybernetics, 8 (2017), 1493-1500.   Google Scholar

[27]

Z. Peng and K. Iwamura, A sufficient and necessary condition of uncertainty distribution, Journal of Interdisciplinary Mathematics, 13 (2010), 277-285.  doi: 10.1080/09720502.2010.10700701.  Google Scholar

[28]

X. Qi, Coordinated logistics scheduling for in-house production and outsourcing, IEEE Transactions on Automation Science and Engineering, 5 (2008), 188-192.   Google Scholar

[29]

L. Rong, Two new uncertainty programming models of inventory with uncertain costs, Journal of Information & Computational Science, 8 (2011), 280-288.   Google Scholar

[30]

J. Shen and Y. Zhu, Scheduling in a two-stage supply chain with uncertain parameters, Journal of Intelligent and Fuzzy Systems, 30 (2016), 3439-3449.   Google Scholar

[31]

A. Singh, J. ValenteMaria and M. Moreira, Hybrid heuristics for the single machine scheduling problem with quadratic earliness and tardiness costs, International Journal of Machine Learning and Cybernetics, 3 (2012), 327-333.   Google Scholar

[32]

A. Soukhal, A. Oulamara and P. Martineau, Complexity of flow shop scheduling problems with transportation constraints, European Journal of Operational Research, 161 (2005), 32-41.  doi: 10.1016/j.ejor.2003.03.002.  Google Scholar

[33]

K. Stecke and X. Zhao, Production and transportation integration for a make-todelivery business mode, Manufacturing & Service Operations Management, 9 (2007), 206-224.   Google Scholar

[34]

G. Steiner and R. Zhang, Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains, Journal of Scheduling, 12 (2009), 565-574.  doi: 10.1007/s10951-009-0109-9.  Google Scholar

[35]

G. Wan and B. Yen, Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties, European Journal of Operational Research, 142 (2002), 271-281.  doi: 10.1016/S0377-2217(01)00302-2.  Google Scholar

[36]

X. Wang and T. Cheng, Logistics scheduling to minimize inventory and transport costs, International Journal of Production Economics, 121 (2009), 266-273.   Google Scholar

[37]

X. Wang and T. Cheng, Production scheduling with supply and delivery considerations to minimize the makespan, European Journal of Operational Research, 194 (2009), 743-752.  doi: 10.1016/j.ejor.2007.12.033.  Google Scholar

[38]

X. Wu and X. Zhou, Stochastic scheduling to minimize expected maximum lateness, European Journal of Operational Research, 190 (2008), 103-115.  doi: 10.1016/j.ejor.2007.06.015.  Google Scholar

[39]

H. Yan, Y. Sun and Y. Zhu, A linear-quadratic control problem of uncertain discretr-time switched systems, Journal of Industrial and Management Optimization, 13 (2017), 267-282.   Google Scholar

[40]

X. Yang, Scheduling with generalized batch delivery dates and earliness penalties, IIE Transactions, 32 (2000), 735-741.   Google Scholar

[41]

K. Yao, Multi-dimensional uncertain calculus with liu process, Journal of Uncertain Systems, 8 (2014), 244-254.   Google Scholar

[42]

Y. Yin, T. Cheng, S. Cheng and C. Wu, Single-machine batch delivery scheduling with an assignable common due date and controllable processing times, Computers & Industrial Engineering, 65 (2013), 652-662.   Google Scholar

[43]

Y. Yin, T. Cheng, C. Wu and S. Cheng, Single-machine common due-date scheduling with batch delivery costs and resource-dependent processing times, International Journal of Production Research, 51 (2013), 5083-5099.   Google Scholar

[44]

Y. Yin, T. Cheng, C. Hsu and C. Wu, Single-machine batch delivery scheduling with an assignable common due window, Omega, 41 (2013), 216-225.   Google Scholar

[45]

Y. Yin, T. Cheng, C. Wu and S. Cheng, Single-machine batch delivery scheduling and common due-date assignment with a rate-modifying activity, International Journal of Production Research, 52 (2014), 5583-5596. Google Scholar

[46]

Y. Yin, Y. Wang, T. Cheng, D. Wang and C. Wu, Two-agent single-machine scheduling to minimize the batch delivery cost, Computers & Industrial Engineering, 92 (2016), 16-30.   Google Scholar

[47]

S. Zdrzalka, Approximation algorithms for single-machine sequencing with delivery times and unit batch set-up times, European Journal of Operational Research, 51 (1991), 199-209.   Google Scholar

[48]

Y. Zhu, Functions of uncertain variables and uncertain programming, Journal of Uncertain Systems, 6 (2012), 278-288.   Google Scholar

Figure 1.  An example of crossover
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 2.  An example of mutation
Figure Options

Download full-size image

Download as PowerPoint slide

Figure 3.  The sensitivity of the solution with respect to the confidence level
Figure Options

Download full-size image

Download as PowerPoint slide

Table 1.  List of notations
notationsdefinitions
$i=1, 2, ..., n$the index of job
$j=1, 2, ...$the index of position
$b=1, 2, ...$the index of batch
$l=1, 2, ...$, Kthe index of customer
$n_{l}$the number of jobs of customer $l$, l=1, 2, ..., K
$p_i$processing time of job $i$, i=1, 2, ..., n
$[d^{s}_{i}, d^{t}_{i}]$due window of job $i$, i=1, 2, ..., n
$\alpha_i$unit earliness penalty cost of job $i$, i=1, 2, ..., n
$\beta_i$unit tardiness penalty cost of job $i$, i=1, 2, ..., n
$h_i$unit holding cost of job $i$, i=1, 2, ..., n
$D_l$transportation cost of customer $l$, l=1, 2, ..., K
$C_i$completion time of job $i$, i=1, 2, ..., n
$T_j$completion time of the $j$th job on machine}, j=1, 2, ...
$R_i$delivery date of job $i$, i=1, 2, ..., n
$R^{'}_{lb}$delivery date of the $b$th batch of customer $l$, l=1, 2, ..., K; b=1, 2, ...
Table Options

Download as excel

notationsdefinitions
$i=1, 2, ..., n$the index of job
$j=1, 2, ...$the index of position
$b=1, 2, ...$the index of batch
$l=1, 2, ...$, Kthe index of customer
$n_{l}$the number of jobs of customer $l$, l=1, 2, ..., K
$p_i$processing time of job $i$, i=1, 2, ..., n
$[d^{s}_{i}, d^{t}_{i}]$due window of job $i$, i=1, 2, ..., n
$\alpha_i$unit earliness penalty cost of job $i$, i=1, 2, ..., n
$\beta_i$unit tardiness penalty cost of job $i$, i=1, 2, ..., n
$h_i$unit holding cost of job $i$, i=1, 2, ..., n
$D_l$transportation cost of customer $l$, l=1, 2, ..., K
$C_i$completion time of job $i$, i=1, 2, ..., n
$T_j$completion time of the $j$th job on machine}, j=1, 2, ...
$R_i$delivery date of job $i$, i=1, 2, ..., n
$R^{'}_{lb}$delivery date of the $b$th batch of customer $l$, l=1, 2, ..., K; b=1, 2, ...
Table 2.  Results for small scale
NoGAHGA
minmaxtime(s)minmaxtime(s)
13079336135631253349301
22953341533828373437312
32556288931323982735263
43582376435936193923329
52046235827120982491254
Table Options

Download as excel

NoGAHGA
minmaxtime(s)minmaxtime(s)
13079336135631253349301
22953341533828373437312
32556288931323982735263
43582376435936193923329
52046235827120982491254
Table 3.  Results for mesoscale
NoGAHGA
minmaxtime(s)minmaxtime(s)
1846688931603850186971354
2932096711754945596121340
3832385691625836185381385
4873690281701879891101313
5795480771590783981541397
Table Options

Download as excel

NoGAHGA
minmaxtime(s)minmaxtime(s)
1846688931603850186971354
2932096711754945596121340
3832385691625836185381385
4873690281701879891101313
5795480771590783981541397
Table 4.  Results for large scale
NoGAHGA
minmaxtime(s)minmaxtime(s)
12154222634865521696218736320
21955621391836719374200655966
32140623767896121250220346257
42197323891905821630227416299
52059222378853720063200976035
Table Options

Download as excel

NoGAHGA
minmaxtime(s)minmaxtime(s)
12154222634865521696218736320
21955621391836719374200655966
32140623767896121250220346257
42197323891905821630227416299
52059222378853720063200976035
Table 5.  Average relative percentage errors of GA and HGA
$n$GAHGA
$20$ $0.06266$ $0.05713$
$50$ $0.03316$ $0.02685$
$100$ $0.01295$ $0.007372$
$200$ $0.005723$ $0.004993$
Average$0.028623$ $0.024086$
Table Options

Download as excel

$n$GAHGA
$20$ $0.06266$ $0.05713$
$50$ $0.03316$ $0.02685$
$100$ $0.01295$ $0.007372$
$200$ $0.005723$ $0.004993$
Average$0.028623$ $0.024086$
[1]

Hui Lv, Xing'an Wang. Dissipative control for uncertain singular markovian jump systems via hybrid impulsive control. Numerical Algebra, Control & Optimization, 2021, 11 (1) : 127-142. doi: 10.3934/naco.2020020
[2]

Xuefeng Zhang, Yingbo Zhang. Fault-tolerant control against actuator failures for uncertain singular fractional order systems. Numerical Algebra, Control & Optimization, 2021, 11 (1) : 1-12. doi: 10.3934/naco.2020011
[3]

Sergio Conti, Georg Dolzmann. Optimal laminates in single-slip elastoplasticity. Discrete & Continuous Dynamical Systems - S, 2021, 14 (1) : 1-16. doi: 10.3934/dcdss.2020302
[4]

Ying Lin, Qi Ye. Support vector machine classifiers by non-Euclidean margins. Mathematical Foundations of Computing, 2020, 3 (4) : 279-300. doi: 10.3934/mfc.2020018
[5]

Wolfgang Riedl, Robert Baier, Matthias Gerdts. Optimization-based subdivision algorithm for reachable sets. Journal of Computational Dynamics, 2021, 8 (1) : 99-130. doi: 10.3934/jcd.2021005
[6]

Shiqi Ma. On recent progress of single-realization recoveries of random Schrödinger systems. Electronic Research Archive, , () : -. doi: 10.3934/era.2020121
[7]

Omid Nikan, Seyedeh Mahboubeh Molavi-Arabshai, Hossein Jafari. Numerical simulation of the nonlinear fractional regularized long-wave model arising in ion acoustic plasma waves. Discrete & Continuous Dynamical Systems - S, 2020  doi: 10.3934/dcdss.2020466
[8]

Reza Lotfi, Zahra Yadegari, Seyed Hossein Hosseini, Amir Hossein Khameneh, Erfan Babaee Tirkolaee, Gerhard-Wilhelm Weber. A robust time-cost-quality-energy-environment trade-off with resource-constrained in project management: A case study for a bridge construction project. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020158
[9]

Mohammed Abdulrazaq Kahya, Suhaib Abduljabbar Altamir, Zakariya Yahya Algamal. Improving whale optimization algorithm for feature selection with a time-varying transfer function. Numerical Algebra, Control & Optimization, 2021, 11 (1) : 87-98. doi: 10.3934/naco.2020017
[10]

Cheng Peng, Zhaohui Tang, Weihua Gui, Qing Chen, Jing He. A bidirectional weighted boundary distance algorithm for time series similarity computation based on optimized sliding window size. Journal of Industrial & Management Optimization, 2021, 17 (1) : 205-220. doi: 10.3934/jimo.2019107

2019 Impact Factor: 1.366

Tools

Metrics

  • PDF downloads (288)
  • HTML views (1490)
  • Cited by (1)

Other articles
by authors

[Back to Top]

Copyright © 2020 American Institute of Mathematical Sciences