Keyphrases
Traveling Salesman Problem
100%
Loading Constraints
100%
Last-in-first-out
100%
Large Instances
66%
Delivery Area
66%
Computing Time
66%
Loading Method
33%
Distance Traveled
33%
Algorithm Performance
33%
Computational Results
33%
Good Quality
33%
Local Optimum
33%
Feasible Solution
33%
Iterated Local Search
33%
Unique Decoding
33%
Restart Procedure
33%
Solution Representation
33%
Hamiltonian Cycle
33%
Pickup-and-delivery
33%
Offloading Operation
33%
Computer Science
Metaheuristics
100%
Traveling Salesman Problem
100%
Quality Solution
50%
Traveled Distance
50%
Algorithm Performance
50%
Iterated Local Search
50%
Feasible Solution
50%
Hamiltonian Cycle
50%
Engineering
Computing Time
100%
Hamiltonian
50%
Local Search
50%
Local Optimum
50%
Feasible Solution
50%
Additional Component
50%