New savings based algorithms for time constrained pickup and delivery of full truckloads.

DOI10.1016/S0377-2217(02)00650-1zbMath1045.90006WikidataQ59389830 ScholiaQ59389830MaRDI QIDQ1410309

Richard F. Hartl, Marc Reimann, Manfred Gronalt

Publication date: 14 October 2003

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

zbMATH Keywords

Routing; Transportation; Logistics; Distribution

Mathematics Subject Classification ID

90B06: Transportation, logistics and supply chain management

90B20: Traffic problems in operations research

Related Items

Effective truckload dispatch decision methods with incomplete advance load information, A local search heuristic for the pre- and end-haulage of intermodal container terminals, Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration, Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries, Integrated planning of loaded and empty container movements, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Vehicle routing with full loads
• The pickup and delivery problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Stochastic Formulation of the Dynamic Assignment Problem, with an Application to Truckload Motor Carriers
• Fleet Sizing and Empty Equipment Redistribution for Center-Terminal Transportation Networks
• The General Pickup and Delivery Problem