2017
DOI: 10.1016/j.procs.2017.01.010
|View full text |Cite
|
Sign up to set email alerts
|

Variational Genetic Algorithm for NP-hard Scheduling Problem Solution

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0
3

Year Published

2018
2018
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 22 publications
(8 citation statements)
references
References 3 publications
0
5
0
3
Order By: Relevance
“…A. I. Diveev and O.V. Bob (2017) [25] conducted an in-depth study on a metaheuristic method for solving VRP and introduced the successful application of genetic algorithms in solving vehicle routing problems. The research results showed that compared with existing linear programming methods, the genetic algorithm has better optimization ability and efficiency in finding the optimal path and calculating the lowest distribution cost.…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…A. I. Diveev and O.V. Bob (2017) [25] conducted an in-depth study on a metaheuristic method for solving VRP and introduced the successful application of genetic algorithms in solving vehicle routing problems. The research results showed that compared with existing linear programming methods, the genetic algorithm has better optimization ability and efficiency in finding the optimal path and calculating the lowest distribution cost.…”
Section: Literature Reviewmentioning
confidence: 99%
“…* ∼ (34) Formula ( 21) indicates the number of services, that is, a refrigerated vehicle serves one demand point at a time; formula (22) indicates the relationship between the route and the vehicle, that is, the number of vehicles is greater than or equal to the number of routes; formula (23) indicates that the distribution center is the starting point of the refrigerated vehicle; formula (24) and formula (25) mean that each vehicle leaves after unloading; formula (26) and formula (27) indicate that the delivery frequency is one time; formula (28) indicates the departure time constraint of the refrigerated vehicle; formula (29) means to ensure that the refrigerated vehicle must meet the customer time window; formula (30) indicates the vehicle load limit; formula (31) indicates to ensure that the customer demand satisfaction rate is met; formula (32) and ( 33) represent the 0-1 decision variable; formula (34) indicates that the customer demand obeys the random distribution F.…”
Section: ) Shortage Costmentioning
confidence: 99%
“…In real-life situations, management tends to prefer efficient and reliable approaches to obtain optimal solutions, thus giving rise to evolutionary optimisation techniques over exact algorithms. A genetic algorithm (GA) is a meta-heuristic technique widely used for solving NP-hard optimisation problems to obtain optimal, or near-optimal, solutions [36]. us, a GA can be considered a reasonable tool to resolve the NP-hard nursing staffing optimisation problem (NSOP) within a short computational time while maintaining the quality of an optimal solution.…”
Section: Existing Approaches Tomentioning
confidence: 99%
“…Scheduling issues have several types, such as sport events scheduling, staf scheduling, course scheduling, laboratory work scheduling, etc. Scheduling problems are represented as combinatorial optimization problem commonly referred to as NP-hard [4]. …”
Section: Schedulingmentioning
confidence: 99%