Flight scheduling and maintenance base planning
Management Science
Vehicle routing with pick-up and delivery: tour-partitioning heuristics
Computers and Industrial Engineering
Heuristic solutions to multi-depot location-routing problems
Computers and Operations Research
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
A Tabu Search Heuristic for the Capacitated Arc Routing Problem
Operations Research
A genetic algorithm for a bi-objective capacitated arc routing problem
Computers and Operations Research
A column generation approach to the heterogeneous fleet vehicle routing problem
Computers and Operations Research
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
Computers and Operations Research
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
Computers and Operations Research
A Memetic Algorithm with Population Management (MA|PM) for the Periodic Location-Routing Problem
HM '08 Proceedings of the 5th International Workshop on Hybrid Metaheuristics
An improved heuristic for the capacitated arc routing problem
Computers and Operations Research
Two memetic algorithms for heterogeneous fleet vehicle routing problems
Engineering Applications of Artificial Intelligence
An effective memetic algorithm for the cumulative capacitated vehicle routing problem
Computers and Operations Research
A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
Computers and Operations Research
A GRASP×ELS approach for the capacitated location-routing problem
Computers and Operations Research
Evolutionary local search for the super-peer selection problem and the p-hub median problem
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Engineering Applications of Artificial Intelligence
Computers and Operations Research
A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Engineering Applications of Artificial Intelligence
A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints
Engineering Applications of Artificial Intelligence
Bi-Objective Bus Routing: An Application to School Buses in Rural Areas
Transportation Science
Hi-index | 0.01 |
Split procedures have proven their efficiency within global optimization frameworks for routing problems by splitting giant tours into trips. This is done by generating an optimal shortest path within an auxiliary graph constructed from the giant tour. This article provides a state of the art of split practice in routing problems and gives its key features. The efficiency of the method critically depends on the node-splitting procedure and on the upper and lower bound approximations. Suitable complexity can be obtained using a new depth first search procedure which is introduced here and provides a new algorithm that is specially designed for large scale problems with resource constraints. Experiments show that the depth first search split procedure introduced in this article, used as an evaluation function in a global framework, can improve the results obtained by the use of the ''classical'' split procedure on the Location-Routing Problem and the Heterogeneous Vehicle Routing Problem. The Location-Routing Problem is also used to provide further analysis and a fair comparative study between the two split versions.