Heuristic and exact algorithms for a min-max selective vehicle routing problem
DOI10.1016/J.COR.2010.10.010zbMATH Open1205.90059OpenAlexW2055024572MaRDI QIDQ622161FDOQ622161
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
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
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)
Cites Work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Solution of a Large-Scale Traveling-Salesman Problem
- A method for solving traveling-salesman problems
- Local branching
- The truck dispatching problem
- The vehicle routing problem
- The vehicle routing problem. Latest advances and new challenges.
- Variable neighborhood search
- Title not available (Why is that?)
- A branch-and-cut algorithm for graph coloring
- Stochastic local search. Foundations and applications.
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
- The Capacitated m-Ring-Star Problem
- Greedy randomized adaptive search procedures
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- The Covering Tour Problem
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
- The General Pickup and Delivery Problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Title not available (Why is that?)
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows
- A new variant of a vehicle routing problem: Lower and upper bounds
- Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
- Optimal Routing under Capacity and Distance Restrictions
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Two exact algorithms for the distance-constrained vehicle routing problem
- Title not available (Why is that?)
- Theoretical aspects of local search.
- Title not available (Why is that?)
- Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
- Stronger \(K\)-tree relaxations for the vehicle routing problem
- Exact algorithms for a selective vehicle routing problem where the longest route is minimized
- Min-Max \(K\)-vehicles windy rural postman problem
- Title not available (Why is that?)
Cited In (9)
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis
- Exact algorithms for a selective vehicle routing problem where the longest route is minimized
- Heuristic and exact algorithms for the multi-pile vehicle routing problem
- A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
- Two heuristic solution concepts for the vehicle selection problem in line haul transports
- A matheuristic for the truck and trailer routing problem
- Decomposition methods for the parallel machine scheduling problem with setups
- Approximations for minimum and min-max vehicle routing problems
- An inventory-routing problem with the objective of travel time minimization
Uses Software
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)
