Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
From MaRDI portal
Publication:336790
DOI10.1016/j.cor.2013.07.025zbMath1348.90112OpenAlexW2086029661MaRDI QIDQ336790
Grégoire Vitry, Farouk Yalaoui, Julien Michallet, Lionel Amodeo, Christian Prins
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.07.025
Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
Rich vehicle routing problems: from a taxonomy to a definition, The \(k\)-dissimilar vehicle routing problem, Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem, Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services, A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, The flexible periodic vehicle routing problem, The secure time-dependent vehicle routing problem with uncertain demands, A concise guide to existing and emerging vehicle routing problem variants, The vehicle routing problem with arrival time diversification on a multigraph, Safe and secure vehicle routing: a survey on minimization of risk exposure, GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows, The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions, A cash transportation vehicle routing problem with combinations of different cash denominations, Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs, A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit, A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector, Vehicle routing with arrival time diversification, Unnamed Item, A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows, A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients, A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem
- A general heuristic for vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- A heuristic approach to the overnight security service problem
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Time dependent vehicle routing problem with a multi ant colony system
- The Truck Dispatching Problem
- The Vehicle Routing Problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
- Heuristiques pour le Problème du Vendeurm-Péripatétique
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- TSPLIB—A Traveling Salesman Problem Library
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Bounds for the symmetric 2-peripatetic salesman problem
- A unified tabu search algorithm for vehicle routing problems with soft time windows
- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
- Computer Solutions of the Traveling Salesman Problem
- Lower bounds for symmetricK-peripatetic salesman problems
