An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size
From MaRDI portal
(Redirected from Publication:336876)
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
Cites work
- scientific article; zbMATH DE number 4143778 (Why is no real title available?)
- scientific article; zbMATH DE number 2209648 (Why is no real title available?)
- A memetic algorithm for the vehicle routing problem with time windows
- A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- An efficient transformation of the generalized vehicle routing problem
- New mathematical models of the generalized vehicle routing problem and extensions
- Optimal Routing under Capacity and Distance Restrictions
- Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
- Tour splitting algorithms for vehicle routing problems
Cited in
(18)- Some applications of the generalized vehicle routing problem
- An innovative approach to the supply-chain network optimization of biorefineries using metaheuristic techniques
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- To improve the performance of genetic algorithms by using a novel selection operator
- A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs
- A unified exact approach for clustered and generalized vehicle routing problems
- Solving the multi-vehicle multi-covering tour problem
- Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm
- 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
- New mathematical models of the generalized vehicle routing problem and extensions
- Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size
- The flexible periodic vehicle routing problem
- A perturbation metaheuristic for the vehicle routing problem with private fleet and common carriers
- 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
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)
