Heuristic and exact algorithms for a min-max selective vehicle routing problem

DOI10.1016/j.cor.2010.10.010zbMath1205.90059OpenAlexW2055024572MaRDI QIDQ622161

Leonardo Conegundes Martinez, Alexandre Salles da Cunha, Geraldo Robson Mateus, Cristiano Arbex Valle

Publication date: 31 January 2011

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.010

zbMATH Keywords

heuristicsvehicle routing problembranch-and-cutlocal branching

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty, An inventory-routing problem with the objective of travel time minimization, Decomposition Methods for the Parallel Machine Scheduling Problem with Setups, A matheuristic for the truck and trailer routing problem

Uses Software

• CPLEX
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
• Theoretical aspects of local search.
• The vehicle routing problem. Latest advances and new challenges.
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Variable neighborhood search
• Local branching
• A new variant of a vehicle routing problem: Lower and upper bounds
• Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
• Greedy randomized adaptive search procedures
• Stronger \(K\)-tree relaxations for the vehicle routing problem
• A branch-and-cut algorithm for graph coloring
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem
• Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized
• Min-Max K -vehicles windy rural postman problem
• Two exact algorithms for the distance-constrained vehicle routing problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• The Capacitated m-Ring-Star Problem
• Optimal Routing under Capacity and Distance Restrictions
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• The Covering Tour Problem
• Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
• A Tabu Search Heuristic for the Vehicle Routing Problem
• The General Pickup and Delivery Problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Solution of a Large-Scale Traveling-Salesman Problem
• A Method for Solving Traveling-Salesman Problems
• Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows