Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
From MaRDI portal
Recommendations
- Two exact algorithms for the vehicle routing problem on trees
- Capacitated Vehicle Routing on Trees
- A polynomial-time exact algorithm for k-depot capacitated vehicle routing problem on a tree
- Stronger K-tree relaxations for the vehicle routing problem
- Vehicle Routing with Time Windows: Two Optimization Algorithms
Cited in
(only showing first 100 items - show all)- A Lagrangian relaxation approach for the multiple sequence alignment problem
- Combined location-routing problems -- a neural network approach
- A hybrid evolution strategy for the open vehicle routing problem
- An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls
- A result on projection for the vehicle routing problem
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- A genetic algorithm for service level based vehicle scheduling
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach
- Using global search heuristics for the capacity vehicle routing problem.
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- Optimization of printed circuit board manufacturing: Integrated modeling and algorithms
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- Separating capacity constraints in the CVRP using tabu search
- Stochastic local search with learning automaton for the swap-body vehicle routing problem
- An efficient implementation of a static move descriptor-based local search heuristic
- The open vehicle routing problem with decoupling points
- Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length
- Route relaxations on GPU for vehicle routing problems
- New benchmark instances for the capacitated vehicle routing problem
- A study on the effect of the asymmetry on real capacitated vehicle routing problems
- A hierarchical algorithm for the planar single-facility location routing problem
- Active guided evolution strategies for large-scale vehicle routing problems with time windows
- A computational comparison of flow formulations for the capacitated location-routing problem
- Stronger K-tree relaxations for the vehicle routing problem
- A cross-border transportation system under supply and demand constraints
- On the complexity of the \(k\)-customer vehicle routing problem
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- An exact algorithm for the capacitated shortest spanning arborescence
- Routing problems: A bibliography
- Probabilistic diversification and intensification in local search for vehicle routing
- Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO
- Algorithms and codes for dense assignment problems: The state of the art
- Vehicle routing for milk collection with gradual blending: a case arising in Chile
- A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
- A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces
- A heuristic for cumulative vehicle routing using column generation
- A variable neighbourhood search algorithm for the open vehicle routing problem
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots
- Formulations and exact algorithms for the vehicle routing problem with time windows
- A Lagrangian heuristic algorithm for a real-world train timetabling problem
- Decomposition and dynamic cut generation in integer linear programming
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A note on relatives to the Held and Karp 1-tree problem
- A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
- A new tabu search algorithm for the vehicle routing problem with backhauls
- A memetic algorithm for the multi trip vehicle routing problem
- A unified solution framework for multi-attribute vehicle routing problems
- A survey of variants and extensions of the location-routing problem
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- A variable neighborhood search algorithm for the vehicle routing problem with multiple trips
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM
- Lower bounding techniques for the degree-constrained network design problem
- The k-dissimilar vehicle routing problem
- Large neighborhood search for multi-trip vehicle routing
- A hybrid algorithm for a class of vehicle routing problems
- A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows
- A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows
- Ant colony system for a VRP with multiple time windows and multiple visits
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
- Disrupted capacitated vehicle routing problem with order release delay
- scientific article; zbMATH DE number 3952495 (Why is no real title available?)
- A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
- Multiperiod location-routing with decoupled time scales
- Minisum multipurpose trip location problem on trees
- Shape measures of random increasing k-trees
- A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem
- Heuristic solution approaches for the cumulative capacitated vehicle routing problem
- Vehicle routing problems with multiple trips
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Ejection chain and filter-and-fan methods in combinatorial optimization
- Vehicle routing problems with multiple trips
- Branch and cut methods for network optimization
- On the shortest path problem with negative cost cycles
- DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic
- Safe and secure vehicle routing: a survey on minimization of risk exposure
- Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows
- An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls
- Preprocessing to reduce vehicle capacity for routing problems
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- An improved hybrid genetic search with data mining for the CVRP
- Models and algorithms for multiagent hierarchical routing with time windows
- An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem
- Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- A tabu search algorithm for the open vehicle routing problem
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- The multi-vehicle probabilistic covering tour problem
- A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
- Adaptive memory programming for the vehicle routing problem with multiple trips
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows
- A note on ``Coordination of production and distribution planning by P. Chandra and M. L. Fisher
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- The open vehicle routing problem: algorithms, large-scale test problems, and computational results
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
This page was built for publication: Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319751)
