Implementing vehicle routing algorithms

DOI10.1002/NET.3230070203MaRDI QIDQ4132010zbMATH OpenOpenAlexFDO

Authors

Publication date 1977

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230070203

Mathematics Subject Classification ID

Integer programming (90C10) Programming involving graphs or networks (90C35)

Cites work

• An Algorithm for the Traveling Salesman Problem
• Computer Solutions of the Traveling Salesman Problem
• scientific article; zbMATH DE number 3304538 (Why is no real title available?)
• The truck dispatching problem

Cited in

(59)

• The fleet size and mix vehicle routing problem
• Implementation techniques for the vehicle routing problem
• The savings algorithm for the vehicle routing problem
• A result on projection for the vehicle routing problem
• A modular algorithm for an extended vehicle scheduling problem
• Minimal spanning trees and partial sorting
• The application of discrete programming to the design of delivery systems in large agglomerations
• Polyhedral results for a vehicle routing problem
• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• Practical aspects of route planning for magazine and newspaper wholesalers
• A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
• A heuristic solution to the warehouse location-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
• The impact of rolling horizon planning on the cost of industrial fishing activity.
• Heuristic solutions to multi-depot location-routing problems
• Search strategies for the feeder bus network design problem
• The shared customer collaboration vehicle routing problem
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• A framing link based tabu search algorithm for large-scale multidepot vehicle routing problems
• Location routing problems on trees
• A study on the effect of the asymmetry on real capacitated vehicle routing problems
• Semi-greedy heuristics: An empirical study
• Heuristic methods and applications: A categorized survey
• A capacitated general routing problem on mixed networks
• A new heuristic for the period traveling salesman problem
• A heuristic and lower bound for a multi-depot routing problem
• A tabu search heuristic for the multi-depot vehicle routing problem
• A way to optimally solve a green time-dependent vehicle routing problem with time windows
• Integer linear programming formulations of multiple salesman problems and its variations
• Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem
• 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
• The period vehicle routing problem and its extensions
• The ALGACEA‐1 method for the capacitated vehicle routing problem
• The Multi-Depot Routing Allocation Problem
• Solution Improvement Heuristics for the Vehicle Routing and Scheduling Problem with Time Window Constraints
• The Minimum Spanning Tree Problem with Time Window Constraints
• A statistical approach to the tsp
• A New Heuristic for the Multi-Depot Vehicle Routing Problem that Improves upon Best-Known Solutions
• A branch and bound algorithm for the capacitated vehicle routing problem
• Design of a reverse logistics network for recyclable collection in Nova Scotia using compaction trailers
• Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands
• Delay-resistant robust vehicle routing with heterogeneous time windows
• A novel mathematical modeling approach for integrating a periodic vehicle routing problem and cross-docking system
• Data-driven dynamic police patrolling: an efficient Monte Carlo tree search
• A tutorial on Branch-Price-and-Cut algorithms
• Beyond fifty years of vehicle routing: insights into the history and the future
• A parallel insert method for the capacitated arc routing problem
• A comparison of techniques for solving the fleet size and mix vehicle routing problem
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
• The multi-depot vehicle routing problem with inter-depot routes
• 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
• Exact algorithms for routing problems under vehicle capacity constraints

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)