An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem

DOI10.1016/j.cor.2009.02.008zbMath1162.90538OpenAlexW1967395904MaRDI QIDQ1025258

Michele Monaci, Daniele Vigo, Maria Battarra

Publication date: 18 June 2009

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

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

zbMATH Keywords

heuristicsvehicle routingtime windowsmultiple trip

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items

Road-based goods transportation: a survey of real-world logistics applications from 2000 to 2015, Logistic constraints in container loading problems: the impact of complete shipment conditions, Total distance approximations for routing solutions, Multi-trip vehicle routing problem with order release time, Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows, An adaptive large neighborhood search for a vehicle routing problem with multiple routes, An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows, Minimum cost VRP with time-dependent speed data and congestion charge, A tabu search algorithm for the multi-period inspector scheduling problem, Optimal collection of medical specimens and delivery to central laboratory, A mixed-integer linear programming model for optimal vessel scheduling in offshore oil and gas operations, A concise guide to existing and emerging vehicle routing problem variants, A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location, Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture, How managerial perspectives affect the optimal fleet size and mix model: a multi-objective approach, Vehicle routing problems with multiple trips, Оптимальное планирование пассажирских перевозок в региональной авиатранспортной сети, A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration, Vehicle routing problems with multiple trips, Vehicle routing problems with loading constraints: state-of-the-art and future directions, Multi-trip time-dependent vehicle routing problem with time windows, A memetic algorithm for the multi trip vehicle routing problem, Pickup and delivery problem with incompatibility constraints

Uses Software

• Hyperheuristics
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Adaptive memory programming for the vehicle routing problem with multiple trips
• An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
• Recent advances in vehicle routing exact algorithms
• A GA based heuristic for the vehicle routing problem with multiple trips
• Reactive search and intelligent optimization
• Self-adaptive heuristics for evolutionary computation
• The vehicle routing problem. Latest advances and new challenges.
• The petrol station replenishment problem with time windows
• A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
• Solving a fuel delivery problem by heuristic and exact approaches.
• A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
• The Vehicle Routing Problem
• The multi-trip vehicle routing problem
• A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
• Hyper-Heuristics: An Emerging Direction in Modern Search Technology
• Vehicle Routeing with Multiple Use of Vehicles