Applying the attribute based hill climber heuristic to the vehicle routing problem

DOI10.1016/J.EJOR.2005.11.038zbMATH Open1109.90011OpenAlexW2055775959MaRDI QIDQ856266FDOQ856266

N. E. Zubov

Publication date: 7 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.038

Recommendations

• The attribute based hill climber
• A simple and efficient tabu search heuristic for solving the open vehicle routing problem
• A Tabu Search Heuristic for the Vehicle Routing Problem
• A unified solution framework for multi-attribute vehicle routing problems
• scientific article; zbMATH DE number 1082107

zbMATH Keywords

heuristicscombinatorial optimizationlogisticsmeta-heuristicsroutingtabu search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Search theory (90B40) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)

Cites Work

• BoneRoute: An adaptive memory-based method for effective fleet management
• Optimization by Simulated Annealing
• Tabu Search—Part I
• The attribute based hill climber
• A simple and effective evolutionary algorithm for the vehicle routing problem
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• A unified tabu search heuristic for vehicle routing problems with time windows
• An Exchange Heuristic for Routeing Problems with Time Windows
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• Routing problems: A bibliography
• Tabu Search—Part II
• A tabu search heuristic for periodic and multi-depot vehicle routing problems
• Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
• Very large-scale vehicle routing: new test problems, algorithms, and results
• Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
• Title not available (Why is that?)
• The granular tabu search and its application to the vehicle-routing problem
• New heuristics for the vehicle routing problem
• Active guided evolution strategies for large-scale vehicle routing problems with time windows
• A guide to vehicle routing heuristics
• A new hybrid genetic algorithm for the capacitated vehicle routing problem
• Guided local search and its application to the traveling salesman problem
• Title not available (Why is that?)
• Title not available (Why is that?)
• A parallel algorithm for the vehicle routing problem with time window constraints

Cited In (9)

• Integrated distribution and loading planning via a compact metaheuristic algorithm
• The attribute based hill climber
• Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints
• Vehicle routing with compartments: applications, modelling and heuristics
• The close-open mixed vehicle routing problem
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• Efficient metaheuristics to solve the intermodal terminal location problem
• Tabu search heuristics for the order batching problem in manual order picking systems

Uses Software

• BoneRoute
• VRP

This page was built for publication: Applying the attribute based hill climber heuristic to the vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856266)