Pages that link to "Item:Q1752871"
From MaRDI portal
The following pages link to New benchmark instances for the capacitated vehicle routing problem (Q1752871):
Displaying 50 items.
- Visual attractiveness in routing problems: a review (Q1634050) (← links)
- Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems (Q1651704) (← links)
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
- Stochastic local search with learning automaton for the swap-body vehicle routing problem (Q1652446) (← links)
- An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
- Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
- Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
- Efficiently solving very large-scale routing problems (Q1738815) (← links)
- BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- Workload equity in vehicle routing: the impact of alternative workload resources (Q2002854) (← links)
- Cooperative versus non-cooperative parallel variable neighborhood search strategies: a case study on the capacitated vehicle routing problem (Q2022213) (← links)
- Neural large neighborhood search for routing problems (Q2093389) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- Exact approaches for the minimum subgraph diameter problem (Q2108148) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
- Deep policy dynamic programming for vehicle routing problems (Q2170197) (← links)
- An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach (Q2183219) (← links)
- A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)
- On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Solution strategies for the vehicle routing problem with backhauls (Q2228411) (← links)
- Designing multi-tier, multi-service-level, and multi-modal last-mile distribution networks for omni-channel operations (Q2240054) (← links)
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
- The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands (Q2664291) (← links)
- Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms (Q2664292) (← links)
- A study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← links)
- A progressive filtering heuristic for the location-routing problem and variants (Q2668599) (← links)
- A multiperiod drayage problem with customer-dependent service periods (Q2668610) (← links)
- A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations (Q2669602) (← links)
- Hybrid genetic search for the CVRP: open-source implementation and SWAP* neighborhood (Q2669771) (← links)
- Guidelines for the computational testing of machine learning approaches to vehicle routing problems (Q2670511) (← links)
- The min-cost parallel drone scheduling vehicle routing problem (Q2670526) (← links)
- Adjusting the order crossover operator for capacitated vehicle routing problems (Q2676389) (← links)
- In-depth analysis of granular local search for capacitated vehicle routing (Q2686133) (← links)
- Picker routing optimization of storage stacker based on improved multi-objective iterative local search algorithm (Q2691470) (← links)
- Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization (Q5086000) (← links)
- A branch-and-cut embedded matheuristic for the inventory routing problem (Q6047912) (← links)
- Approximating the chance-constrained capacitated vehicle routing problem with robust optimization (Q6054019) (← links)
- Safe and secure vehicle routing: a survey on minimization of risk exposure (Q6056884) (← links)
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
- Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
- Preprocessing to reduce vehicle capacity for routing problems (Q6097441) (← links)
- Recent advances in vehicle routing with stochastic demands: Bayesian learning for correlated demands and elementary branch-price-and-cut (Q6106761) (← links)
- Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem (Q6180050) (← links)
- Learning to repeatedly solve routing problems (Q6196890) (← links)
- An improved model for estimating optimal VRP solution values (Q6204199) (← links)
- On the exact solution of the multi-depot open vehicle routing problem (Q6492461) (← links)
