An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
DOI10.1016/J.COR.2013.08.017zbMATH Open1348.90094OpenAlexW2087641182MaRDI QIDQ336876FDOQ336876
Authors: Minh Hoàng Hà, Nathalie Bostel, André Langevin, Louis-Martin Rousseau 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.08.017
Recommendations
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- A unified exact approach for clustered and generalized vehicle routing problems
- New mathematical models of the generalized vehicle routing problem and extensions
- Some applications of the generalized vehicle routing problem
- A hybrid algorithm for the heterogeneous fleet vehicle routing problem
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- A memetic algorithm for the vehicle routing problem with time windows
- An efficient transformation of the generalized vehicle routing problem
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- New mathematical models of the generalized vehicle routing problem and extensions
- Tour splitting algorithms for vehicle routing problems
- Title not available (Why is that?)
- Optimal Routing under Capacity and Distance Restrictions
- Title not available (Why is that?)
Cited In (17)
- An innovative approach to the supply-chain network optimization of biorefineries using metaheuristic techniques
- New mathematical models of the generalized vehicle routing problem and extensions
- To improve the performance of genetic algorithms by using a novel selection operator
- The flexible periodic vehicle routing problem
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning
- A novel discrete differential evolution algorithm for the vehicle routing problem in B2C e-commerce
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs
- Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm
- Solving the multi-vehicle multi-covering tour problem
- A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution
- The vehicle routing problem with service level constraints
- A new selection operator for genetic algorithms that balances between premature convergence and population diversity
- A unified exact approach for clustered and generalized vehicle routing problems
- Some applications of the generalized vehicle routing problem
Uses Software
This page was built for publication: An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336876)
