The single‐vehicle routing problem with unrestricted backhauls

DOI10.1002/NET.10067zbMath1037.90531OpenAlexW3125310543MaRDI QIDQ4808428

Haldun Süral, James H. Bookbinder

Publication date: 22 May 2003

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.10067

zbMATH Keywords

mixed pickup and deliveryprivate carriagevehicle routing with backhauls

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

A unified heuristic for a large class of vehicle routing problems with backhauls ⋮ Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder) ⋮ Vehicle routing with backhauls: review and research perspectives ⋮ Multiobjective vehicle routing problem with fixed delivery and optional collections ⋮ One-to-Many-to-One Single Vehicle Pickup and Delivery Problems ⋮ The single vehicle routing problem with deliveries and selective pickups ⋮ A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows ⋮ Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking ⋮ A hybrid heuristic based on General Variable Neighborhood Search for the Single Vehicle Routing Problem with Deliveries and Selective Pickups ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care

This page was built for publication: The single‐vehicle routing problem with unrestricted backhauls