The probabilistic uncapacitated open vehicle routing location problem

DOI10.1002/net.22147zbMath1529.90011OpenAlexW4362665816MaRDI QIDQ6179724

Wei Yu, Igor Averbakh

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22147

zbMATH Keywords

approximation algorithmlocationopen vehicle routingprobabilistic location-routingtraveling salesman location problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• A survey of recent research on location-routing problems
• A multi-start algorithm for a balanced real-world open vehicle routing problem
• The open vehicle routing problem: algorithms, large-scale test problems, and computational results
• An ILP improvement procedure for the open vehicle routing problem
• A hybrid evolution strategy for the open vehicle routing problem
• The open vehicle routing problem with decoupling points
• A variable neighbourhood search algorithm for the open vehicle routing problem
• A taxonomical analysis, current methods and objectives on location-routing problems
• Technical Note—Approximation Algorithms for VRP with Stochastic Demands
• Minisum location of a traveling salesman
• A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks
• Probabilistic a priori routing-location problems
• Traveling Salesman Facility Location Problems
• Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree
• Modeling uncertainty. An examination of stochastic theory, methods, and applications
• An improved formulation for the multi-depot open vehicle routing problem

This page was built for publication: The probabilistic uncapacitated open vehicle routing location problem