An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
From MaRDI portal
(Redirected from Publication:1362944)
Recommendations
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 1054962 (Why is no real title available?)
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Parallel iterative search methods for vehicle routing problems
- Probabilistic diversification and intensification in local search for vehicle routing
- The m-Traveling Salesman Problem with Minmax Objective
- The vehicle routing problem: An overview of exact and approximate algorithms
- Vehicle Routeing with Multiple Use of Vehicles
Cited in
(32)- Balancing the cardinality of clusters with a distance constraint: a fast algorithm
- Workload equity in multiperiod vehicle routing problems
- A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length
- EFFICIENT NEIGHBORHOOD SEARCH FOR THE PROBABILISTIC MULTI-VEHICLE PICKUP AND DELIVERY PROBLEM
- An approximation algorithm for vehicle routing with compatibility constraints
- Solving the vehicle routing problem with adaptive memory programming methodology
- A multi-start algorithm for a balanced real-world open vehicle routing problem
- A largest empty hypersphere metaheuristic for robust optimisation with implementation uncertainty
- A matheuristic for the MinMax capacitated open vehicle routing problem
- Planning sustainable routes: economic, environmental and welfare concerns
- Adaptive memory programming for the vehicle routing problem with multiple trips
- A GA based heuristic for the vehicle routing problem with multiple trips
- A lexicographic minimax approach to the vehicle routing problem with route balancing
- A new capacitated vehicle routing problem with split service for minimizing fleet cost by simulated annealing
- Home health care facility location problem under demand uncertainty
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach
- A min-max vehicle routing problem with split delivery and heterogeneous demand
- Greedy random adaptive memory programming search for the capacitated clustering problem
- The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
- A self-tuning heuristic for a multi-objective vehicle routing problem
- The bi-objective \(k\)-dissimilar vehicle routing problem
- A TABU search heuristic for the team orienteering problem
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
- A generalized set partitioning model for MinMax vehicle routing
- Multi-objective metaheuristics for a location-routing problem with multiple use of vehicles on real data and simulated data
- A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- Adaptive memory programming: a unified view of metaheuristics
- Heuristics for the lexicographic Max-ordering vehicle routing problem
- A framework for the description of evolutionary algorithms
- A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window
This page was built for publication: An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1362944)
