Pages that link to "Item:Q4361181"

The following pages link to A tabu search heuristic for periodic and multi-depot vehicle routing problems (Q4361181):

Displaying 50 items.

• An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem (Q297272) (← links)
• Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
• On service consistency in multi-period vehicle routing (Q319190) (← links)
• The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
• A two-stage solution method for the annual dairy transportation problem (Q322617) (← links)
• An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot (Q324308) (← links)
• A hybrid tabu search based heuristic for the periodic distribution inventory problem with perishable goods (Q324315) (← links)
• A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
• Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex (Q336558) (← links)
• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• Nested simulated annealing approach to periodic routing problem of a retail distribution system (Q336657) (← links)
• A vehicle routing problem with flexible time windows (Q337177) (← links)
• Scheduled penalty variable neighborhood search (Q337204) (← links)
• The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation (Q337237) (← links)
• Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm (Q337247) (← links)
• Solving the orienteering problem with time windows via the pulse framework (Q337360) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
• Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
• Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← 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)
• Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
• Multi-depot multiple TSP: a polyhedral study and computational results (Q367624) (← links)
• Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← links)
• A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows (Q415560) (← links)
• Formulations and Benders decomposition algorithms for multidepot salesmen problems with load balancing (Q421709) (← links)
• A simulated annealing heuristic for the team orienteering problem with time windows (Q439335) (← links)
• Optimally routing and scheduling tow trains for JIT-supply of mixed-model assembly lines (Q439371) (← links)
• A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
• A hybrid evolutionary algorithm for the periodic location-routing problem (Q531435) (← links)
• Recyclable waste collection planning -- a case study (Q596261) (← links)
• The orienteering problem: a survey (Q617509) (← links)
• Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)
• A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
• A tabu search heuristic for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows (Q702761) (← links)
• Bilevel model for production-distribution planning solved by using ant colony optimization (Q709146) (← links)
• Heuristics for the multi-period orienteering problem with multiple time windows (Q732904) (← links)
• Iterated local search for the team orienteering problem with time windows (Q833556) (← links)
• A tabu search heuristic for the quay crane scheduling problem (Q835567) (← links)
• Reverse logistics: simultaneous design of delivery routes and returns strategies (Q850304) (← links)
• The multi-depot vehicle routing problem with inter-depot routes (Q852937) (← links)
• Applying the attribute based hill climber heuristic to the vehicle routing problem (Q856266) (← links)
• Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts (Q863988) (← links)
• Scheduling periodic customer visits for a traveling salesperson (Q863999) (← links)
• A general heuristic for vehicle routing problems (Q869003) (← links)
• General solutions to the single vehicle routing problem with pickups and deliveries (Q869591) (← links)
• An application of special ordered sets to a periodic milk collection problem (Q869614) (← links)