2016
DOI: 10.1177/1687814016665297
|View full text |Cite
|
Sign up to set email alerts
|

Automobile chain maintenance parts delivery problem using an improved ant colony algorithm

Abstract: The mode of automotive maintenance chain is gaining more and more attention in China because of its advantages such as the lower cost, higher speed, higher availability, and strong adaptability. Since the automobile chain maintenance parts delivery problem is a very complex multi-depot vehicle routing problem with time windows, a virtual center depot is assumed and adopted to transfer multi-depot vehicle routing problem with time windows to multi-depot vehicle routing problem with the virtual central depot, wh… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
6
2

Relationship

1
7

Authors

Journals

citations
Cited by 15 publications
(3 citation statements)
references
References 32 publications
(29 reference statements)
0
3
0
Order By: Relevance
“…In a publication on delivery problem of automotive parts, Gao et al (2016) presented a mutation operation and an adaptive ant‐tuple method for solving MDVRP with a time window. Likewise, Jabir et al (2017) developed an effective ACO and VNS research methodology to address MDGVRP for cost and emission reduction.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In a publication on delivery problem of automotive parts, Gao et al (2016) presented a mutation operation and an adaptive ant‐tuple method for solving MDVRP with a time window. Likewise, Jabir et al (2017) developed an effective ACO and VNS research methodology to address MDGVRP for cost and emission reduction.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Popular metaheuristic approaches are tabu search, genetic algorithms, simulated annealing, and ant colony optimization. Examples of such methods applied to MDVRP include works by Maischberger and Cordeau, 20 Vidal et al, 21 Yalian, 22 Gao, 23 and Ma et al 24…”
Section: Literature Reviewmentioning
confidence: 99%
“…The amount of the pheromone deposited on the ground completely relies on the quality and quantity of the source discovered. [25][26][27][28] The quantity of the pheromone (tt) is intensified around the best objective value obtained throughout the simulation run in the continuous ACO algorithm. The location of the kth ant in the solution space is presented in the following equation…”
Section: Acomentioning
confidence: 99%