A min-max vehicle routing problem with split delivery and heterogeneous demand

DOI10.1007/s11590-012-0571-8zbMath1280.90017OpenAlexW2021604865MaRDI QIDQ376008

Ertan Yakıcı, Orhan Karasakal

Publication date: 1 November 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-012-0571-8

zbMATH Keywords

optimizationsplit deliveryheterogeneous demandmin-max vehicle routing

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06)

Related Items

Min-Max vs. Min-Sum vehicle routing: a worst-case analysis ⋮ The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement ⋮ A hybrid algorithm for the drilling rig routing problem ⋮ Minisum and maximin aerial surveillance over disjoint rectangles

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A column generation approach to the heterogeneous fleet vehicle routing problem
• The vehicle routing problem. Latest advances and new challenges.
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• Separating capacity constraints in the CVRP using tabu search
• A time-based pheromone approach for the ant system
• A sweep-based algorithm for the fleet size and mix vehicle routing problem
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
• Routing problems: A bibliography
• A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• Solution of a Min-Max Vehicle Routing Problem
• Approximation results for min-max path cover problems in vehicle routing
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A heuristic column generation method for the heterogeneous fleet VRP
• The m-Traveling Salesman Problem with Minmax Objective
• Approximations for minimum and min-max vehicle routing problems