Adaptive memory programming for the vehicle routing problem with multiple trips
From MaRDI portal
Publication:850308
DOI10.1016/j.cor.2005.02.044zbMath1110.90014OpenAlexW2039082933MaRDI QIDQ850308
Publication date: 15 November 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.044
Related Items
A multi-trip split-delivery vehicle routing problem with time windows for inventory replenishment under stochastic travel times ⋮ An optimization approach for communal home meal delivery service: A case study ⋮ Rich vehicle routing problems: from a taxonomy to a definition ⋮ A variable neighborhood search algorithm for the vehicle routing problem with multiple trips ⋮ Multi-trip vehicle routing problem with order release time ⋮ Large neighborhood search for multi-trip vehicle routing ⋮ 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 ⋮ Skewed general variable neighborhood search for the location routing scheduling problem ⋮ The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search ⋮ 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 ⋮ Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics ⋮ A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows ⋮ Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture ⋮ A Large Neighbourhood Search Heuristic for a Periodic Supply Vessel Planning Problem Arising in Offshore Oil and Gas Operations ⋮ How managerial perspectives affect the optimal fleet size and mix model: a multi-objective approach ⋮ An improved memetic algorithm for integrated production scheduling and vehicle routing decisions ⋮ Multi-Zone Multi-Trip Vehicle Routing Problem with Time Windows ⋮ Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model ⋮ Vehicle routing problems with multiple trips ⋮ A GA based heuristic for the vehicle routing problem with multiple trips ⋮ Vehicle routing problems with multiple trips ⋮ Vehicle routing problem for multiple product types, compartments, and trips with soft time windows ⋮ Multi-trip time-dependent vehicle routing problem with soft time windows and overtime constraints ⋮ Multi-trip time-dependent vehicle routing problem with time windows ⋮ A memetic algorithm for the multi trip vehicle routing problem ⋮ An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem ⋮ An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles ⋮ Solving a manpower scheduling problem for airline catering using metaheuristics ⋮ New Notation and Classification Scheme for Vehicle Routing Problems ⋮ A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem ⋮ Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
Uses Software
Cites Work
- Unnamed Item
- Greedy random adaptive memory programming search for the capacitated clustering problem
- The multi-depot vehicle routing problem with inter-depot routes
- Heuristic algorithms for the multiple knapsack problem
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- A tabu search heuristic for the heterogeneous fleet vehicle routing problem
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- A TABU search heuristic for the team orienteering problem
- Solving the vehicle routing problem with adaptive memory programming methodology
- BoneRoute: An adaptive memory-based method for effective fleet management
- A tabu search heuristic and adaptive memory procedure for political districting
- Adaptive memory search for Boolean optimization problems
- Probabilistic diversification and intensification in local search for vehicle routing
- The Vehicle Routing Problem
- The multi-trip vehicle routing problem
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Integer Programming Approach to the Vehicle Scheduling Problem
- Parallel iterative search methods for vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Vehicle Routeing with Multiple Use of Vehicles
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- Adaptive memory programming: a unified view of metaheuristics
