A new approach to partial constraint satisfaction problems

DOI10.1080/00207160412331296724zbMATH Open1042.90006OpenAlexW2040975306MaRDI QIDQ4464296FDOQ4464296

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

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

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)

Cites Work

• Branch-and-Bound Methods: A Survey

Cited In (10)

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

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)