Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
From MaRDI portal
Publication:4302932
DOI10.1287/trsc.28.2.162zbMath0807.90054MaRDI QIDQ4302932
Publication date: 21 August 1994
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.28.2.162
routing; polynomial time algorithms; single server; total waiting time; location-routing delivery men problems; sales-delivery men problem; traveling salesman criterion
90C35: Programming involving graphs or networks
90C60: Abstract computational complexity for mathematical programming problems
90B06: Transportation, logistics and supply chain management
90B22: Queues and service in operations research
Related Items
Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia, Profit-based latency problems on the line, Vehicle routing problems on a line-shaped network with release time constraints, Combined location-routing problems: A synthesis and future research directions, 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times., An approximability result of the multi-vehicle scheduling problem on a path with release and handling times, A compact model and tight bounds for a combined location-routing problem, A particle swarm optimization algorithm with path relinking for the location routing problem, A metaheuristic to solve a location-routing problem with nonlinear costs
