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.025zbMATH Open1348.90112OpenAlexW2086029661MaRDI QIDQ336790FDOQ336790
Authors: Julien Michallet, Christian Prins, Lionel Amodeo, Farouk Yalaoui, Grégoire Vitry 
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
Recommendations
- A multi-start local search algorithm for the vehicle routing problem with time windows
- An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows
- On solving the time window assignment vehicle routing problem via iterated local search
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
- Recent progress of local search in handling the time window constraints of the vehicle routing problem
Deterministic network models in operations research (90B10) Transportation, logistics and supply chain management (90B06)
Cites Work
- TSPLIB—A Traveling Salesman Problem Library
- Title not available (Why is that?)
- 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
- An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- A general heuristic for vehicle routing problems
- The vehicle routing problem. Latest advances and new challenges.
- An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- An adaptive large neighborhood search heuristic for the pollution-routing problem
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees
- Title not available (Why is that?)
- Bounds for the symmetric 2-peripatetic salesman problem
- Lower bounds for symmetricK-peripatetic salesman problems
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem
- An iterated local search algorithm for the vehicle routing problem with convex time penalty functions
- A heuristic approach to the overnight security service problem
- Computer Solutions of the Traveling Salesman Problem
- Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem
- A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities
- The Undirected m-Peripatetic Salesman Problem: Polyhedral Results and New Algorithms
- Heuristiques pour le Problème du Vendeurm-Péripatétique
- A unified tabu search algorithm for vehicle routing problems with soft time windows
- A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
Cited In (24)
- New integrated routing and surveillance model with drones and charging station considerations
- A cash transportation vehicle routing problem with combinations of different cash denominations
- The flexible periodic vehicle routing problem
- A biobjective decision model to increase security and reduce travel costs in the cash-in-transit sector
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- Rich vehicle routing problems: from a taxonomy to a definition
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
- The secure time-dependent vehicle routing problem with uncertain demands
- A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty
- A concise guide to existing and emerging vehicle routing problem variants
- The vehicle routing problem with arrival time diversification on a multigraph
- Metaheuristics for the risk-constrained cash-in-transit vehicle routing problem
- The \(k\)-dissimilar vehicle routing problem
- GRASP‐ILS and set cover hybrid heuristic for the synchronized team orienteering problem with time windows
- A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem
- The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions
- Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
- Dissimilar arc routing problems
- A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit
- Safe and secure vehicle routing: a survey on minimization of risk exposure
- Vehicle routing with arrival time diversification
- Title not available (Why is that?)
- 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
Uses Software
This page was built for publication: Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336790)
