A new approach to partial constraint satisfaction problems

DOI10.1080/00207160412331296724MaRDI QIDQ4464296zbMATH OpenOpenAlexFDO

Authors

Publication date 27 May 2004

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160412331296724

zbMATH Keywords

simulated annealinggenetic algorithmsresource managementvehicle routing problemstemporal constrainttechnological constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Recommendations

• A New Algorithm To Solve Vehicle Routing Problems (VRPs)
• scientific article; zbMATH DE number 1082107
• A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers
• The Vehicle Routing Problem with Stochastic Travel Times
• Publication:3204336

Cites work

• Branch-and-Bound Methods: A Survey

Cited in

(10)

• A New Algorithm To Solve Vehicle Routing Problems (VRPs)
• New optimality cuts for a single-vehicle stochastic routing problem
• A comparison of feasible direction methods for the stochastic transportation problem
• Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
• Solving large-scale dynamic vehicle routing problems with stochastic requests
• Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
• Stochastic vehicle routing problem with restocking
• A real delivery problem dealt with Monte Carlo techniques
• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
• Improved results for route planning in stochastic transportation networks

This page was built for publication: A new approach to partial constraint satisfaction problems

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