The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement

DOI10.1016/j.cor.2016.01.008zbMath1349.90140OpenAlexW2299416751MaRDI QIDQ342348

Xingyin Wang, Rui Zhang, Bruce L. Golden, Edward A. Wasil

Publication date: 17 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.01.008

zbMATH Keywords

vehicle routingservice timessplit deliverymulti-depotmin-maxminimum service time requirement

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (4)

Vehicle dispatching for minimizing arrival conflicts in multi-supplier logistics network ⋮ A Green Vehicle Routing Problem with Multi-Depot, Multi-Tour, Heterogeneous Fleet and Split Deliveries: a mathematical model and heuristic approach ⋮ Using metaheuristics on the multi-depot vehicle routing problem with modified optimization criterion ⋮ Unnamed Item

Uses Software

• Gurobi
• LKH
• VRP

Cites Work

• Unnamed Item
• A min-max vehicle routing problem with split delivery and heterogeneous demand
• The vehicle routing problem. Latest advances and new challenges.
• Record breaking optimization results using the ruin and recreate principle
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
• The Truck Dispatching Problem
• Vehicle Routing
• Split delivery routing
• Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems
• The split delivery vehicle routing problem: Applications, algorithms, test problems, and computational results
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: The min-max split delivery multi-depot vehicle routing problem with minimum service time requirement