Pages that link to "Item:Q1772865"
From MaRDI portal
The following pages link to Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865):
Displayed 16 items.
- Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) (← links)
- A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector (Q863996) (← links)
- An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) (← links)
- Active-guided evolution strategies for large-scale capacitated vehicle routing problems (Q878570) (← links)
- A reactive variable neighborhood tabu search for the heterogeneous fleet vehicle routing problem with time windows (Q953316) (← links)
- Honey bees mating optimization algorithm for large scale vehicle routing problems (Q968387) (← links)
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm (Q976404) (← links)
- A hybrid evolution strategy for the open vehicle routing problem (Q1038279) (← links)
- An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries (Q1039783) (← links)
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints (Q2378414) (← links)
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm (Q2465483) (← links)
- Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering (Q2483486) (← links)
- Path relinking for the vehicle routing problem (Q2491329) (← links)
- Edge assembly-based memetic algorithm for the capacitated vehicle routing problem (Q3057120) (← links)
- An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems (Q3564361) (← links)
- An adaptive memory programming method for risk logistics operations (Q4678215) (← links)
