A simulated-annealing method for the standard problem of vehicle routing with time window constraints

MaRDI QIDQ4494449zbMATH OpenFDO

Authors Jörg Homberger, Hermann Gehring

Publication date 25 November 2003

zbMATH Keywords

simulated-annealing methodtraffic problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 5951619
• Simulated annealing metaheuristics for the vehicle routing problem with time windows
• Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows
• A particular multiobjective vehicle routing problem solved by simulated annealing
• Improvement heuristics for the vehicle routing problem based on simulated annealing
• A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
• A hybrid search method for the vehicle routing problem with time windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length

Cited in

(5)

• Improvement heuristics for the vehicle routing problem based on simulated annealing
• scientific article; zbMATH DE number 5951619 (Why is no real title available?)
• A memetic algorithm for the vehicle routing problem with time windows
• A particular multiobjective vehicle routing problem solved by simulated annealing
• Sequential Simulated Annealing for the Vehicle Routing Problem with Time Windows

This page was built for publication: A simulated-annealing method for the standard problem of vehicle routing with time window constraints

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