A heuristic for the routing and carrier selection problem
From MaRDI portal
Publication:2371384
DOI10.1016/j.ejor.2006.10.013zbMath1179.90029OpenAlexW2028994679MaRDI QIDQ2371384
Jacques Renaud, Fayez F. Boctor, Marie-Claude Bolduc
Publication date: 4 July 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2006.10.013
Related Items (12)
Operational transportation planning of freight forwarding companies in horizontal coalitions ⋮ Iterated local search for the vehicle routing problem with a private fleet and a common carrier ⋮ Thirty years of heterogeneous vehicle routing ⋮ Pricing and timing of consolidated deliveries in the presence of an express alternative: financial and environmental analysis ⋮ The close-open mixed vehicle routing problem ⋮ Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet ⋮ A tabu search heuristic for the vehicle routing problem with private fleet and common carrier ⋮ A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars ⋮ Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion
Cites Work
- A heuristic algorithm for the truckload and less-than-truckload problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- The Distribution Problem with Carrier Service: A Dual Based Penalty Approach
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
This page was built for publication: A heuristic for the routing and carrier selection problem
