The vehicle routing-allocation problem: A unifying framework

DOI10.1007/BF02568604zbMath0856.90042MaRDI QIDQ1814811

E. M. Nascimento, John E. Beasley

Publication date: 23 February 1997

Published in: Top (Search for Journal in Brave)

zbMATH Keywords

travelling salesmancovering salesman problemcovering tour problemmedian tour problemvehicle routing-allocation problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items

Location-routing: issues, models and methods, The bi-objective insular traveling salesman problem with maritime and ground transportation costs, A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system, Metaheuristics and cooperative approaches for the bi-objective ring star problem, Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity, Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms, The vehicle routing problem with time windows and flexible delivery locations, Column Generation Algorithms for the Capacitated m-Ring-Star Problem, A stabilized column generation scheme for the traveling salesman subtour problem, The stop-and-drop problem in nonprofit food distribution networks, A branch-and-price algorithm for a vehicle routing with demand allocation problem, A simultaneous facility location and vehicle routing problem arising in health care logistics in the Netherlands, Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach, A location-routing problem in glass recycling, On Euclidean vehicle routing with allocation, Optimizing open-pit truck route based on minimization of time-varying transport energy consumption, Algorithms for the metric ring star problem with fixed edge-cost ratio, A variable neighborhood search for the last-mile delivery problem during major infectious disease outbreak, Heuristic algorithms for the multi-depot ring-star problem, Spatial coverage in routing and path planning problems, A taxonomical analysis, current methods and objectives on location-routing problems

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