2022
DOI: 10.1109/access.2022.3152062
|View full text |Cite
|
Sign up to set email alerts
|

A Simulated Annealing Algorithm for the Vehicle Routing Problem With Parcel Lockers

Abstract: https://www.google.co.id/intl/en/about/products?tab=rhDate of publication xxxx 00, 0000, date of current version xxxx 00, 0000.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
23
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(23 citation statements)
references
References 42 publications
0
23
0
Order By: Relevance
“…en, taking the Fourier inverse transform of (20), its solution can be obtained using the following formula:…”
Section: Simulation Results and Analysis Of Heat Transfer Characteris...mentioning
confidence: 99%
See 1 more Smart Citation
“…en, taking the Fourier inverse transform of (20), its solution can be obtained using the following formula:…”
Section: Simulation Results and Analysis Of Heat Transfer Characteris...mentioning
confidence: 99%
“…It is the outer temperature of the dummy skin that is used to nd the optimal thickness of layer II and IV nodes by searching for pheromone updates, but since the solution generated by each ant is randomly generated by probability, this may make the pheromone update also randomly and not necessarily get the optimal thickness, thus falling into a local optimal solution. Based on this, the SA [20] algorithm is proposed in this paper to optimize the range of ant search solutions in the ACO algorithm, which is an inspirational algorithm [21][22][23], and its principle originates from the thermodynamic problem of heating a solid to a certain temperature and then slowly cooling it down to a stable state, i.e., the more ordered solid crystal goes through the process of a disordered liquid state and then to a more ordered state. e interval probability of acceptance of the optimal solution can be obtained using the Metropolis sampling process to update the pheromone.…”
Section: Study On the Optimization Model Of The Thickness Of Protecti...mentioning
confidence: 99%
“…e other is the heuristic intelligent algorithm, such as genetic algorithm [8][9][10], simulated annealing algorithm [11][12][13], ant colony algorithm [14][15][16], and particle swarm algorithm [17][18][19].…”
Section: Hungarian Algorithm For Model Solutionmentioning
confidence: 99%
“…Constraints (15) to (20) describe the bus's ability to dispatch passengers within the time window that passengers expect; the bus cannot be earlier than the time expected by the passengers nor later than the time expected by the passengers. Constraints (21) and (23) ensure that passengers do not spend too much time waiting for the bus and pass fewer intermediate stations during a trip. Constraint (22) captures the fow balance, i.e., during the pickup process, the vehicle k must leave after entering the reserved station to maintain fow conservation.…”
Section: Model Descriptionmentioning
confidence: 99%
“…But the coverage rate of trips of their genetic algorithms is slow. Additionally, Yu et al [21] developed a simulated annealing (SA) algorithm to deal with vehicle routing problems with time windows, and Candido and de Souza [22] developed an algorithm based on simulated annealing and local search that uses a collection of packing heuristics to address the loading constraints. Tey also proposed three new heuristics.…”
Section: Introductionmentioning
confidence: 99%