2017
DOI: 10.3166/jesa.50.507-519
|View full text |Cite
|
Sign up to set email alerts
|

Evolutionary game of information sharing on supply chain network based on memory genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2019
2019
2022
2022

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 0 publications
0
2
0
Order By: Relevance
“…x ijk = 1 Vehicle k travels directly from nodeito node j 0 Otherwise (14) where x ijk reflects whether vehicle k travels directly from node i to node j. If yes, x ijk = 1; otherwise, x ijk = 0.…”
Section: B Model Constructionmentioning
confidence: 99%
See 1 more Smart Citation
“…x ijk = 1 Vehicle k travels directly from nodeito node j 0 Otherwise (14) where x ijk reflects whether vehicle k travels directly from node i to node j. If yes, x ijk = 1; otherwise, x ijk = 0.…”
Section: B Model Constructionmentioning
confidence: 99%
“…Ai et al [12] put forward the VRP with simultaneous pickup and delivery (VRPSPD), solved it by a particle swarm optimization (PSO) algorithm with multiple social structures, and verified the solution using three benchmark datasets. Marinakis and Marinaki [13] successfully solved the VRP through the combination of the genetic algorithm (GA) [14] and the PSO [15]. Archetti [16] designed two exact branch-and-cut algorithms for the split delivery VRP (SDVRP), which excludes any feasible solution to relaxed constraints that does not satisfy the model constraints from the search space of the relaxed problem.…”
Section: Introductionmentioning
confidence: 99%