Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
From MaRDI portal
Publication:4319751
DOI10.1287/opre.42.4.626zbMath0815.90066OpenAlexW2114844199MaRDI QIDQ4319751
Publication date: 27 June 1995
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.42.4.626
vehicle routingbranch-and-boundspanning treefleet schedulingminimum cost \(K\)-treevehicle capacity constraints
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
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, A variable neighbourhood search algorithm for the open vehicle routing problem, The \(k\)-dissimilar vehicle routing problem, Adaptive memory programming for the vehicle routing problem with multiple trips, Large neighborhood search for multi-trip vehicle routing, Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs, 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, 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, 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, An adaptive memory heuristic for a class of vehicle routing problems with minmax objective, 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, Vehicle routing for milk collection with gradual blending: a case arising in Chile, A design of the minimum cost ring-chain network with dual-homing survivability: A tabu search approach, 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, A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls, The open vehicle routing problem: algorithms, large-scale test problems, and computational results, DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic, Probabilistic diversification and intensification in local search for vehicle routing, A result on projection for the vehicle routing problem, Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations, The open vehicle routing problem with decoupling points, Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length, 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, Heuristic and exact algorithms for a min-max selective vehicle routing problem, Preprocessing to reduce vehicle capacity for routing problems, Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots, Ant colony system for a VRP with multiple time windows and multiple visits, Using global search heuristics for the capacity vehicle routing problem., Shape Measures of Random Increasing k-trees, Multiperiod location-routing with decoupled time scales, Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO, A multi-phase constructive heuristic for the vehicle routing problem with multiple trips., Vehicle routing problems with multiple trips, Algorithms and codes for dense assignment problems: The state of the art, Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics, Recent advances in vehicle routing exact algorithms, A GA based heuristic for the vehicle routing problem with multiple trips, Vehicle routing problems with multiple trips, Formulations and exact algorithms for the vehicle routing problem with time windows, Ejection chain and filter-and-fan methods in combinatorial optimization, Ejection chain and filter-and-fan methods in combinatorial optimization, Route relaxations on GPU for vehicle routing problems, New benchmark instances for the capacitated vehicle routing problem, COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW 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, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Active guided evolution strategies for large-scale vehicle routing problems with time windows, Exact algorithms for routing problems under vehicle capacity constraints, Branch and cut methods for network optimization, A tabu search algorithm for the open vehicle routing problem, A Lagrangian heuristic algorithm for a real-world train timetabling problem, Decomposition and dynamic cut generation in integer linear programming, Heuristic solution approaches for the cumulative capacitated vehicle routing problem, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, A tabu search algorithm for the heterogeneous fixed fleet 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, Lower bounding techniques for the degree-constrained network design problem, An ILP improvement procedure for the open vehicle routing problem, The multi-vehicle probabilistic covering tour problem, A mixed constrained (identical) vehicle routing problem for time minimisation, On the shortest path problem with negative cost cycles, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, A memetic algorithm for the multi trip vehicle routing problem, A unified solution framework for multi-attribute vehicle routing problems, A computational comparison of flow formulations for the capacitated location-routing problem, A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window, A Lagrangian relaxation approach for the multiple sequence alignment problem, A heuristic algorithm for the asymmetric capacitated vehicle routing problem, A genetic algorithm for service level based vehicle scheduling, Combined location-routing problems -- a neural network approach, Stronger \(K\)-tree relaxations for the vehicle routing problem, A hybrid evolution strategy for the open vehicle routing problem, An open vehicle routing problem metaheuristic for examining wide solution neighborhoods, A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem, Optimization of printed circuit board manufacturing: Integrated modeling and algorithms, A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows, A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls, The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations, Separating capacity constraints in the CVRP using tabu search, A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces, A cross-border transportation system under supply and demand constraints, A heuristic for cumulative vehicle routing using column generation
