The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations

DOI10.1016/j.mcm.2003.08.011zbMath1082.90058OpenAlexW2086381556MaRDI QIDQ814246

Yupo Chan, S. F. Baker

Publication date: 6 February 2006

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2003.08.011

zbMATH Keywords

Clarke-Wright heuristicCombined facility location and routingMinimum K-treeMinimum spanning forestMultiple service frequencyMultiple traveling salesmenSplit delivery

Mathematics Subject Classification ID

Mixed integer programming (90C11) Continuous location (90B85) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A survey of variants and extensions of the location-routing problem, A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Minimization of the total traveling distance and maximum distance by using a transformed-based encoding EDA to solve the multiple traveling salesmen problem, A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study, A progressive filtering heuristic for the location-routing problem and variants, A survey of the standard location-routing problem, A particle swarm optimization algorithm with path relinking for the location routing problem, The location routing problem using electric vehicles with constrained distance, A taxonomical analysis, current methods and objectives on location-routing problems

Uses Software

• AMPL
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Integer linear programming formulation for a vehicle routing problem
• The vehicle routing problem: An overview of exact and approximate algorithms
• A new subtour elimination constraint for the vehicle routing problem
• A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• Restructuring of Swiss parcel delivery services
• Heuristic solutions to multi-depot location-routing problems
• Integer linear programming formulation for vehicle routing problems
• Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints
• Probabilistic Analyses and Practical Algorithms for Inventory-Routing Models
• Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
• Savings by Split Delivery Routing
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Structured Partitioning Problems
• Implementing vehicle routing algorithms
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Polynomial Algorithm for the Degree-Constrained Minimum K-Tree Problem
• Air Network Design for Express Shipment Service
• Traveling Salesman Facility Location Problems
• Networks and vehicle routing for municipal waste collection
• Multimodal Express Package Delivery: A Service Network Design Application
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• The traveling-salesman problem and minimum spanning trees: Part II
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands