Pages that link to "Item:Q4291474"

The following pages link to Parallel iterative search methods for vehicle routing problems (Q4291474):

Displayed 50 items.

• The \(k\)-dissimilar vehicle routing problem (Q319301) ‎ (← links)
• An ant colony system for responsive dynamic vehicle routing (Q319660) ‎ (← links)
• An integrative cooperative search framework for multi-decision-attribute combinatorial optimization: application to the MDPVRP (Q319782) ‎ (← links)
• Large neighborhood search for multi-trip vehicle routing (Q323545) ‎ (← links)
• A memetic algorithm for the travelling salesperson problem with hotel selection (Q336356) ‎ (← links)
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) ‎ (← links)
• A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows (Q339607) ‎ (← links)
• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) ‎ (← links)
• Optimised crossover genetic algorithm for capacitated vehicle routing problem (Q438026) ‎ (← links)
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947) ‎ (← links)
• Lower and upper bounds for the \(m\)-peripatetic vehicle routing problem (Q633484) ‎ (← links)
• Local search heuristics for the probabilistic dial-a-ride problem (Q657055) ‎ (← links)
• A survey of very large-scale neighborhood search techniques (Q697563) ‎ (← links)
• A tabu search algorithm for the open vehicle routing problem (Q703907) ‎ (← links)
• A library of local search heuristics for the vehicle routing problem (Q708775) ‎ (← links)
• A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) ‎ (← links)
• A comparison of five heuristics for the multiple depot vehicle scheduling problem (Q835636) ‎ (← links)
• Computing nine new best-so-far solutions for capacitated VRP with a cellular genetic algorithm (Q844205) ‎ (← links)
• Adaptive memory programming for the vehicle routing problem with multiple trips (Q850308) ‎ (← links)
• The service allocation problem at the Gioia Tauro maritime terminal (Q852990) ‎ (← links)
• A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector (Q863996) ‎ (← links)
• A general heuristic for vehicle routing problems (Q869003) ‎ (← links)
• General solutions to the single vehicle routing problem with pickups and deliveries (Q869591) ‎ (← links)
• Designing delivery districts for the vehicle routing problem with stochastic demands (Q872114) ‎ (← links)
• An efficient variable neighborhood search heuristic for very large scale vehicle routing problems (Q875422) ‎ (← links)
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) ‎ (← links)
• A neural-tabu search heuristic for the real time vehicle routing problem (Q928694) ‎ (← links)
• A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) ‎ (← links)
• Honey bees mating optimization algorithm for large scale vehicle routing problems (Q968387) ‎ (← links)
• A comparison of problem decomposition techniques for the FAP (Q972658) ‎ (← links)
• Lasso solution strategies for the vehicle routing problem with pickups and deliveries (Q1011218) ‎ (← links)
• A tabu search heuristic for the vehicle routing problem with private fleet and common carrier (Q1026772) ‎ (← links)
• An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls (Q1037690) ‎ (← links)
• Solving a manpower scheduling problem for airline catering using metaheuristics (Q1041027) ‎ (← links)
• Parallel processing for difficult combinatorial optimization problems (Q1268289) ‎ (← links)
• Planning models for freight transportation (Q1278638) ‎ (← links)
• Combination of local search and CLP in the vehicle-fleet scheduling problem (Q1278727) ‎ (← links)
• A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints (Q1342310) ‎ (← links)
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective (Q1362944) ‎ (← links)
• Improvement heuristics for the vehicle routing problem based on simulated annealing (Q1390235) ‎ (← links)
• A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem. (Q1410330) ‎ (← links)
• D-Ants: Savings Based Ants divide and conquer the vehicle routing problem. (Q1427099) ‎ (← links)
• The periodic vehicle routing problem with intermediate facilities (Q1600833) ‎ (← links)
• Use of the BATA algorithm and MIS to solve the mail carrier problem (Q1614192) ‎ (← links)
• Large-scale vehicle routing problems: quantum annealing, tunings and results (Q1652398) ‎ (← links)
• An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) ‎ (← links)
• A monarch butterfly optimization for the dynamic vehicle routing problem (Q1657092) ‎ (← links)
• A survey of the standard location-routing problem (Q1698292) ‎ (← links)
• Decomposition techniques with mixed integer programming and heuristics for home healthcare planning (Q1699130) ‎ (← links)
• A comparison of algorithms for finding an efficient theme park tour (Q1741683) ‎ (← links)