A sweep-based algorithm for the fleet size and mix vehicle routing problem
From MaRDI portal
Publication:1848592
DOI10.1016/S0377-2217(01)00237-5zbMath0998.90016OpenAlexW2052972410MaRDI QIDQ1848592
Fayez F. Boctor, Jacques Renaud
Publication date: 13 November 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(01)00237-5
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Traffic problems in operations research (90B20)
Related Items (31)
Simple heuristics for the multi-period fleet size and mix vehicle routing problem ⋮ A continuous approximation model for the fleet composition problem on the rectangular grid ⋮ Differential approximation algorithm of FSMVRP ⋮ A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem ⋮ Modified differential evolution algorithms for multi-vehicle allocation and route optimization for employee transportation ⋮ Thirty years of heterogeneous vehicle routing ⋮ A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector ⋮ A column generation approach to the heterogeneous fleet vehicle routing problem ⋮ A min-max vehicle routing problem with split delivery and heterogeneous demand ⋮ A hybrid algorithm for the heterogeneous fleet vehicle routing problem ⋮ Fleet sizing of reusable articles under uncertain demand and turnaround times ⋮ Decentralized production-distribution planning in multi-echelon supply chain network using intelligent agents ⋮ An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls ⋮ Optimal routing of multimodal mobility systems with ride‐sharing ⋮ Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand ⋮ Solving the tractor and semi-trailer routing problem based on a heuristic approach ⋮ Synchronized routing of seasonal products through a production/distribution network ⋮ A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery ⋮ Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems ⋮ Routing a Heterogeneous Fleet of Vehicles ⋮ A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows ⋮ Relaxations and exact solution of the variable sized bin packing problem ⋮ Multi-depot two-echelon fuel minimizing routing problem with heterogeneous fleets: model and heuristic ⋮ An efficient column-generation-based algorithm for solving a pickup-and-delivery problem ⋮ A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems ⋮ Formulations and valid inequalities for the heterogeneous vehicle routing problem ⋮ A Comparative Study of Task Assignment and Path Planning Methods for Multi-UGV Missions ⋮ A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem ⋮ Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs ⋮ Industrial aspects and literature survey: fleet composition and routing ⋮ A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
Uses Software
Cites Work
- Polyhedral study of the capacitated vehicle routing problem
- A comparison of techniques for solving the fleet size and mix vehicle routing problem
- The fleet size and mix vehicle routing problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- The vehicle routing problem: An overview of exact and approximate algorithms
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- Routing problems: A bibliography
- Probabilistic diversification and intensification in local search for vehicle routing
- The column-circular, subsets-selection problem: Complexity and solutions
- A new heuristic for the fleet size and mix vehicle routing problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- Incorporating vehicle into the vehicle routing fleet composition problem
- A new heuristic for determining fleet size and composition
- Vehicle Fleet Composition
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Parallel iterative search methods for vehicle routing problems
- A heuristic column generation method for the heterogeneous fleet VRP
- A Tabu Search Heuristic for the Vehicle Routing Problem
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem
- Extensions of the Petal Method for Vehicle Routeing
- Computer Solutions of the Traveling Salesman Problem
This page was built for publication: A sweep-based algorithm for the fleet size and mix vehicle routing problem
