Approximation algorithms for the load-balanced capacitated vehicle routing problem
From MaRDI portal
Publication:2043586
DOI10.1007/s41980-020-00440-3OpenAlexW3081169684MaRDI QIDQ2043586
Farhad Rahmati, Haniyeh Fallah, Farzad Didehvar
Publication date: 2 August 2021
Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1846
fairnessapproximation algorithmscapacitated vehicle routing problemload-balanced capacitated vehicle routing problem
Related Items (2)
Spectral analysis of weighted neighborhood networks ⋮ Linear temporal public announcement logic: a new perspective for reasoning about the knowledge of multi-classifiers
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The balanced traveling salesman problem
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
- Approximation algorithms for scheduling unrelated parallel machines
- Balanced optimization problems
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees
- Improved bounds for vehicle routing solutions
- Exact algorithms for routing problems under vehicle capacity constraints
- An algorithm for the capacitated vehicle routing problem with route balancing
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- The balanced linear programming problem
- Distributed balanced partitioning via linear embedding
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- Algorithms for Capacitated Vehicle Routing
- Heuristics for vehicle routing on tree-like networks
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- Modeling and Solving the Capacitated Vehicle Routing Problem on Trees
- Bounds and Heuristics for Capacitated Routing Problems
- Savings by Split Delivery Routing
- Capacitated Vehicle Routing on Trees
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
- Balanced paths in acyclic networks: Tractable cases and related approaches
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
This page was built for publication: Approximation algorithms for the load-balanced capacitated vehicle routing problem
