Min-Max vs. Min-Sum vehicle routing: a worst-case analysis

DOI10.1016/J.EJOR.2014.07.025MaRDI QIDQ2629640zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

vehicle routing problemworst-case analysisMin-MaxMin-Sum

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06)

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

Cites work

• A general heuristic for vehicle routing problems
• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• A min-max vehicle routing problem with split delivery and heterogeneous demand
• A unified solution framework for multi-attribute vehicle routing problems
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• 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
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Solution of a min-max vehicle routing problem
• Solving min-max multi-depot vehicle routing problem
• State-space relaxation procedures for the computation of bounds to routing problems
• The m-Traveling Salesman Problem with Minmax Objective
• The truck dispatching problem
• The vehicle routing problem
• The vehicle routing problem. Latest advances and new challenges.

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
• On the Distance Constrained Vehicle Routing Problem
• Fleet resupply by drones for last-mile delivery
• A matheuristic for the MinMax capacitated open vehicle routing problem
• Planning sustainable routes: economic, environmental and welfare concerns
• The Humanitarian pickup and distribution problem
• Scheduling taxi services for a team of car relocators
• Direct \(k\)-routing versus cross-docking: worst-case results
• A lexicographic minimax approach to the vehicle routing problem with route balancing
• Modelling and a hybrid genetic algorithm for the equity-oriented worker assignment problem in seru production systems
• 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

Describes a project that uses

Uses Software

• VRP

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)