A tabu search heuristic for the vehicle routing problem with private fleet and common carrier
From MaRDI portal
Publication:1026772
DOI10.1016/j.ejor.2008.09.009zbMath1163.90360OpenAlexW2078141759MaRDI QIDQ1026772
Jean-François Côté, Jean-Yves Potvin
Publication date: 29 June 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.09.009
Related Items
Shared capacity routing problem -- an omni-channel retail study ⋮ Operational transportation planning of freight forwarding companies in horizontal coalitions ⋮ New results for the directed profitable rural postman problem ⋮ A mathematical programming-based heuristic for the production routing problem with transshipments ⋮ The close-open mixed vehicle routing problem ⋮ The vehicle routing problem with service level constraints ⋮ A concise guide to existing and emerging vehicle routing problem variants ⋮ Vehicle routing problem with uniform private fleet and common carrier: a node subset heuristic ⋮ An ILP-refined tabu search for the directed profitable rural postman problem ⋮ Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier ⋮ A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement ⋮ A stochastic multi-stage fixed charge transportation problem: worst-case analysis of the rolling horizon approach ⋮ Direct \(k\)-routing versus cross-docking: worst-case results ⋮ Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on the prize collecting traveling salesman problem
- A heuristic algorithm for the truckload and less-than-truckload problem
- A heuristic for the routing and carrier selection problem
- On Some Generalizations of the Travelling-Salesman Problem
- The prize collecting traveling salesman problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Parallel iterative search methods for vehicle routing problems
- A tabu search heuristic for periodic and multi-depot vehicle routing problems
- A unified tabu search heuristic for vehicle routing problems with time windows
- The Distribution Problem with Carrier Service: A Dual Based Penalty Approach
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
- Computer Solutions of the Traveling Salesman Problem