Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
From MaRDI portal
Publication:2629640
DOI10.1016/j.ejor.2014.07.025zbMath1357.90173OpenAlexW2091614717MaRDI QIDQ2629640
Luca Bertazzi, Xingyin Wang, Bruce L. 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
Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items (13)
Planning sustainable routes: economic, environmental and welfare concerns ⋮ The bi-objective mixed capacitated general routing problem with different route balance criteria ⋮ The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement ⋮ Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach ⋮ Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems ⋮ A matheuristic for the MinMax capacitated open vehicle routing problem ⋮ Min-max cover of a graph with a small number of parts ⋮ Workload equity in vehicle routing: the impact of alternative workload resources ⋮ Scheduling taxi services for a team of car relocators ⋮ A lexicographic minimax approach to the vehicle routing problem with route balancing ⋮ Direct \(k\)-routing versus cross-docking: worst-case results ⋮ The Humanitarian Pickup and Distribution Problem ⋮ Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
Uses Software
Cites Work
- Unnamed Item
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- A general heuristic for vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A unified solution framework for multi-attribute vehicle routing problems
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- Solution of a Min-Max Vehicle Routing Problem
- State-space relaxation procedures for the computation of bounds to routing problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- The m-Traveling Salesman Problem with Minmax Objective
This page was built for publication: Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
