Pages that link to "Item:Q622144"
From MaRDI portal
The following pages link to An Ant Colony algorithm hybridized with insertion heuristics for the Time Dependent Vehicle Routing Problem with Time Windows (Q622144):
Displayed 20 items.
- Time-dependent routing problems: a review (Q342083) (← links)
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← links)
- A hybrid chaos-particle swarm optimization algorithm for the vehicle routing problem with time window (Q742692) (← links)
- A combined multistart random constructive heuristic and set partitioning based formulation for the vehicle routing problem with time dependent travel times (Q1651555) (← links)
- Particle swarm optimization iterative identification algorithm and gradient iterative identification algorithm for Wiener systems with colored noise (Q1654314) (← links)
- Integrated optimal scheduling of repair crew and relief vehicle after disaster (Q1722985) (← links)
- Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← links)
- A hybrid algorithm for time-dependent vehicle routing problem with time windows (Q2027083) (← links)
- Multi-trip time-dependent vehicle routing problem with time windows (Q2029965) (← links)
- Heterogeneous fleet management for one-way electric carsharing system with optional orders, vehicle relocation and on-demand recharging (Q2147167) (← links)
- Minimizing late deliveries in a truck loading problem (Q2189887) (← links)
- A hybrid ant colony optimization algorithm for a multi-objective vehicle routing problem with flexible time windows (Q2214966) (← links)
- A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority (Q2251139) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- The time-dependent orienteering problem with time windows: a fast ant colony system (Q2400030) (← links)
- A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
- The secure time-dependent vehicle routing problem with uncertain demands (Q2668686) (← links)
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem (Q2676342) (← links)
- A simheuristic algorithm for time-dependent waste collection management with stochastic travel times (Q5158698) (← links)
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)