Efficient frameworks for greedy split and new depth first search split procedures for routing problems
From MaRDI portal
Publication:613510
DOI10.1016/j.cor.2010.09.010zbMath1202.90028OpenAlexW2043311302MaRDI QIDQ613510
Caroline Prodhon, Philippe Lacomme, Christophe Duhamel
Publication date: 20 December 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.09.010
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (13)
A survey of recent research on location-routing problems ⋮ The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm ⋮ A hybrid algorithm of local search for the heterogeneous fixed fleet vehicle routing problem ⋮ Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem ⋮ Integration of routing into a resource-constrained project scheduling problem ⋮ A multi-space sampling heuristic for the vehicle routing problem with stochastic demands ⋮ MineReduce: an approach based on data mining for problem size reduction ⋮ The consistent vehicle routing problem with heterogeneous fleet ⋮ Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem ⋮ Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem ⋮ A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet ⋮ Industrial and tramp ship routing problems: closing the gap for real-scale instances ⋮ An effective PSO-inspired algorithm for the team orienteering problem
Uses Software
Cites Work
- Unnamed Item
- A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem
- A GRASP with evolutionary path relinking for the truck and trailer routing problem
- Competitive memetic algorithms for arc routing problems
- Location-routing: issues, models and methods
- Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking
- A column generation approach to the heterogeneous fleet vehicle routing problem
- A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
- Advances in computational intelligence in transport, logistics, and supply chain management
- A memetic algorithm for the team orienteering problem
- An effective memetic algorithm for the cumulative capacitated vehicle routing problem
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- An improved heuristic for the capacitated arc routing problem
- A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem
- The fleet size and mix problem for capacitated arc routing
- The fleet size and mix vehicle routing problem
- A reoptimization algorithm for the shortest path problem with time windows
- A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
- The many-to-many location-routing problem
- Combined location-routing problems: A synthesis and future research directions
- A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
- Heuristic solutions to multi-depot location-routing problems
- Recent advances in memetic algorithms.
- Evolutionary algorithms for periodic arc routing problems
- Greedy randomized adaptive search procedures
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- A genetic algorithm for a bi-objective capacitated arc routing problem
- A scatter search for the periodic capacitated arc routing problem
- Recent results on Arc Routing Problems: An annotated bibliography
- Tour splitting algorithms for vehicle routing problems
- A memetic algorithm for the vehicle routing problem with time windows
- An Evolutionary Algorithm with Distance Measure for the Split Delivery Capacitated Arc Routing Problem
- Bounds and Heuristics for Capacitated Routing Problems
- A heuristic column generation method for the heterogeneous fleet VRP
- A Tabu Search Heuristic for the Capacitated arc Routing Problem
- An Improved Petal Heuristic for the Vehicle Routeing Problem
- Nested Heuristic Methods for the Location-Routeing Problem
- Extensions of the Petal Method for Vehicle Routeing
- Improving robustness of solutions to arc routing problems
This page was built for publication: Efficient frameworks for greedy split and new depth first search split procedures for routing problems
