Precedence constrained pickup and delivery with split loads-Reference-Cited by-同舟云学术

Precedence constrained pickup and delivery with split loads

Published:2012-02 Issue:1 Volume:15 Page:1-14
ISSN:1367-5567
Container-title:International Journal of Logistics Research and Applications
language:en
Short-container-title:International Journal of Logistics Research and Applications

Author:

Nowak Maciek¹,Hewitt Mike²,White Chelsea C.³

Affiliation:

1. a Department of Information Systems and Operations Management , Loyola University Chicago , 1 E. Pearson Avenue, Chicago , IL , 60611 , USA

2. b Industrial and Systems Engineering , Rochester Institute of Technology , 81 Lomb Memorial Drive, Rochester , NY , 14623 , USA

3. c School of Industrial and Systems Engineering , Georgia Institute of Technology , 765 Ferst Drive, NW, Atlanta , GA , 30332 , USA

Publisher

Informa UK Limited

Subject

Management Science and Operations Research,Management Information Systems,Business and International Management,Strategy and Management,Management of Technology and Innovation

Link

https://www.tandfonline.com/doi/pdf/10.1080/13675567.2012.660476

Reference18 articles.

1. An Overview on the Split Delivery Vehicle Routing Problem

2. A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem

3. A unified exact method for solving different classes of vehicle routing problems

4. Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Artificial intelligence in supply chain and operations management: a multiple case study research;International Journal of Production Research;2023-07-12

2. A Compact Arc-Based ILP Formulation for the Pickup and Delivery Problem with Divisible Pickups and Deliveries;Transportation Science;2021-03

3. Efficient Routing for Precedence-Constrained Package Delivery for Heterogeneous Vehicles;IEEE Transactions on Automation Science and Engineering;2020-01

4. Robust optimization of dynamic route planning in same‐day delivery networks with one‐time observation of new demand;Networks;2019-04-19

5. Heuristic algorithm for the Split-Demand One-Commodity Pickup-and-Delivery Travelling Salesman Problem;Computers & Operations Research;2018-09