Pages that link to "Item:Q869003"

The following pages link to A general heuristic for vehicle routing problems (Q869003):

Displaying 50 items.

• Adaptive large neighborhood search for mixed integer programming (Q2146445) (← links)
• Integrating order delivery and return operations for order fulfillment in an online retail environment (Q2147018) (← links)
• A time-dependent vessel routing problem with speed optimization (Q2158051) (← links)
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem (Q2178077) (← links)
• Exact algorithms for the multi-pickup and delivery problem with time windows (Q2178121) (← links)
• Recent advances in selection hyper-heuristics (Q2183846) (← links)
• Decision making on post-disaster rescue routing problems from the rescue efficiency perspective (Q2184119) (← links)
• The vehicle routing problem with arrival time diversification on a multigraph (Q2184148) (← links)
• The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips (Q2185519) (← links)
• The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers (Q2185532) (← links)
• A decision framework for automatic guided vehicle routing problem with traffic congestions (Q2223261) (← links)
• Integrated order batching and vehicle routing operations in grocery retail -- a general adaptive large neighborhood search algorithm (Q2240047) (← links)
• An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots (Q2240065) (← links)
• A matheuristic approach to large-scale avionic scheduling (Q2241154) (← links)
• Exact and heuristic algorithms for the fleet composition and periodic routing problem of offshore supply vessels with berth allocation decisions (Q2242377) (← links)
• A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority (Q2251139) (← links)
• Gossip algorithms for heterogeneous multi-vehicle routing problems (Q2252974) (← links)
• An adaptive large neighborhood search heuristic for the pollution-routing problem (Q2253352) (← links)
• A method of estimating computational complexity based on input conditions for \(N\)-vehicle problem (Q2267269) (← links)
• The dynamic multi-period vehicle routing problem (Q2270447) (← links)
• Hyper-heuristic approaches for the response time variability problem (Q2275609) (← links)
• A lexicographic minimax approach to the vehicle routing problem with route balancing (Q2282498) (← links)
• Matheuristics for slot planning of container vessel bays (Q2286874) (← links)
• A new efficient approach for solving the capacitated vehicle routing problem using the gravitational emulation local search algorithm (Q2294011) (← links)
• Vehicle routing with transportable resources: using carpooling and walking for on-site services (Q2315653) (← links)
• A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
• Ant colony system with characterization-based heuristics for a bottled-products distribution logistics system (Q2349706) (← links)
• A heuristic algorithm for the free newspaper delivery problem (Q2355940) (← links)
• Heuristics for multi-attribute vehicle routing problems: a survey and synthesis (Q2356202) (← links)
• The nuclear medicine production and delivery problem (Q2356256) (← links)
• The consultation timetabling problem at Danish high schools (Q2359151) (← links)
• A variable neighbourhood search algorithm for the open vehicle routing problem (Q2378421) (← links)
• A unified exact method for solving different classes of vehicle routing problems (Q2390996) (← links)
• Adaptive large neighborhood search for the curriculum-based course timetabling problem (Q2398424) (← links)
• A hybrid genetic algorithm for the multi-depot open vehicle routing problem (Q2454370) (← links)
• Integrating multi-product production and distribution in newspaper logistics (Q2459393) (← links)
• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (Q2482819) (← links)
• Very large-scale vehicle routing: new test problems, algorithms, and results (Q2485169) (← links)
• A unified solution framework for multi-attribute vehicle routing problems (Q2514767) (← links)
• Implicit depot assignments and rotations in vehicle routing heuristics (Q2514807) (← links)
• Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
• The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
• A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
• The two-echelon inventory-routing problem with fleet management (Q2664298) (← links)
• The distributionally robust machine scheduling problem with job selection and sequence-dependent setup times (Q2664350) (← links)
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem (Q2664363) (← links)
• Simultaneously exploiting two formulations: an exact Benders decomposition approach (Q2664373) (← links)
• A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints (Q2664428) (← links)
• A metaheuristic based on tabu search for solving a technician routing and scheduling problem (Q2664434) (← links)
• Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)