A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing

DOI10.1287/TRSC.29.1.45MaRDI QIDQ4836841zbMATH OpenOpenAlexFDO

Authors Marshall L. Fisher, Baoxing Tang, Zhang Zheng

Publication date 21 June 1995

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.29.1.45

zbMATH Keywords

fleet of vehiclesnetwork flow

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Recommendations

• New savings based algorithms for time constrained pickup and delivery of full truckloads.
• The pickup delivery location problem on networks
• scientific article; zbMATH DE number 1189261
• scientific article; zbMATH DE number 3952495
• Pickup and Delivery of Partial Loads with “Soft” Time Windows

Cited in

(8)

• New savings based algorithms for time constrained pickup and delivery of full truckloads.
• Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries
• Routing problems: A bibliography
• A Lagrangian relaxation-based heuristic for the vehicle routing with full container load
• Heuristics for routes generation in pickup and delivery problem
• scientific article; zbMATH DE number 1189261 (Why is no real title available?)
• Package routing in transportation networks with fixed vehicle schedules
• A dynamic logistics coordination model for evacuation and support in disaster response activities

This page was built for publication: A Network Flow Based Heuristic for Bulk Pickup and Delivery Routing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4836841)