An Heuristic Method for Solving Time-Sensitive Routeing Problems

DOI10.2307/2581369MaRDI QIDQ3315236zbMATH OpenOpenAlexFDO

Authors Steven R. Evans, John P. Norback

Publication date 1984

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2581369

zbMATH Keywords

clusteringinsertion penaltieslogisticstime density functiontime-sensitive routeing problemsvehicle routeing heuristicvehicle scheduling

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 6129109
• A LP-based heuristic for a time-constrained routing problem
• Efficient heuristics for vehicle routing problems with time-dependent travel times
• A heuristic for the vehicle routing problem with time windows
• A class of heuristic algorithms for the routing problem
• scientific article; zbMATH DE number 1264444
• An Exchange Heuristic for Routeing Problems with Time Windows
• A powerful route minimization heuristic for the vehicle routing problem with time windows
• Vehicle routing problem with uncertain travelling time and a heuristic algorithm

Cited in

(19)

• Heuristic methods and applications: A categorized survey
• A heuristic approach to the overnight security service problem
• A heuristic method for dispatching repair men
• A heuristic algorithm for the earliest arrival flow with multiple sources
• An emergency vehicle dispatching system for an electric utility in Chile
• A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy
• Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
• scientific article; zbMATH DE number 5669804 (Why is no real title available?)
• Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
• Modeling Distribution Problems with Time Windows: Part I
• Vehicle-scheduling Problems with Uncertainty and Omitted Customers
• A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system
• scientific article; zbMATH DE number 1264444 (Why is no real title available?)
• Heuristics for tactical time slot management: a periodic vehicle routing problem view
• A greedy look-ahead heuristic for the vehicle routing problem with time windows
• The Vehicle Routing Problem with Time Constraints
• scientific article; zbMATH DE number 915579 (Why is no real title available?)
• scientific article; zbMATH DE number 6129109 (Why is no real title available?)
• The grocery superstore vehicle scheduling problem

This page was built for publication: An Heuristic Method for Solving Time-Sensitive Routeing Problems

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