A memetic algorithm for the multi trip vehicle routing problem
From MaRDI portal
Publication:2514735
DOI10.1016/j.ejor.2013.06.012zbMath1304.90031OpenAlexW2081708500MaRDI QIDQ2514735
Thibaut Vidal, Dominique Feillet, Diego Cattaruzza, Nabil Absi
Publication date: 3 February 2015
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2013.06.012
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (22)
Rich vehicle routing problems: from a taxonomy to a definition ⋮ Integrated production and multiple trips vehicle routing with time windows and uncertain travel times ⋮ Multi-trip vehicle routing problem with order release time ⋮ Large neighborhood search for multi-trip vehicle routing ⋮ The latency location-routing problem ⋮ An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows ⋮ The multiple trip vehicle routing problem with backhauls: formulation and a two-level variable neighbourhood search ⋮ The multi-period multi-trip container drayage problem with release and due dates ⋮ A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes ⋮ Multi-fleet feeder vehicle routing problem using hybrid metaheuristic ⋮ Variable neighborhood search based approaches to a vehicle scheduling problem in agriculture ⋮ Integrating production scheduling and transportation procurement through combinatorial auctions ⋮ An improved memetic algorithm for integrated production scheduling and vehicle routing decisions ⋮ A relax-and-repair heuristic for the swap-body vehicle routing problem ⋮ Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem ⋮ Vehicle routing problems with multiple trips ⋮ Heuristic Solutions to the Facility Location Problem with General Bernoulli Demands ⋮ Knowledge-guided local search for the vehicle routing problem ⋮ Vehicle routing problems with multiple trips ⋮ Multi-trip time-dependent vehicle routing problem with time windows ⋮ A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows ⋮ Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
- A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration
- Adaptive memory programming for the vehicle routing problem with multiple trips
- An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
- A GA based heuristic for the vehicle routing problem with multiple trips
- The vehicle routing problem. Latest advances and new challenges.
- The petrol station replenishment problem with time windows
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem
- A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
- A multi-phase constructive heuristic for the vehicle routing problem with multiple trips.
- A simple and effective evolutionary algorithm for the vehicle routing problem
- Probabilistic diversification and intensification in local search for vehicle routing
- The Vehicle Routing Problem
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem
- Tour splitting algorithms for vehicle routing problems
- The multi-trip vehicle routing problem
- A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- Parallel iterative search methods for vehicle routing problems
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems
- Vehicle Routeing with Multiple Use of Vehicles
- Handbook of metaheuristics
This page was built for publication: A memetic algorithm for the multi trip vehicle routing problem