A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles

DOI10.1016/S0377-2217(99)00235-0zbMath0961.90008MaRDI QIDQ1582189

Stefan Irnich

Publication date: 3 October 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

transportationmodelingpickup and deliveryhub

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Related Items

Routing relatively few customers per route, Thirty years of heterogeneous vehicle routing, The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation, A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries, Factory gate pricing: an analysis of the Dutch retail distribution, Industrial aspects and literature survey: fleet composition and routing, Exact solutions for the collaborative pickup and delivery problem, Implicit depot assignments and rotations in vehicle routing heuristics, A grouping genetic algorithm for multi depot pickup and delivery problems with time windows and heterogeneous vehicle fleets, Planning models for long-haul operations of postal and express shipment companies

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding maximum cliques in arbitrary and in special graphs
• The pickup and delivery problem with time windows
• Enhancing an algorithm for set covering problems
• A genetic algorithm for the set covering problem
• Simple Lagrangian heuristic for the set covering problem
• An algorithm for set covering problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Drive: Dynamic Routing of Independent Vehicles
• Routing with time windows by column generation
• Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem
• Air Network Design for Express Shipment Service
• On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
• A Branch-and-Price Algorithm for the Generalized Assignment Problem
• A heuristic algorithm for the set covering problem
• The General Pickup and Delivery Problem
• A Heuristic Method for the Set Covering Problem
• A branch and bound algorithm for the maximum clique problem