A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment

From MaRDI portal
Publication:1761180

DOI10.1016/j.cor.2011.11.016zbMath1251.90059OpenAlexW2083741555MaRDI QIDQ1761180

Jonathan F. Bard, Yuan Qu

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.11.016




Related Items (24)

A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locationsAn adaptive large neighborhood search for the two-echelon multiple-trip vehicle routing problem with satellite synchronizationThe dial-A-ride problem with transfersVehicle routing with cross-dock selectionA matheuristic based on large neighborhood search for the vehicle routing problem with cross-dockingAn adaptive large neighborhood search for an E-grocery delivery routing problemA matheuristic for solving inventory sharing problemsThe vessel swap-body routing problemA survey of adaptive large neighborhood search algorithms and applicationsA dynamic scheduling process and methodology using route deviations and synchronized passenger transfers for flexible feeder transit servicesExact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline ParcelsThe rendezvous vehicle routing problemDelivery systems with crowd‐sourced drivers: A pickup and delivery problem with transfersEfficient feasibility testing for request insertion in the pickup and delivery problem with transfersNew mixed integer-programming model for the pickup-and-delivery problem with transshipmentAn on-demand same-day delivery service using direct peer-to-peer transshipment strategiesA comparison of two meta-heuristics for the pickup and delivery problem with transshipmentA large neighborhood search for the pickup and delivery problem with time windows, split loads and transshipmentsThe pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approachModeling and solving the multimodal car- and ride-sharing problemMeta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood searchThe multiple traveling salesman problem with backup coverageA branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routesThe pickup and delivery problem with transshipments: critical review of two existing models and a new formulation



Cites Work


This page was built for publication: A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment