Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
DOI10.1016/J.EJOR.2014.07.025zbMATH Open1357.90173OpenAlexW2091614717MaRDI QIDQ2629640FDOQ2629640
Authors: Luca Bertazzi, Xingyin Wang, Bruce Golden 
Publication date: 6 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.07.025
Recommendations
- Approximations for minimum and min-max vehicle routing problems
- A worst-case analysis for the split delivery vehicle routing problem with minimum delivery amounts
- Solution of a min-max vehicle routing problem
- Improved approximation algorithms for min-max and minimum vehicle routing problems
- Approximation results for min-max path cover problems in vehicle routing
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- A minimax approach to a simple routing problem
- Computational Science – ICCS 2005
- Worst-Case Analysis of Heuristics for Multidepot Capacitated Vehicle Routing Problems
Deterministic network models in operations research (90B10) Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06)
Cites Work
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- A unified solution framework for multi-attribute vehicle routing problems
- The truck dispatching problem
- The vehicle routing problem
- A general heuristic for vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- Solving min-max multi-depot vehicle routing problem
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- New route relaxation and pricing strategies for the vehicle routing problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- Solution of a min-max vehicle routing problem
- State-space relaxation procedures for the computation of bounds to routing problems
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- The m-Traveling Salesman Problem with Minmax Objective
Cited In (16)
- Exact algorithms for a selective vehicle routing problem where the longest route is minimized
- Workload equity in vehicle routing: the impact of alternative workload resources
- Fleet resupply by drones for last-mile delivery
- On the Distance Constrained Vehicle Routing Problem
- A matheuristic for the MinMax capacitated open vehicle routing problem
- The Humanitarian pickup and distribution problem
- Planning sustainable routes: economic, environmental and welfare concerns
- Scheduling taxi services for a team of car relocators
- Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems
- Direct \(k\)-routing versus cross-docking: worst-case results
- A lexicographic minimax approach to the vehicle routing problem with route balancing
- The bi-objective mixed capacitated general routing problem with different route balance criteria
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
- The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Min-max cover of a graph with a small number of parts
Uses Software
This page was built for publication: Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2629640)
