Pages that link to "Item:Q976005"
From MaRDI portal
The following pages link to A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery (Q976005):
Displayed 50 items.
- A matheuristic approach for the pollution-routing problem (Q319140) (← links)
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
- Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services (Q336790) (← links)
- An iterated local search heuristic for the split delivery vehicle routing problem (Q337288) (← links)
- Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
- Improving the quality of heuristic solutions for the capacitated vertex \(p\)-center problem through iterated greedy local search with variable neighborhood descent (Q337640) (← links)
- Using parallel \& distributed computing for real-time solving of vehicle routing problems with stochastic demands (Q367631) (← links)
- Multiobjective vehicle routing problem with fixed delivery and optional collections (Q375980) (← links)
- Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
- Integrated ant colony and tabu search approach for time dependent vehicle routing problems with simultaneous pickup and delivery (Q405689) (← links)
- Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery (Q408394) (← links)
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557) (← links)
- Exact and heuristic approaches for the set cover with pairs problem (Q691479) (← links)
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads (Q724007) (← links)
- Shipper collaboration in forward and reverse logistics (Q781076) (← links)
- Optimizing energy consumption of robotic cells by a branch \& bound algorithm (Q1628117) (← links)
- Efficient local search limitation strategy for single machine total weighted tardiness scheduling with sequence-dependent setup times (Q1652166) (← links)
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem (Q1652289) (← links)
- An open source spreadsheet solver for vehicle routing problems (Q1652315) (← links)
- A parallel variable neighborhood search for the vehicle routing problem with divisible deliveries and pickups (Q1652352) (← links)
- Exact and heuristic algorithms for order acceptance and scheduling with sequence-dependent setup times (Q1652516) (← links)
- Parallel local search algorithms for high school timetabling problems (Q1681327) (← links)
- The static bike relocation problem with multiple vehicles and visits (Q1681499) (← links)
- Order matters -- a variable neighborhood search for the swap-body vehicle routing problem (Q1694919) (← links)
- A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics (Q1718582) (← links)
- The multi-pickup and delivery problem with time windows (Q1744529) (← links)
- Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries (Q1761164) (← links)
- Route and speed optimization for autonomous trucks (Q1782162) (← links)
- A tabu search algorithm for the vehicle routing problem with discrete split deliveries and pickups (Q1782165) (← links)
- A GVNS algorithm for solving the multi-depot vehicle routing problem (Q1791946) (← links)
- A simple and effective metaheuristic for the minimum latency problem (Q1926884) (← links)
- A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery (Q1983673) (← links)
- A fast randomized algorithm for the heterogeneous vehicle routing problem with simultaneous pickup and delivery (Q2005557) (← links)
- An on-demand same-day delivery service using direct peer-to-peer transshipment strategies (Q2005834) (← links)
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects (Q2070134) (← links)
- A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (Q2108102) (← links)
- Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
- A bi-objective two-echelon pollution routing problem with simultaneous pickup and delivery under multiple time windows constraint (Q2150477) (← links)
- Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
- Parallel computational optimization in operations research: a new integrative framework, literature review and research directions (Q2189911) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- A study on intelligent user-centric logistics service model using ontology (Q2336182) (← links)
- Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care (Q2356017) (← links)
- Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
- A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
- A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit (Q2630092) (← links)
- A review of vehicle routing with simultaneous pickup and delivery (Q2664320) (← links)
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem (Q2668616) (← links)
- Adaptive large neighborhood search for vehicle routing problems with transshipment facilities arising in city logistics (Q2669614) (← links)