Real-time split-delivery pickup and delivery time window problems with transfers

DOI10.1007/S10100-007-0035-XzbMath1153.90365OpenAlexW1981577027MaRDI QIDQ940817

Salman Awan, Sam R. Thangiah, Adel Fergany

Publication date: 3 September 2008

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-007-0035-x

zbMATH Keywords

vehicle routingdial-a-ridereal-timepickup and deliverysplit-delivery

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (9)

Heuristics for routes generation in pickup and delivery problem ⋮ The dial-A-ride problem with transfers ⋮ Vehicle routing problems with split deliveries ⋮ A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment ⋮ Unnamed Item ⋮ A comparison of two meta-heuristics for the pickup and delivery problem with transshipment ⋮ Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads ⋮ A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes ⋮ A new VRPPD model and a hybrid heuristic solution approach for e-tailing

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• The traveling salesman problem: An overview of exact and approximate algorithms
• The vehicle routing problem: An overview of exact and approximate algorithms
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• Routing problems: A bibliography
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A guide to vehicle routing heuristics
• The General Pickup and Delivery Problem
• Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching

This page was built for publication: Real-time split-delivery pickup and delivery time window problems with transfers