Pages that link to "Item:Q1879785"

The following pages link to A simple and effective evolutionary algorithm for the vehicle routing problem (Q1879785):

Displaying 50 items.

• Solve the vehicle routing problem with time windows via a genetic algorithm (Q1030846) (← links)
• A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling (Q1043366) (← links)
• Genetic local search with distance preserving recombination operator for a vehicle routing problem. (Q1410618) (← links)
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) (← links)
• Solving the multi-vehicle multi-covering tour problem (Q1651551) (← links)
• A simple and effective evolutionary algorithm for the capacitated location-routing problem (Q1651634) (← links)
• Combining VNS with genetic algorithm to solve the one-to-one routing issue in road networks (Q1652107) (← links)
• An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
• A large neighbourhood metaheuristic for the risk-constrained cash-in-transit vehicle routing problem (Q1652128) (← links)
• A hybrid genetic algorithm for the heterogeneous dial-a-ride problem (Q1652211) (← links)
• A hybrid dynamic programming and memetic algorithm to the traveling salesman problem with hotel selection (Q1652522) (← links)
• Hybrid genetic algorithm for the open capacitated arc routing problem (Q1652524) (← links)
• A hybrid metaheuristic algorithm for the vehicle routing problem with stochastic demands (Q1654357) (← links)
• A problem-reduction evolutionary algorithm for solving the capacitated vehicle routing problem (Q1664832) (← links)
• A two-stage simulated annealing algorithm for the many-to-many milk-run routing problem with pipeline inventory cost (Q1665650) (← links)
• Metaheuristic approaches for solving truck and trailer routing problems with stochastic demands: a case study in dairy industry (Q1665815) (← 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 relax-and-repair heuristic for the swap-body vehicle routing problem (Q1695791) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• A hybrid GRASP+VND heuristic for the two-echelon vehicle routing problem arising in city logistics (Q1718582) (← links)
• Solving fixed charge transportation problem with truck load constraint using metaheuristics (Q1730658) (← links)
• A genetic algorithm for a green vehicle routing problem (Q1742204) (← links)
• Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
• Integrated production and distribution scheduling with a perishable product (Q1751906) (← links)
• The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches (Q1754738) (← links)
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
• Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865) (← links)
• Solving routing problems with pairwise synchronization constraints (Q1787918) (← links)
• Heuristics and memetic algorithm for the two-dimensional loading capacitated vehicle routing problem with time windows (Q1788902) (← links)
• A genetic algorithm for the vehicle routing problem (Q1870833) (← links)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• Multiobjective quantum evolutionary algorithm for the vehicle routing problem with customer satisfaction (Q1955318) (← links)
• A mathematical formulation and heuristic approach for the heterogeneous fixed fleet vehicle routing problem with simultaneous pickup and delivery (Q1983673) (← links)
• Routing a mix of conventional, plug-in hybrid, and electric vehicles (Q1991124) (← links)
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
• A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
• Outreach strategies for vaccine distribution: a multi-period stochastic modeling approach (Q2033398) (← links)
• On the one-to-one pickup-and-delivery problem with time windows and trailers (Q2051215) (← links)
• The multi-depot \(k\)-traveling repairman problem (Q2091220) (← links)
• Collection of different types of milk with multi-tank tankers under uncertainty: a real case study (Q2121608) (← links)
• The vehicle routing problem with time windows and evidential service and travel times: a recourse model (Q2146039) (← links)
• The doubly open park-and-loop routing problem (Q2147024) (← links)
• Integration of routing into a resource-constrained project scheduling problem (Q2175371) (← links)
• Combined maintenance and routing optimization for large-scale sewage cleaning (Q2178360) (← links)
• An integrated bi-objective optimization model and improved genetic algorithm for vehicle routing problems with temporal and spatial constraints (Q2190260) (← links)
• A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem (Q2240058) (← links)
• A cooperative parallel metaheuristic for the capacitated vehicle routing problem (Q2257342) (← links)
• A multi-compartment vehicle routing problem in cold-chain distribution (Q2273654) (← links)