Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
From MaRDI portal
Publication:4319751
DOI10.1287/opre.42.4.626zbMath0815.90066MaRDI 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 routing; branch-and-bound; spanning tree; fleet scheduling; minimum cost \(K\)-tree; vehicle capacity constraints
90C35: Programming involving graphs or networks
90B06: Transportation, logistics and supply chain management
90B35: Deterministic scheduling theory in operations research
Related Items
Ejection chain and filter-and-fan methods in combinatorial optimization, Branch and cut methods for network optimization, Models, relaxations and exact approaches for the capacitated vehicle routing problem, A tabu search algorithm for the open vehicle routing problem, 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, Recent advances in vehicle routing exact algorithms, A GA based heuristic for the vehicle routing problem with multiple trips, A mixed constrained (identical) vehicle routing problem for time minimisation, 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, Active guided evolution strategies for large-scale vehicle routing problems with time windows, Stronger \(K\)-tree relaxations for the vehicle routing problem, A cross-border transportation system under supply and demand constraints, 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, Algorithms and codes for dense assignment problems: The state of the art, 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, COMPARISON OF SYSTEMS BASED ON EVOLUTIONARY SEARCH AND SIMULATED ANNEALING TO SOLVE THE VRPTW PROBLEM, 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
