Pages that link to "Item:Q3028709"
From MaRDI portal
The following pages link to Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints (Q3028709):
Displaying 50 items.
- Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
- Dynamic multi-period vehicle routing with touting (Q6113318) (← links)
- A large neighborhood search-based matheuristic for the load-dependent electric vehicle routing problem with time windows (Q6115623) (← links)
- A survey of attended home delivery and service problems with a focus on applications (Q6142935) (← links)
- A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup (Q6150242) (← links)
- A general variable neighborhood search for the traveling salesman problem with time windows under various objectives (Q6153469) (← links)
- Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows (Q6160235) (← links)
- Bi-objective blood product scheduling under blood shortage and limited supply (Q6160376) (← links)
- Ant colony algorithm for the multi-depot vehicle routing problem in large quantities by a heterogeneous fleet of vehicles (Q6160382) (← links)
- Hybridation de l’algorithme de colonie de Fourmis avec l’algorithme de recherche à grand Voisinage pour la résolution du VRPTW statique et dynamique (Q6160384) (← links)
- The Synchronized Dynamic Vehicle Dispatching Problem (Q6160388) (← links)
- Benchmark Suite for Industrial and Tramp Ship Routing and Scheduling Problems (Q6160413) (← links)
- Solution validator and visualizer for (combined) vehicle routing and container loading problems (Q6165407) (← links)
- An integer L-shaped algorithm for the vehicle routing problem with time windows and stochastic demands (Q6167539) (← links)
- A review on integrated scheduling and outbound vehicle routing problems (Q6168583) (← links)
- Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics (Q6168592) (← links)
- A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics (Q6173789) (← links)
- Solving vehicle routing problems with intermediate stops using VRPSolver models (Q6179690) (← links)
- Mobile parcel lockers with individual customer service (Q6180035) (← links)
- Z-trapezoidal risk assessment for multi-objective Hazmat routing model with time windows (Q6186575) (← links)
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)
- A two‐stage method for the shipper lane selection problem with time windows in transportation service procurement (Q6195025) (← links)
- Solving a pickup and delivery routing problem for fourth‐party logistics providers (Q6195030) (← links)
- QMOEA: a Q-learning-based multiobjective evolutionary algorithm for solving time-dependent green vehicle routing problems with time windows (Q6195430) (← links)
- Solving large-scale routing optimization problems with networks and only networks (Q6204267) (← links)
- On the exact solution of the multi-depot open vehicle routing problem (Q6492461) (← links)
- Scheduling-location problem with drones (Q6495369) (← links)
- Systematic review of the latest scientific publications on the vehicle routing problem (Q6544925) (← links)
- An improved sequential insertion algorithm and tabu search to vehicle routing problem with time windows (Q6550936) (← links)
- A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery (Q6551059) (← links)
- Stochastic inventory routing with dynamic demands and intra-day depletion (Q6551100) (← links)
- An adaptive variable neighbourhood search approach for the dynamic vehicle routing problem (Q6551141) (← links)
- Exact solution method for vehicle-and-drone cooperative delivery routing of blood products (Q6551173) (← links)
- Synchronisation in vehicle routing: classification schema, modelling framework and literature review (Q6555167) (← links)
- Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives (Q6555172) (← links)
- New benchmark instances for the inventory routing problem (Q6555180) (← links)
- The supply of convenience stores: challenges of short-distance routing within the constraints of working time regulations (Q6556096) (← links)
- A comparative study of alternative formulations for the periodic vehicle routing problem (Q6561226) (← links)
- A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles (Q6561246) (← links)
- Two-echelon time-dependent vehicle routing problem with simultaneous pickup and delivery and satellite synchronization (Q6568433) (← links)
- General VNS for asymmetric vehicle routing problem with time and capacity constraints (Q6568438) (← links)
- Route recombination for deterministic and non-deterministic orienteering problems with time windows: a dynamic programming approach (Q6568479) (← links)
- Vehicle routing with stochastic demand, service and waiting times -- the case of food bank collection problems (Q6572838) (← links)
- An accelerated benders decomposition algorithm for the solution of the multi-trip time-dependent vehicle routing problem with time windows (Q6572891) (← links)
- An exact method for a last-mile delivery routing problem with multiple deliverymen (Q6572895) (← links)
- Fleet resupply by drones for last-mile delivery (Q6586265) (← links)
- Reducing police response times: optimization and simulation of everyday police patrol (Q6599077) (← links)
- Vehicle routing with time-dependent travel times: theory, practice, and benchmarks (Q6602334) (← links)
- Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens (Q6609700) (← links)
- Improving neighborhood exploration into MOEA/D framework to solve a bi-objective routing problem (Q6609702) (← links)