scientific article; zbMATH DE number 1749225
From MaRDI portal
Publication:4532228
Cited in
(50)- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- The school bus routing problem: a review
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- A TABU search heuristic for the team orienteering problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups
- Integer linear programming models for a cement delivery problem
- Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem
- Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A unified exact method for solving different classes of vehicle routing problems
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- Very large-scale vehicle routing: new test problems, algorithms, and results
- Sequential search and its application to vehicle-routing problems
- Path relinking for the vehicle routing problem
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
- A new ILP-based refinement heuristic for vehicle routing problems
- A column generation-based heuristic for a rehabilitation patient scheduling and routing problem
- Adjusting the order crossover operator for capacitated vehicle routing problems
- Hybrid metaheuristics: an introduction
- Vehicle routing problem with limited refueling halts using particle swarm optimization with greedy mutation operator
- The production routing problem: a review of formulations and solution algorithms
- The period vehicle routing problem and its extensions
- A comparative study of task assignment and path planning methods for multi-UGV missions
- An optimization algorithm for solving the rich vehicle routing problem based on variable neighborhood search and tabu search metaheuristics
- Genetic algorithm for combinatorial path planning: the subtour problem
- Combinatorial optimization and green logistics
- Combinatorial optimization and green logistics
- A multi-objective capacitated rural school bus routing problem with heterogeneous fleet and mixed loads
- Metaheuristics in combinatorial optimization
- The multi-depot vehicle routing problem with inter-depot routes
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector
- A general heuristic for vehicle routing problems
- Designing delivery districts for the vehicle routing problem with stochastic demands
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems
- Competitiveness based on logistic management: a real case study
- Synchronized routing of seasonal products through a production/distribution network
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A hybrid method based on linear programming and tabu search for routing of logging trucks
- Honey bees mating optimization algorithm for large scale vehicle routing problems
- Exact algorithms for routing problems under vehicle capacity constraints
- The multi-shift vehicle routing problem with overtime
- An exact solution framework for a broad class of vehicle routing problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4532228)