Implementing vehicle routing algorithms
From MaRDI portal
Publication:4132010
DOI10.1002/net.3230070203zbMath0359.90054OpenAlexW2058892401MaRDI QIDQ4132010
No author found.
Publication date: 1977
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230070203
Related Items
Design of a reverse logistics network for recyclable collection in Nova Scotia using compaction trailers, A heuristic solution to the warehouse location-routing problem, The fleet size and mix vehicle routing problem, Implementation techniques for the vehicle routing problem, A branch-and-cut algorithm for vehicle routing problems, The general multi-retailer EOQ problem with vehicle routing costs, A TSSP+1 decomposition strategy for the vehicle routing problem, A capacitated general routing problem on mixed networks, A new heuristic for the period traveling salesman problem, The savings algorithm for the vehicle routing problem, The multi-depot vehicle routing problem with inter-depot routes, The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation, Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm, A bi-objective model for the used oil location-routing problem, A heuristic and lower bound for a multi-depot routing problem, A tabu search heuristic for the multi-depot vehicle routing problem, A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions, A result on projection for the vehicle routing problem, The shared customer collaboration vehicle routing problem, The Multi-Depot Routing Allocation Problem, Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem, Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints, Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands, The Minimum Spanning Tree Problem with Time Window Constraints, The impact of rolling horizon planning on the cost of industrial fishing activity., Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, A modular algorithm for an extended vehicle scheduling problem, Minimal spanning trees and partial sorting, A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems, Integer programming formulations for the multi-depot vehicle routing problem: Comments on a paper by Kulkarni and Bhave, Recent advances in vehicle routing exact algorithms, The application of discrete programming to the design of delivery systems in large agglomerations, Polyhedral results for a vehicle routing problem, Location routing problems on trees, The Period Vehicle Routing Problem and its Extensions, An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem, A way to optimally solve a green time-dependent vehicle routing problem with time windows, The vehicle routing problem: An overview of exact and approximate algorithms, A study on the effect of the asymmetry on real capacitated vehicle routing problems, Exact algorithms for routing problems under vehicle capacity constraints, Integer linear programming formulations of multiple salesman problems and its variations, A branch and bound algorithm for the capacitated vehicle routing problem, Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem, A statistical approach to the tsp, Practical aspects of route planning for magazine and newspaper wholesalers, The ALGACEA‐1 method for the capacitated vehicle routing problem, Semi-greedy heuristics: An empirical study, Heuristic methods and applications: A categorized survey, A multi-level composite heuristic for the multi-depot vehicle fleet mix problem, A parallel insert method for the capacitated arc routing problem, A comparison of techniques for solving the fleet size and mix vehicle routing problem, Heuristic solutions to multi-depot location-routing problems, The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations, Search strategies for the feeder bus network design problem
Cites Work
