Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path

DOI10.1287/trsc.28.2.162zbMath0807.90054OpenAlexW2100651705MaRDI QIDQ4302932

Igor Averbakh, Oded Berman

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

zbMATH Keywords

routingpolynomial time algorithmssingle servertotal waiting timelocation-routing delivery men problemssales-delivery men problemtraveling salesman criterion

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Transportation, logistics and supply chain management (90B06) Queues and service in operations research (90B22)

Related Items

An approximability result of the multi-vehicle scheduling problem on a path with release and handling times, Distribution network design on the battlefield, A compact model and tight bounds for a combined location-routing problem, The latency location-routing problem, Solving a multiobjective location routing problem with a metaheuristic based on tabu search. Application to a real case in Andalusia, Modeling emergency response operations: a theory building survey, 2-approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times., Emergency path restoration problems, Profit-based latency problems on the line, A particle swarm optimization algorithm with path relinking for the location routing problem, A metaheuristic to solve a location-routing problem with nonlinear costs, Unnamed Item, Single-vehicle scheduling problems with release and service times on a line, Vehicle routing problems on a line-shaped network with release time constraints, Combined location-routing problems: A synthesis and future research directions, A taxonomical analysis, current methods and objectives on location-routing problems