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

DOI10.1016/J.COR.2010.10.010MaRDI QIDQ622161zbMATH OpenOpenAlexFDO

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

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

heuristicsbranch-and-cutvehicle routing problemlocal branching

Mathematics Subject Classification ID

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

Recommendations

• Exact algorithms for a selective vehicle routing problem where the longest route is minimized
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• The vehicle routing problem: An overview of exact and approximate algorithms
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem

Cites work

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

Cited in

(9)

• A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
• Approximations for minimum and min-max vehicle routing problems
• Decomposition methods for the parallel machine scheduling problem with setups
• Heuristic and exact algorithms for the multi-pile vehicle routing problem
• A matheuristic for the truck and trailer routing problem
• An inventory-routing problem with the objective of travel time minimization
• Exact algorithms for a selective vehicle routing problem where the longest route is minimized
• Two heuristic solution concepts for the vehicle selection problem in line haul transports
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis

Describes a project that uses

Uses Software

• CPLEX
• VRP

This page was built for publication: Heuristic and exact algorithms for a min-max selective vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q622161)