2016
DOI: 10.1016/j.asoc.2016.09.005
|View full text |Cite
|
Sign up to set email alerts
|

Immune clonal algorithm based on directed evolution for multi-objective capacitated arc routing problem

Abstract: Arc Routing Problem. 2. The proposed algorithm expands the scale of the initial population to increase the diversity. 3. It helps the antibody populations to share the neighborhood information in time. 4. It applies a brand-new kind of comparison operator. 5. It can evolve in the direction of the better population.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 23 publications
(5 citation statements)
references
References 41 publications
0
5
0
Order By: Relevance
“…The constraint (5) means that the task side is served only once. The constraint (6) is that all sides in the graph allow the vehicle to pass through indefinitely. The constraint (7) requires that the total demand cannot exceed the capacity Q of the service vehicle.…”
Section: Variablesmentioning
confidence: 99%
See 1 more Smart Citation
“…The constraint (5) means that the task side is served only once. The constraint (6) is that all sides in the graph allow the vehicle to pass through indefinitely. The constraint (7) requires that the total demand cannot exceed the capacity Q of the service vehicle.…”
Section: Variablesmentioning
confidence: 99%
“…Therefore, the application of the CARP model has been widely concerned by researchers. To fulfil the needs of application, some extended versions of CARP were considered, such as the multi-objective CARP [6], the multi-depot CARP [7], the periodic CARP [8] and so on.…”
Section: Introductionmentioning
confidence: 99%
“…In the multiobjective immune algorithm using parallel mechanism, multiple subpopulations are established to perform immunization, respectively. The diversity of population can be effectively improved and the convergence can be accelerated (Shang et al, 2016) [22]. The new affinity allocation method effectively solves the selection difficulty problem.…”
Section: Multiobjective Hybrid Quantum Immune Algorithmmentioning
confidence: 99%
“…The method evidenced a competitive behavior when tested on CARP benchmark instances ( kshs , gdb , val , egl ), considering that three objectives are being simultaneously minimized: the total transportation cost, the longest route cost, and the number of vehicles. Other heuristics are developed and tested for the same purpose, namely: Mei et al derived a decomposition‐based memetic algorithm; Shang et al a multi‐population cooperative coevolutionary algorithm; Shang et al a decomposition‐based memetic algorithm; and Shang et al an immune clonal algorithm based on directed evolution. The authors report test results for various sets of CARP benchmark instances, claim good achievements, and point to possibilities for future research.…”
Section: Multiple Vehicle Arc Routing Problems (K‐arps)mentioning
confidence: 99%