Pages that link to "Item:Q4648258"

The following pages link to A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems (Q4648258):

Displaying 50 items.

• An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem (Q297272) (← links)
• Rich vehicle routing problems: from a taxonomy to a definition (Q299767) (← links)
• Sequential and parallel large neighborhood search algorithms for the periodic location routing problem (Q319012) (← links)
• Consolidating home meal delivery with limited operational disruption (Q319069) (← links)
• An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) (← links)
• A hybrid algorithm for a class of vehicle routing problems (Q336559) (← links)
• Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm (Q337247) (← links)
• A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
• Hybrid metaheuristics for the clustered vehicle routing problem (Q337513) (← links)
• Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (Q337527) (← links)
• A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading (Q337617) (← links)
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) (← links)
• A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows (Q342060) (← links)
• Technical note: Split algorithm in \(O(n)\) for the capacitated vehicle routing problem (Q342313) (← links)
• Multi-depot vessel routing problem in a direction dependent wavefield (Q405664) (← links)
• A set-covering based heuristic algorithm for the periodic vehicle routing problem (Q406496) (← links)
• Integrated production and multiple trips vehicle routing with time windows and uncertain travel times (Q1634047) (← links)
• Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer (Q1634057) (← links)
• Solving the multi-vehicle multi-covering tour problem (Q1651551) (← links)
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211) (← links)
• An iterated tabu search for the multi-compartment vehicle routing problem (Q1652237) (← links)
• The flexible periodic vehicle routing problem (Q1652351) (← links)
• Metaheuristics for the tabu clustered traveling salesman problem (Q1652436) (← links)
• The periodic supply vessel planning problem with flexible departure times and coupled vessels (Q1652603) (← links)
• A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem (Q1664832) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
• A robust multi-trip vehicle routing problem of perishable products with intermediate depots and time windows (Q1686418) (← links)
• Designing granular solution methods for routing problems with time windows (Q1694925) (← links)
• A relax-and-repair heuristic for the swap-body vehicle routing problem (Q1695791) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• Diversity controlling genetic algorithm for order acceptance and scheduling problem (Q1718199) (← links)
• Knowledge-guided local search for the vehicle routing problem (Q1722960) (← links)
• Heuristics for vehicle routing problems: sequence or set optimization? (Q1722969) (← links)
• Limited memory rank-1 cuts for vehicle routing problems (Q1728212) (← links)
• An emergency logistics distribution routing model for unexpected events (Q1730450) (← links)
• Fresh seafood delivery routing problem using an improved ant colony optimization (Q1730650) (← links)
• Efficiently solving very large-scale routing problems (Q1738815) (← links)
• Dynamic optimisation of preventative and corrective maintenance schedules for a large scale urban drainage system (Q1752832) (← links)
• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
• Data-driven assignment of delivery patterns with handling effort considerations in retail (Q1782198) (← links)
• A GVNS algorithm for solving the multi-depot vehicle routing problem (Q1791946) (← links)
• Routing a mix of conventional, plug-in hybrid, and electric vehicles (Q1991124) (← links)
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops (Q2018107) (← links)
• A simple and effective hybrid genetic search for the job sequencing and tool switching problem (Q2027021) (← links)
• The collaborative consistent vehicle routing problem with workload balance (Q2030339) (← links)
• Outreach strategies for vaccine distribution: a multi-period stochastic modeling approach (Q2033398) (← links)