The vehicle routing-allocation problem: A unifying framework

DOI10.1007/BF02568604zbMath0856.90042MaRDI QIDQ1814811

John E. Beasley, E. M. Nascimento

Publication date: 23 February 1997

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

travelling salesman; covering salesman problem; covering tour problem; median tour problem; vehicle routing-allocation problem

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C10: Integer programming

90C05: Linear programming

90B06: Transportation, logistics and supply chain management

90C27: Combinatorial optimization

Related Items

Location-routing: issues, models and methods, Heuristic algorithms for the multi-depot ring-star problem, On Euclidean vehicle routing with allocation, A stabilized column generation scheme for the traveling salesman subtour problem, Metaheuristics and cooperative approaches for the bi-objective ring star problem, Column Generation Algorithms for the Capacitated m-Ring-Star Problem

Cites Work

• Unnamed Item
• A note on the prize collecting traveling salesman problem
• The selective travelling salesman problem
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• The hierarchical network design problem
• Reducing the hierarchical network design problem
• The hierarchical network design problem with transshipment facilities
• The median tour and maximal covering tour problems: Formulations and heuristics
• Approximation algorithms for the Geometric Covering Salesman Problem
• The Median Shortest Path Problem: A Multiobjective Approach to Analyze Cost vs. Accessibility in the Design of Transportation Networks
• Generalized Travelling Salesman Problem Through n Sets Of Nodes: An Integer Programming Approach
• The Hierarchical Network Design Problem: A New Formulation and Solution Procedures
• The Design of a Hierarchical Transportation Network with Transshipment Facilities
• The prize collecting traveling salesman problem
• The Covering Salesman Problem
• Efficient Algorithms for Solving the Shortest Covering Path Problem