Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits

@article{Vidal2016LargeNW,
  title={Large Neighborhoods with Implicit Customer Selection for Vehicle Routing Problems with Profits},
  author={Thibaut Vidal and Nelson Maculan and Luiz Satoru Ochi and Puca Huachi Vaz Penna},
  journal={Transp. Sci.},
  year={2016},
  volume={50},
  pages={720-734}
}
We consider several vehicle routing problems (VRP) with profits, which seek to select a subset of customers, each one being associated with a profit, and to design service itineraries. When the sum of profits is maximized under distance constraints, the problem is usually called the team orienteering problem. The capacitated profitable tour problem seeks to maximize profits minus travel costs under capacity constraints. Finally, in the VRP with a private fleet and common carrier, some customers… 
The vehicle routing problem with service level constraints
Distance approximation to support customer selection in vehicle routing problems
TLDR
This paper applies several regression methods to predict the total distance of the traveling salesman problem (TSP) and vehicle routing problem (VRP), and shows that distance can be estimated fairly accurate using simple regression models and only a limited number of features.
A GRASP-based Solution Construction Approach for the Multi-Vehicle Profitable Pickup and Delivery Problem
TLDR
The construction phase of the well-known Greedy Randomized Adaptive Search Procedure (GRASP) is utilized to build initial solutions for the Multi-Vehicle Profitable Pickup and Delivery Problem (MVPPDP), and the effectiveness of the proposed method is proved.
The multi-vehicle profitable pickup and delivery problem
TLDR
This work proposes a method based on general variable neighborhood search (GVNS) for the multi-vehicle profitable pickup and delivery problem (MVPPDP), where multiple carriers transport goods from a selection of pickup customers to the corresponding delivery customers within given travel time limits.
Selective vehicle routing problem: cluster and synchronization constraints. (Problèmes de tournées de véhicules sélectives: contraintes de cluster et de synchronisation)
TLDR
This thesis introduced a new generalization for the TOP that it is called the Clustered TOP (CluTOP), and proposed a Memetic Algorithm with an optimal splitting procedure based on dynamic programming.
Heuristics for vehicle routing problems: Current challenges and future prospects
TLDR
Some of the main principles of the Unified Hybrid Genetic Search (UHGS) are exposed, which has been recently extended to obtain state-of-the-art results --in a single code base-- for more than 50 difficult variants of vehicle routing and arc routing problems.
Univariate Marginal Distribution Algorithm and Random Variable Neighbourhood Descent Applied to the Vehicle Routing Problem with Private Fleet and Common Carrier
Among the different classes of Vehicle Routing Problems are the Vehicle Routing Problems with Profits (VRPPs), where it is not mandatory to service all the customers. A relatively new VRPP is the
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 56 REFERENCES
The prize-collecting vehicle routing problem with single and multiple depots and non-linear cost
TLDR
This paper considers the Prize-Collecting Vehicle Routing Problem with Non-Linear cost in its single and multi-depot version, which integrates the option of outsourcing customers to subcontractors instead of serving them with the private fleet.
Iterated local search algorithm based on very large-scale neighborhood for prize-collecting vehicle routing problem
TLDR
An iterated local search algorithm (ILS) based on very large-scale neighborhood (VLSN) using cyclic transfer is proposed for the PCVRP, which is derived from the hot rolling production of the iron and steel industry.
An exact algorithm for team orienteering problems
TLDR
The solution method proposed here is based on a Branch & Price algorithm, and is the first exact method proposed for such problems, except for a preliminary work from Gueguen and a work from Butt and Ryan.
A memetic algorithm for the multiperiod vehicle routing problem with profit
Tabu search with ejection chains for the vehicle routing problem with private fleet and common carrier
TLDR
A tabu search heuristic with a neighbourhood structure based on ejection chains is proposed to solve the classical vehicle routing problem and it is empirically demonstrated that this algorithm outperforms the best approaches reported in the literature on a set of benchmark instances with both homogeneous and heterogeneous fleets.
An Adaptive Variable Neighborhood Search Algorithm for a Vehicle Routing Problem Arising in Small Package Shipping
TLDR
An effective Variable Neighborhood Search algorithm based on the use of cyclic-exchange neighborhoods that incorporates an adaptive mechanism to bias the random shaking step is developed and successfully used to solve MDVRPPC.
Metaheuristics for the team orienteering problem
TLDR
Two variants of a generalized tabu search algorithm and a variable neighborhood search algorithm are proposed for the solution of the Team Orienteering Problem and it is shown that each of these algorithms beats the already known heuristics.
The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results
TLDR
In the standard, capacitated vehicle routing problem (VRP), a homogeneous fleet of vehicles services a set of customers from a single depot so that all customers are serviced and the total distance traveled by the fleet is minimized.
...
1
2
3
4
5
...