Pages that link to "Item:Q3315236"
From MaRDI portal
The following pages link to An Heuristic Method for Solving Time-Sensitive Routeing Problems (Q3315236):
Displaying 16 items.
- A lookahead partitioning heuristic for a new assignment and scheduling problem in a distribution system (Q421661) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- A heuristic approach to the overnight security service problem (Q1868811) (← links)
- A heuristic method for dispatching repair men (Q1908307) (← links)
- A heuristic algorithm for the earliest arrival flow with multiple sources (Q2016467) (← links)
- An emergency vehicle dispatching system for an electric utility in Chile (Q3157374) (← links)
- A greedy randomised search heuristic for time-constrained vehicle scheduling and the incorporation of a learning strategy (Q3157719) (← links)
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs (Q3202131) (← links)
- (Q3402743) (← links)
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing (Q3755217) (← links)
- Modeling Distribution Problems with Time Windows: Part I (Q3762057) (← links)
- Vehicle-scheduling Problems with Uncertainty and Omitted Customers (Q4206558) (← links)
- Heuristics for tactical time slot management: a periodic vehicle routing problem view (Q4601622) (← links)
- A greedy look-ahead heuristic for the vehicle routing problem with time windows (Q4658437) (← links)
- (Q4900606) (← links)
- The grocery superstore vehicle scheduling problem (Q5313395) (← links)