Pages that link to "Item:Q2884563"

The following pages link to The granular tabu search and its application to the vehicle-routing problem (Q2884563):

Displaying 50 items.

• The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
• A note on the time travel approach for handling time windows in vehicle routing problems (Q336572) (← links)
• A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) (← links)
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
• Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
• A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
• Optimised crossover genetic algorithm for capacitated vehicle routing problem (Q438026) (← links)
• A randomized granular tabu search heuristic for the split delivery vehicle routing problem (Q490211) (← links)
• A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
• Coalition-based metaheuristic: a self-adaptive metaheuristic using reinforcement learning and mimetism (Q604940) (← links)
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947) (← links)
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) (← links)
• Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
• A tabu search algorithm for the open vehicle routing problem (Q703907) (← links)
• The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
• Metaheuristics in combinatorial optimization (Q817206) (← links)
• Applying the attribute based hill climber heuristic to the vehicle routing problem (Q856266) (← links)
• A general heuristic for vehicle routing problems (Q869003) (← links)
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
• Active-guided evolution strategies for large-scale capacitated vehicle routing problems (Q878570) (← links)
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← links)
• Solving the capacitated location-routing problem. Abstract of Thesis (Q926566) (← links)
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
• The petrol station replenishment problem with time windows (Q955625) (← links)
• On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm (Q976404) (← links)
• Adaptive granular local search heuristic for a dynamic vehicle routing problem (Q1025242) (← links)
• Approximative solutions to the bicriterion vehicle routing problem with time windows (Q1038402) (← links)
• An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783) (← links)
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods (Q1040972) (← links)
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
• The electric two-echelon vehicle routing problem (Q1634075) (← links)
• A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
• An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
• An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
• Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
• A relax-and-repair heuristic for the swap-body vehicle routing problem (Q1695791) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Vehicle routing with arrival time diversification (Q1711450) (← links)
• Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
• Efficiently solving very large-scale routing problems (Q1738815) (← links)
• Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
• Restricted dynamic programming: a flexible framework for solving realistic VRPs (Q1762058) (← links)
• Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865) (← links)
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search (Q1926697) (← links)
• A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times (Q1935881) (← links)