Pages that link to "Item:Q935682"

The following pages link to The vehicle routing problem. Latest advances and new challenges. (Q935682):

Displaying 50 items.

• A GRASP with evolutionary path relinking for the truck and trailer routing problem (Q632678) (← links)
• Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation (Q632696) (← links)
• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
• The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
• Part logistics in the automotive industry: decision problems, literature review and research agenda (Q726233) (← links)
• PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems (Q887207) (← links)
• A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
• Adaptive demand peak management in online transport process planning (Q989614) (← links)
• Immunity-based evolutionary algorithm for optimal global container repositioning in liner shipping (Q989639) (← links)
• An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem (Q1025258) (← links)
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
• Using a TSP heuristic for routing order pickers in warehouses (Q1044093) (← links)
• A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• A decomposition heuristic for a rich production routing problem (Q1651659) (← links)
• A VNS approach to multi-location inventory redistribution with vehicle routing (Q1652123) (← links)
• Vehicle routing with backhauls: review and research perspectives (Q1652540) (← links)
• A matheuristic for the asymmetric capacitated vehicle routing problem (Q1686058) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• A cluster-first route-second approach for the swap body vehicle routing problem (Q1695789) (← links)
• An ILP-based local search procedure for the VRP with pickups and deliveries (Q1698289) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• The dynamic bowser routing problem (Q1711454) (← links)
• Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
• A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands (Q1730662) (← links)
• Dynamic courier routing for a food delivery service (Q1738833) (← links)
• Vehicle selection for a multi-compartment vehicle routing problem (Q1750481) (← links)
• Solving the stochastic time-dependent orienteering problem with time windows (Q1751260) (← links)
• Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
• Efficient algorithms for the double traveling salesman problem with multiple stacks (Q1762078) (← links)
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem (Q1762131) (← links)
• Linear formulations for the vehicle routing problem with synchronization constraints (Q1792416) (← links)
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
• Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
• Vehicle routing problems with loading constraints: state-of-the-art and future directions (Q2018104) (← links)
• Accounting for cost heterogeneity on the demand in the context of a technician dispatching problem (Q2023966) (← links)
• Optimizing logistics routings in a network perspective of supply and demand nodes (Q2033331) (← links)
• Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters (Q2106726) (← links)
• Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868) (← links)
• A granular local search matheuristic for a heterogeneous fleet vehicle routing problem with stochastic travel times (Q2148147) (← links)
• An approximation algorithm for solving the heterogeneous Chinese postman problem (Q2151360) (← links)
• Approximation of the Shapley value for the Euclidean travelling salesman game (Q2158624) (← links)
• Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
• Feeder routing for air-to-air refueling operations (Q2171624) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• A concise guide to existing and emerging vehicle routing problem variants (Q2184128) (← links)