The attribute based hill climber

DOI10.1023/B:JMMA.0000036583.17284.02MaRDI QIDQ702367zbMATH OpenFDO

Authors Ian M. Whittley, George D. Smith

Publication date 17 January 2005

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/B:JMMA.0000036583.17284.02

zbMATH Keywords

aspirationlocal searchmetaheuristicsquadratic assignment problemtravelling salesman problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Applying the attribute based hill climber heuristic to the vehicle routing problem
• Tabu guided generalized Hill climbing algorithms
• A simple and efficient tabu search heuristic for solving the open vehicle routing problem
• Tabu Search—Part I
• Tabu Search—Part II

Cited in

(10)

• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
• Moving products between location pairs: cross-docking versus direct-shipping
• Efficient metaheuristics to solve the intermodal terminal location problem
• Tabu search heuristics for the order batching problem in manual order picking systems
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis
• A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse
• Integrated distribution and loading planning via a compact metaheuristic algorithm
• Multilevel neighborhood search for solving full truckload routing problems arising in timber transportation
• The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints
• Applying the attribute based hill climber heuristic to the vehicle routing problem

This page was built for publication: The attribute based hill climber

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