2023
DOI: 10.1016/j.engappai.2023.106506
|View full text |Cite
|
Sign up to set email alerts
|

An adaptive large neighborhood search based approach for the vehicle routing problem with zone-based pricing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 38 publications
0
2
0
Order By: Relevance
“…In this study, we proposed multivehicle CVRP (MCVRP) to optimize the distribution of rice commodities in Indonesia by considering weather-induced damages and carbon emissions. We employed an adaptive large neighborhood search (ALNS) as an optimization method, which has been shown to outperform other algorithms in similar studies [61,62]. We also proposed a novel destroy and repair mechanism tailored to the rice commodity supply chain issue in Indonesia.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In this study, we proposed multivehicle CVRP (MCVRP) to optimize the distribution of rice commodities in Indonesia by considering weather-induced damages and carbon emissions. We employed an adaptive large neighborhood search (ALNS) as an optimization method, which has been shown to outperform other algorithms in similar studies [61,62]. We also proposed a novel destroy and repair mechanism tailored to the rice commodity supply chain issue in Indonesia.…”
Section: Literature Reviewmentioning
confidence: 99%
“…(3) Association Removal. This method was initially proposed by Shaw [46] in 1998, which involves splitting two highly correlated customers to generate new solutions and explore a larger solution space(2023) [47].First, a customer node (i) is assigned to set unvisit C after being arbitrarily chosen for removal. The similarity between each customer point in the current solution and the deleted customer point is then determined using a similarity function.To be removed and added to set unvisit C is the customer node that has the most similarity in the current solution.…”
Section: B Design Of Adaptive Large Neighborhood Search Operatorsmentioning
confidence: 99%