An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size

DOI10.1016/j.cor.2013.08.017zbMath1348.90094OpenAlexW2087641182MaRDI QIDQ336876

Minh Hoàng Hà, André Langevin, Nathalie Bostel, 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

zbMATH Keywords

metaheuristicbranch-and-cutgeneralized vehicle routingtwo-commodity flow model

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Related Items (14)

Solving the multi-vehicle multi-covering tour problem ⋮ The flexible periodic vehicle routing problem ⋮ The bi-objective insular traveling salesman problem with maritime and ground transportation costs ⋮ A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system ⋮ The vehicle routing problem with service level constraints ⋮ A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution ⋮ An innovative approach to the supply-chain network optimization of biorefineries using metaheuristic techniques ⋮ Improving the efficiency of patient diagnostic specimen collection with the aid of a multi-modal routing algorithm ⋮ To improve the performance of genetic algorithms by using a novel selection operator ⋮ A new selection operator for genetic algorithms that balances between premature convergence and population diversity ⋮ Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation ⋮ A Novel Discrete Differential Evolution Algorithm for the Vehicle Routing Problem in B2C E-Commerce ⋮ A unified exact approach for clustered and generalized vehicle routing problems ⋮ A Time-Indexed Generalized Vehicle Routing Model and Stabilized Column Generation for Military Aircraft Mission Planning

Uses Software

• CVRPSEP

Cites Work

• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• 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
• Tour splitting algorithms for vehicle routing problems
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• A memetic algorithm for the vehicle routing problem with time windows
• Optimal Routing under Capacity and Distance Restrictions
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Unnamed Item
• Unnamed Item

This page was built for publication: An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size