A heuristic for the routing and carrier selection problem
From MaRDI portal
Publication:2371384
Recommendations
Cites work
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- A heuristic algorithm for the truckload and less-than-truckload problem
- Computer Solutions of the Traveling Salesman Problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- The Distribution Problem with Carrier Service: A Dual Based Penalty Approach
Cited in
(16)- 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
- A heuristic algorithm for the truckload and less-than-truckload problem
- The close-open mixed vehicle routing problem
- Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
- Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic
- Determine the optimal carrier selection for a logistics network based on multi-commodity reliability criterion
- Operational transportation planning of freight forwarding companies in horizontal coalitions
- Thirty years of heterogeneous vehicle routing
- Pricing and timing of consolidated deliveries in the presence of an express alternative: financial and environmental analysis
- Two heuristic solution concepts for the vehicle selection problem in line haul transports
- Iterated local search for the vehicle routing problem with a private fleet and a common carrier
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- A heuristic algorithm for hierarchical hub-and-spoke network of time-definite common carrier operation planning problem
- A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions
- Industrial aspects and literature survey: fleet composition and routing
This page was built for publication: A heuristic for the routing and carrier selection problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2371384)