The k-dissimilar vehicle routing problem
DOI10.1016/J.EJOR.2015.01.019zbMATH Open1346.90182OpenAlexW2034271943MaRDI QIDQ319301FDOQ319301
Authors: K. Sörensen, Luca Talarico, Johan Springael
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.01.019
Recommendations
- The bi-objective \(k\)-dissimilar vehicle routing problem
- Approximation algorithms for distance constrained vehicle routing problems
- On the Distance Constrained Vehicle Routing Problem
- On the complexity of the \(k\)-customer vehicle routing problem
- Publication:3204336
- The vehicle routing problem
- The rendezvous vehicle routing problem
- Approximation algorithms for a vehicle routing problem
- Approximation algorithms for some vehicle routing problems
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Title not available (Why is that?)
- Disjoint paths in a network
- Finding the K Shortest Loopless Paths in a Network
- Title not available (Why is that?)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- Modeling Equity of Risk in the Transportation of Hazardous Materials
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- On finding dissimilar Pareto-optimal paths
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
- Heuristics for the bi-objective path dissimilarity problem
- Solving symmetric vehicle routing problems asymmetrically
- Separating capacity constraints in the CVRP using tabu search
- A heuristic approach to the overnight security service problem
- On finding dissimilar paths
- An attribute based similarity function for VRP decision support
- Parallel iterative search methods for vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- Dynamic programming approaches to solve the shortest path problem with forbidden paths
- Finding the k shortest simple paths
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
- Improved algorithms for the \(k\) simple shortest paths and the replacement paths problems
Cited In (22)
- New integrated routing and surveillance model with drones and charging station considerations
- A comprehensive risk assessment view on interval type-2 fuzzy controller for a time-dependent HazMat routing problem
- Finding shortest and dissimilar paths
- Evolutionary Multi-Criterion Optimization
- A cash transportation vehicle routing problem with combinations of different cash denominations
- Minimizing dispersion in multiple drone routing
- Objectives and methods in multi-objective routing problems: a survey and classification scheme
- A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector
- Logistics planning of cash transfer to Syrian refugees in Turkey
- The secure time-dependent vehicle routing problem with uncertain demands
- The multiple shortest path problem with path deconfliction
- The vehicle routing problem with arrival time diversification on a multigraph
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem
- Heuristics for the bi-objective path dissimilarity problem
- Finding \(K\) dissimilar paths: single-commodity and discretized flow formulations
- The bi-objective \(k\)-dissimilar vehicle routing problem
- Dissimilar arc routing problems
- An attribute based similarity function for VRP decision support
- Safe and secure vehicle routing: a survey on minimization of risk exposure
- Vehicle routing with arrival time diversification
- Computing indicators for differences and similarities among sets of vehicle routes
Uses Software
This page was built for publication: The \(k\)-dissimilar vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319301)