Pages that link to "Item:Q4656651"
From MaRDI portal
The following pages link to A guide to vehicle routing heuristics (Q4656651):
Displaying 50 items.
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- A vehicle routing problem with flexible time windows (Q337177) (← links)
- A large neighbourhood based heuristic for two-echelon routing problems (Q342576) (← links)
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands (Q375990) (← links)
- A sequential GRASP for the therapist routing and scheduling problem (Q398907) (← links)
- Optimised crossover genetic algorithm for capacitated vehicle routing problem (Q438026) (← links)
- A heuristic algorithm based on multi-assignment procedures for nurse scheduling (Q475190) (← links)
- Vehicle routing with compartments: applications, modelling and heuristics (Q657053) (← links)
- Metaheuristics in combinatorial optimization (Q817206) (← 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)
- 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)
- Lagrangian relaxation guided problem space search heuristics for generalized assignment problems (Q884028) (← links)
- Comparing backhauling strategies in vehicle routing using ant colony optimization (Q926337) (← links)
- A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries (Q927194) (← links)
- Real-time split-delivery pickup and delivery time window problems with transfers (Q940817) (← 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)
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm (Q958458) (← links)
- Solving the truck and trailer routing problem based on a simulated annealing heuristic (Q959516) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- A local search heuristic for the pre- and end-haulage of intermodal container terminals (Q1017451) (← links)
- D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
- Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← 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 survey of the standard location-routing problem (Q1698292) (← links)
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
- Staff assignment with lexicographically ordered acceptance levels (Q1743648) (← links)
- Vehicle routing problem for multiple product types, compartments, and trips with soft time windows (Q1751334) (← links)
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
- The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches (Q1754738) (← links)
- Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865) (← links)
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows (Q1777146) (← links)
- The close-open mixed vehicle routing problem (Q1926744) (← links)
- MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
- Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery (Q1983730) (← links)
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem (Q2023966) (← links)
- A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
- An infeasible space exploring matheuristic for the production routing problem (Q2076821) (← links)
- Solution strategies for the vehicle routing problem with backhauls (Q2228411) (← links)
- Gossip algorithms for heterogeneous multi-vehicle routing problems (Q2252974) (← links)
- An adaptive large neighborhood search heuristic for the pollution-routing problem (Q2253352) (← links)
- Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints (Q2275601) (← links)
- A simulated annealing heuristic for the capacitated green vehicle routing problem (Q2298198) (← links)
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm (Q2465483) (← links)
- Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
