Pre-selection strategies for dynamic collaborative transportation planning problems

DOI10.1007/978-3-319-28697-6_73MaRDI QIDQ2806998zbMATH OpenOpenAlexFDO

Authors Kristian Schopka, Herbert Kopfer

Publication date 19 May 2016

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28697-6_73

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Collaborative transportation planning of less-than-truckload freight
• Request-allocation in dynamic collaborative transportation planning problems
• Collaborative vehicle routing: a survey
• Collaborative transportation planning with forwarding limitations
• Collaborative transportation with overlapping coalitions

Cites work

• A general heuristic for vehicle routing problems
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• A heuristic for the multiple tour maximum collection problem
• Collaborating freight forwarding enterprises
• The selective travelling salesman problem

Cited in

(4)

• Collaborative transportation planning of less-than-truckload freight
• Request-allocation in dynamic collaborative transportation planning problems
• Request evaluation strategies for carriers in auction-based collaborations
• Pre-auction lane selection in an integrated production–distribution planning problem

This page was built for publication: Pre-selection strategies for dynamic collaborative transportation planning problems

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