The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation

DOI10.1016/J.EJOR.2022.05.053OpenAlexW4281907689MaRDI QIDQ2083950

Zefeng Lyu, Andrew Junfang Yu

Publication date: 17 October 2022

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2022.05.053

zbMATH Keywords

time windowslogisticsmixed-integer linear programmingpickup and deliverytransshipments

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Dynamic pickup and delivery problems
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
• A comparison of two meta-heuristics for the pickup and delivery problem with transshipment
• A large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipments
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
• New mixed integer-programming model for the pickup-and-delivery problem with transshipment
• A review of vehicle routing with simultaneous pickup and delivery
• Integer Programming Formulation of Traveling Salesman Problems
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• The Pickup And Delivery Problem With Time Windows And Transshipment

This page was built for publication: The pickup and delivery problem with transshipments: critical review of two existing models and a new formulation