Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem
From MaRDI portal
Publication:1014990
DOI10.1016/j.ejor.2008.06.042zbMath1159.90311OpenAlexW1560495233MaRDI QIDQ1014990
Herbert Kopfer, Marta Anna Krajewska
Publication date: 30 April 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2008.06.042
Related Items (10)
Operational transportation planning of freight forwarding companies in horizontal coalitions ⋮ Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests ⋮ Matching formulation of the staff transfer problem: meta-heuristic approaches ⋮ A matheuristic for the air transportation freight forwarder service problem ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ Collaborative transportation planning of less-than-truckload freight ⋮ A new simulated annealing algorithm for the freight consolidation problem ⋮ Adaptive demand peak management in online transport process planning ⋮ Request evaluation strategies for carriers in auction-based collaborations
Uses Software
Cites Work
- Unnamed Item
- The pickup and delivery problem with time windows
- A heuristic algorithm for the truckload and less-than-truckload problem
- A new tabu search algorithm for the vehicle routing problem with backhauls
- A tabu search heuristic for the truck and trailer routing problem
- Drive: Dynamic Routing of Independent Vehicles
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
This page was built for publication: Transportation planning in freight forwarding companies: Tabu search algorithm for the integrated operational transportation planning problem
