A backtracking adaptive threshold accepting algorithm for the vehicle routing problem
Systems Analysis Modelling Simulation
D-Ants: savings based ants divide and conquer the vehicle routing problem
Computers and Operations Research
Determination of the candidate arc set for the asymmetric traveling salesman problem
Computers and Operations Research
Very large-scale vehicle routing: new test problems, algorithms, and results
Computers and Operations Research
Solving the vehicle routing problem with adaptive memory programming methodology
Computers and Operations Research
Path relinking for the vehicle routing problem
Journal of Heuristics
Creating very large scale neighborhoods out of smaller ones by compounding moves
Journal of Heuristics
Sequential search and its application to vehicle-routing problems
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
Dynamic vehicle routing using genetic algorithms
Applied Intelligence
The petrol station replenishment problem with time windows
Computers and Operations Research
Applying hybrid meta-heuristics for capacitated vehicle routing problem
Expert Systems with Applications: An International Journal
An evolutionary-based decision support system for vehicle routing: The case of a public utility
Decision Support Systems
SR-1: a simulation-based algorithm for the capacitated vehicle routing problem
Proceedings of the 40th Conference on Winter Simulation
Worst Case Analysis for Pickup and Delivery Problems with Transfer
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Adaptive granular local search heuristic for a dynamic vehicle routing problem
Computers and Operations Research
Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem
Transportation Science
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem
Applied Soft Computing
An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
Computers and Operations Research
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Computers and Operations Research
Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem
Expert Systems with Applications: An International Journal
A hybrid genetic - Particle Swarm Optimization Algorithm for the vehicle routing problem
Expert Systems with Applications: An International Journal
Fifty Years of Vehicle Routing
Transportation Science
A hybrid algorithm for the vehicle routing problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Worst Case Analysis for Pickup and Delivery Problems with Consecutive Pickups and Deliveries
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Edge assembly crossover for the capacitated vehicle routing problem
EvoCOP'07 Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization
A hybrid particle swarm optimization algorithm for the vehicle routing problem
Engineering Applications of Artificial Intelligence
Energy minimizing vehicle routing problem
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Self-organization and evolution combined to address the vehicle routing problem
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Computers and Operations Research
Survey: matheuristics for rich vehicle routing problems
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
Predicting consumer sentiments from online text
Decision Support Systems
Heuristic methods applied to the optimization school bus transportation routes: a real case
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
A self-adaptive local search algorithm for the classical vehicle routing problem
Expert Systems with Applications: An International Journal
An agent-based guided local search for the capacited vehicle routing problem
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Restricted dynamic programming: A flexible framework for solving realistic VRPs
Computers and Operations Research
A matheuristic for the dial-a-ride problem
INOC'11 Proceedings of the 5th international conference on Network optimization
The pickup and delivery problem with cross-docking opportunity
ICCL'11 Proceedings of the Second international conference on Computational logistics
Multiple Phase Neighborhood Search-GRASP for the Capacitated Vehicle Routing Problem
Expert Systems with Applications: An International Journal
Annals of Mathematics and Artificial Intelligence
Agent-based guided local search
Expert Systems with Applications: An International Journal
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
Operations Research
Computers and Operations Research
A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
Computers and Operations Research
Packing first, routing second-a heuristic for the vehicle routing and loading problem
Computers and Operations Research
A cooperative parallel metaheuristic for the capacitated vehicle routing problem
Computers and Operations Research
| Hi-index | 0.01 |
We describe a new variant, calledgranular tabu search, of the well-known tabu-search approach. The method uses an effective intensification/diversification tool that can be successfully applied to a wide class of graph-theoretic and combinatorial-optimization problems. Granular tabu search is based on the use of drastically restricted neighborhoods, not containing the moves that involve only elements that are not likely to belong to good feasible solutions. These restricted neighborhoods are calledgranular, and may be seen as an efficient implementation of candidate-list strategies proposed for tabu-search algorithms. Results of computational testing of the proposed approach on the well-known symmetric capacitated and distance-constrained vehicle-routing problem are discussed, showing that the approach is able to determine very good solutions within short computing times.