Approximation algorithms for the load-balanced capacitated vehicle routing problem
type: Item
instance of: scholarly article
title: Approximation algorithms for the load-balanced capacitated vehicle routing problem
author: Haniyeh Fallah
author: F. Didehvar
author: Farhad Rahmati
published in: Bulletin of the Iranian Mathematical Society
publication date: 2021-08-02T00:00:00Z
full work available at URL: https://arxiv.org/abs/1309.1846
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7377363
zbMATH Keywords: capacitated vehicle routing problem
zbMATH Keywords: load-balanced capacitated vehicle routing problem
zbMATH Keywords: approximation algorithms
zbMATH Keywords: fairness
describes a project that uses: VRP
MaRDI profile type: Publication
OpenAlex ID: W3081169684
cites work: The balanced linear programming problem
cites work: Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
cites work: Heuristics for unequal weight delivery problems with a fixed error guarantee
cites work: A new approximation algorithm for the capacitated vehicle routing problem on a tree
cites work: Distributed balanced partitioning via linear embedding
cites work: Branch-and-bound algorithms for the multi-product assembly line balancing problem
cites work: Exact algorithms for routing problems under vehicle capacity constraints
cites work: Heuristics for vehicle routing on tree-like networks
cites work: An algorithm for the capacitated vehicle routing problem with route balancing
cites work: Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
cites work: Improved bounds for vehicle routing solutions
cites work: Balanced paths in acyclic networks: Tractable cases and related approaches
cites work: Modeling and Solving the Capacitated Vehicle Routing Problem on Trees
cites work: Algorithms for capacitated vehicle routing
cites work: Savings by Split Delivery Routing
cites work: Q4198056
cites work: Q3799801
cites work: Bounds and Heuristics for Capacitated Routing Problems
cites work: Q4249536
cites work: Capacitated Vehicle Routing on Trees
cites work: The balanced traveling salesman problem
cites work: Q4532227
cites work: Approximation algorithms for scheduling unrelated parallel machines
cites work: Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
cites work: A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
cites work: Balanced optimization problems
cites work: Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
cites work: An approximation algorithm for the pickup and delivery vehicle routing problem on trees
cites work: Q4782696
DOI: 10.1007/S41980-020-00440-3
description: scientific article; zbMATH DE number 7377363