Pages that link to "Item:Q707148"

The following pages link to A two-phase hybrid metaheuristic for the vehicle routing problem with time windows (Q707148):

Displaying 37 items.

• Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers (Q301906) (← links)
• An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
• A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows (Q336957) (← links)
• An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows (Q337147) (← links)
• A fast tabu search implementation for large asymmetric traveling salesman problems defined on sparse graphs (Q505141) (← links)
• An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows (Q709143) (← links)
• The vehicle routing problem with flexible time windows and traveling times (Q860386) (← links)
• A general heuristic for vehicle routing problems (Q869003) (← links)
• An iterated local search algorithm for the vehicle routing problem with convex time penalty functions (Q943841) (← links)
• An iterated local search algorithm for the time-dependent vehicle routing problem with time windows (Q951117) (← links)
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits (Q1628066) (← links)
• A P-based hybrid evolutionary algorithm for vehicle routing problem with time windows (Q1717814) (← links)
• A two-phase heuristic algorithm for the problem of scheduling and vehicle routing for delivery of medication to patients (Q1721595) (← links)
• Heuristics for vehicle routing problems with backhauls, time windows, and 3D loading constraints (Q1754159) (← links)
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
• Exact and hybrid methods for the multiperiod field service routing problem (Q1788906) (← links)
• A multi-start local search algorithm for the vehicle routing problem with time windows (Q1887956) (← links)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
• Integrated planning of loaded and empty container movements (Q1944871) (← links)
• The online vehicle routing problem with occasional drivers (Q2027017) (← links)
• Estimation of the arrival time of deliveries by occasional drivers in a crowd-shipping setting (Q2158017) (← links)
• An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints (Q2190260) (← links)
• Minimizing total tardiness in parallel machine scheduling with setup times: an adaptive memory-based GRASP approach (Q2370333) (← links)
• The multi-period multi-trip container drayage problem with release and due dates (Q2664453) (← links)
• A decomposition approach for the stochastic asset protection problem (Q2669694) (← links)
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows (Q3057119) (← links)
• A memetic algorithm for the vehicle routing problem with time windows (Q3598046) (← links)
• Solution approaches for the vehicle routing problem with occasional drivers and time windows (Q5058379) (← links)
• A multi‐agent system for the decentralized resource‐constrained multi‐project scheduling problem (Q5438568) (← links)
• Vehicle routing problems with multiple trips (Q5890960) (← links)
• A two-phase approach for jointly determining the lot size and delivery policy in a vendor-buyer integrated system with rework (Q5891691) (← links)
• Vehicle routing problems with multiple trips (Q5915965) (← links)
• Combining variable neighborhood search and machine learning to solve the vehicle routing problem with crowd-shipping (Q6063502) (← links)
• A review on integrated scheduling and outbound vehicle routing problems (Q6168583) (← links)
• PathWyse: a flexible, open-source library for the resource constrained shortest path problem (Q6586912) (← links)