Pages that link to "Item:Q4834331"
From MaRDI portal
The following pages link to A Tabu Search Heuristic for the Vehicle Routing Problem (Q4834331):
Displaying 50 items.
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints (Q319206) (← links)
- The multi-compartment vehicle routing problem with flexible compartment sizes (Q319854) (← links)
- The vehicle-routing problem with time windows and driver-specific times (Q322409) (← 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)
- A vehicle routing problem with flexible time windows (Q337177) (← links)
- Scheduled penalty variable neighborhood search (Q337204) (← links)
- An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
- A two level metaheuristic for the operating room scheduling and assignment problem (Q337329) (← links)
- A solution method for a two-layer sustainable supply chain distribution model (Q337368) (← links)
- Minimum cost VRP with time-dependent speed data and congestion charge (Q337447) (← 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)
- Vehicle routing problem with stochastic travel times including soft time windows and service costs (Q339568) (← links)
- Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing (Q357949) (← links)
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← 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)
- Using local search to speed up filtering algorithms for some NP-hard constraints (Q545546) (← links)
- Routing problems with loading constraints (Q610992) (← links)
- A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem (Q613548) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Local search heuristics for the probabilistic dial-a-ride problem (Q657055) (← links)
- A tabu search algorithm for the open vehicle routing problem (Q703907) (← links)
- Single-point stochastic search algorithms for the multi-level lot-sizing problem (Q707016) (← links)
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem (Q709119) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- An efficient heuristic for reliability design optimization problems (Q732879) (← links)
- Modeling reverse logistic tasks within closed-loop supply chains: an example from the automotive industry (Q819103) (← links)
- A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636) (← links)
- A multi-objective evolutionary algorithm for examination timetabling (Q842554) (← links)
- Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
- The multi-depot vehicle routing problem with inter-depot routes (Q852937) (← links)
- Improved formulation, branch-and-cut and tabu search heuristic for single loop material flow system design (Q857364) (← links)
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding (Q869001) (← links)
- Comparison of agent-based scheduling to look-ahead heuristics for real-time transportation problems (Q872241) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem (Q881527) (← links)
- Competitiveness based on logistic management: a real case study (Q889527) (← links)
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← 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)
- The capacity and distance constrained plant location problem (Q954059) (← links)
- Ant colony optimization for the two-dimensional loading vehicle routing problem (Q955597) (← links)
- Solving the truck and trailer routing problem based on a simulated annealing heuristic (Q959516) (← links)
- Honey bees mating optimization algorithm for large scale vehicle routing problems (Q968387) (← links)
- The undirected capacitated arc routing problem with profits (Q975994) (← links)
- Vehicle routing with stochastic time-dependent travel times (Q976985) (← links)
