2017
DOI: 10.1504/ijstl.2017.080568
|View full text |Cite
|
Sign up to set email alerts
|

Disruption management for vehicle routing problem with time-window changes

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2017
2017
2024
2024

Publication Types

Select...
7
1

Relationship

3
5

Authors

Journals

citations
Cited by 8 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…In 2007, Basturk et al (2007) further applied ABC to numerical optimization with constraints, and obtained good results. In respect of combination optimization, Singh (2009) successfully uncovered leafconstrained minimum spanning tree from an undirected, weighted graph with ABC algorithm; Ju et al (2017) presented a solution for disruption problem in logistic distribution with improved ABC algorithm, with better performance than general heuristic solutions; and Garg (2014) solved structural engineering design optimization problems with penalty guided ABC algorithm, and experimental results showed that solutions obtained by the proposed approach were superior to those best solutions by typical approaches in the literature. And against problems of unconstrained numerical optimization, researchers have proved that comprehensive performance of ABC algorithm is better than those of other intelligent algorithms (Chen and Xiao, 2014).…”
Section: Realization Process Of Classic Association Rule Mining Algorithmmentioning
confidence: 99%
“…In 2007, Basturk et al (2007) further applied ABC to numerical optimization with constraints, and obtained good results. In respect of combination optimization, Singh (2009) successfully uncovered leafconstrained minimum spanning tree from an undirected, weighted graph with ABC algorithm; Ju et al (2017) presented a solution for disruption problem in logistic distribution with improved ABC algorithm, with better performance than general heuristic solutions; and Garg (2014) solved structural engineering design optimization problems with penalty guided ABC algorithm, and experimental results showed that solutions obtained by the proposed approach were superior to those best solutions by typical approaches in the literature. And against problems of unconstrained numerical optimization, researchers have proved that comprehensive performance of ABC algorithm is better than those of other intelligent algorithms (Chen and Xiao, 2014).…”
Section: Realization Process Of Classic Association Rule Mining Algorithmmentioning
confidence: 99%
“…In addition, because of the large number of variables involved in the model and the high complexity of the solution, it is difficult to solve this kind of NP-hard problem by general exact algorithms. Since artificial bee colony algorithm simulates bee colony's behavior of foraging in nature and boasts high solving efficiency, simple algorithm, fewer parameters, and strong robustness [20,21], this paper designs an improved artificial bee colony algorithm to solve the problem.…”
Section: Algorithm Design For Problem Solvingmentioning
confidence: 99%
“…These activities or tasks and their operation logic relationships can be presented by a directed graph formed by directed connection arcs, as shown in Figure 1. In the supply chain partner selection problem, the supplier network is composed of many upstream and downstream enterprises; thus it can be abstracted into a weighteddirected graph [22]. And presents the set of nodes; presents the set of edges; the number of nodes is ; the number of edges is ; the set = ⋃ =1 presents the available node supplier enterprises on supplier network and presents the set of edges [23].…”
Section: Problems Analysismentioning
confidence: 99%