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