A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery
DOI10.3934/jimo.2020012zbMath1476.90045OpenAlexW2999755243MaRDI QIDQ1983673
Bariş Keçeci, Imdat Kara, Fulya Altiparmak
Publication date: 10 September 2021
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2020012
simulated annealing algorithmmathematical modelvehicle routing problemheterogeneous fixed fleetsimultaneous pickup-delivery
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Thirty years of heterogeneous vehicle routing
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery
- Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
- A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery
- A column generation approach to the heterogeneous fleet vehicle routing problem
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows
- A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery
- Exact algorithms for routing problems under vehicle capacity constraints
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- Industrial aspects and literature survey: fleet composition and routing
- The fleet size and mix vehicle routing problem
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- A sweep-based algorithm for the fleet size and mix vehicle routing problem
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
- The heterogeneous fleet location routing problem with simultaneous pickup and delivery and overloads
- Incorporating vehicle into the vehicle routing fleet composition problem
- A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Hybrid Metaheuristics
- A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling
- The fleet size and mix vehicle routing problem with time windows
- Routing a Heterogeneous Fleet of Vehicles
- A new heuristic for determining fleet size and composition
- A heuristic column generation method for the heterogeneous fleet VRP
- Tabu search variants for the mix fleet vehicle routing problem
- Saving-based algorithms for vehicle routing problem with simultaneous pickup and delivery
- Equation of State Calculations by Fast Computing Machines
- Shortest Path Problems with Resource Constraints
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
This page was built for publication: A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery
