Pages that link to "Item:Q4658480"
From MaRDI portal
The following pages link to A unified tabu search heuristic for vehicle routing problems with time windows (Q4658480):
Displaying 50 items.
- A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service (Q264279) (← links)
- On service consistency in multi-period vehicle routing (Q319190) (← links)
- The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
- A multi-objective local search heuristic for scheduling Earth observations taken by an agile satellite (Q319628) (← links)
- An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← 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)
- The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
- A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) (← links)
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- A note on the time travel approach for handling time windows in vehicle routing problems (Q336572) (← links)
- A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows (Q336957) (← links)
- A vehicle routing problem with flexible time windows (Q337177) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm (Q337247) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows (Q337630) (← links)
- Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
- Heuristics for dynamic and stochastic routing in industrial shipping (Q339576) (← links)
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
- A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
- Routing and scheduling in project shipping (Q367634) (← links)
- A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
- Recyclable waste collection planning -- a case study (Q596261) (← 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)
- An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows (Q622144) (← links)
- Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (Q711387) (← links)
- A new bi-objective periodic vehicle routing problem with maximization market share in an uncertain competitive environment (Q725797) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← links)
- A unified heuristic for a large class of vehicle routing problems with backhauls (Q819067) (← links)
- A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636) (← 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)
- A goal programming approach to vehicle routing problems with soft time windows (Q857306) (← 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)
- Designing delivery districts for the vehicle routing problem with stochastic demands (Q872114) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- Comparing backhauling strategies in vehicle routing using ant colony optimization (Q926337) (← links)
- A neural-tabu search heuristic for the real time vehicle routing problem (Q928694) (← links)
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
- A hybrid method based on linear programming and tabu search for routing of logging trucks (Q958445) (← links)
- A tabu search heuristic for ship routing and scheduling with flexible cargo quantities (Q964843) (← links)
- A tabu search heuristic for the vehicle routing problem with private fleet and common carrier (Q1026772) (← links)
- Local search with annealing-like restarts to solve the VRPTW (Q1400662) (← links)
- An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits (Q1628066) (← links)
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization (Q1651513) (← links)
