Pages that link to "Item:Q3028709"

The following pages link to Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints (Q3028709):

Displaying 50 items.

• Recent progress of local search in handling the time window constraints of the vehicle routing problem (Q5919996) (← links)
• Using constraint-based operators to solve the vehicle routing problem with time windows (Q5960031) (← links)
• Distribution of waiting time for dynamic pickup and delivery problems (Q5963102) (← links)
• Scheduling issues in vehicle routing (Q5963106) (← links)
• Multi-depot vehicle routing problem with time windows under shared depot resources (Q5963636) (← links)
• An improved matheuristic for solving the electric vehicle routing problem with time windows and synchronized mobile charging/battery swapping (Q6047843) (← links)
• Off-line approximate dynamic programming for the vehicle routing problem with a highly variable customer basis and stochastic demands (Q6047879) (← links)
• An adaptive large neighbourhood search algorithm for a real-world home care scheduling problem with time windows and dynamic breaks (Q6047908) (← links)
• A solution framework for the integrated periodic supply vessel planning and port scheduling in oil and gas supply logistics (Q6050361) (← links)
• Truck and drone routing problem with synchronization on arcs (Q6051591) (← links)
• Branch‐price‐and‐cut for the truck–drone routing problem with time windows (Q6054751) (← links)
• The daily routing and scheduling problem of home health care: based on costs and participants’ preference satisfaction (Q6056093) (← links)
• Safe and secure vehicle routing: a survey on minimization of risk exposure (Q6056884) (← links)
• The rendezvous vehicle routing problem (Q6057627) (← links)
• A stochastic approach for planning airport ground support resources (Q6060658) (← links)
• Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping (Q6063502) (← links)
• A general VNS for the multi-depot open vehicle routing problem with time windows (Q6063504) (← links)
• The split delivery vehicle routing problem with time windows and three-dimensional loading constraints (Q6065202) (← links)
• Trucks and drones cooperation in the last‐mile delivery process (Q6065833) (← links)
• A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← links)
• Crowdsourced logistics: The pickup and delivery problem with transshipments and occasional drivers (Q6065897) (← links)
• A learn‐and‐construct framework for general mixed‐integer programming problems (Q6066679) (← links)
• Adaptive large neighborhood search for the vehicle routing problem with synchronization constraints at the delivery location (Q6068533) (← links)
• Enhanced iterated local search for the technician routing and scheduling problem (Q6068708) (← links)
• Multi-armed bandit-based hyper-heuristics for combinatorial optimization problems (Q6069215) (← links)
• Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems (Q6069740) (← links)
• A case study of consistent vehicle routing problem with time windows (Q6070496) (← links)
• An exact solution method for home health care scheduling with synchronized services (Q6077479) (← links)
• Single-vehicle scheduling problem on a straight line with time window constraints (Q6085761) (← links)
• A nonlinear optimization model for the balanced vehicle routing problem with loading constraints (Q6088117) (← links)
• A model‐based heuristic to the vehicle routing and loading problem (Q6088121) (← links)
• A multilevel evaluation method for heuristics with an application to the VRPTW (Q6088238) (← links)
• Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
• Integrating production scheduling and transportation procurement through combinatorial auctions (Q6092655) (← links)
• Routing electric vehicles with a single recharge per route (Q6092658) (← links)
• Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge (Q6092665) (← links)
• Pre-auction lane selection in an integrated production–distribution planning problem (Q6094433) (← links)
• The vehicle routing problem with release dates and flexible time windows (Q6094583) (← links)
• Two-phase algorithm for solving vehicle routing problem with time windows (Q6097182) (← links)
• Point-to-point and milk run delivery scheduling: models, complexity results, and algorithms based on Benders decomposition (Q6099459) (← links)
• The Vehicle Routing Problem with Stochastic Demands and Split Deliveries (Q6102745) (← links)
• Metaheuristics: A Canadian Perspective (Q6102854) (← links)
• Minimizing earliness-tardiness costs in supplier networks -- a just-in-time truck routing problem (Q6106496) (← links)
• A matheuristic for the electric vehicle routing problem with time windows and a realistic energy consumption model (Q6106565) (← links)
• A two-stage stochastic location-routing problem for electric vehicles fast charging (Q6106597) (← links)
• Recent advances in integrating demand management and vehicle routing: a methodological review (Q6109246) (← links)
• A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows (Q6109341) (← links)
• The vehicle routing problem with time windows and flexible delivery locations (Q6112699) (← links)
• Small and large neighborhood search for the park-and-loop routing problem with parking selection (Q6112711) (← links)
• A branch-and-price-and-cut algorithm for the truck-based drone delivery routing problem with time windows (Q6112842) (← links)