Pages that link to "Item:Q869003"

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

Displaying 50 items.

• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet (Q1730643) (← links)
• Product-oriented time window assignment for a multi-compartment vehicle routing problem (Q1734344) (← links)
• Enhanced multi-directional local search for the bi-objective heterogeneous vehicle routing problem with multiple driving ranges (Q1737486) (← links)
• The multi-pickup and delivery problem with time windows (Q1744529) (← links)
• Adaptive large neighborhood search heuristics for multi-tier service deployment problems in clouds (Q1751896) (← links)
• A metaheuristic for the time-dependent pollution-routing problem (Q1751914) (← links)
• Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
• Scheduling identical parallel machines with tooling constraints (Q1752870) (← links)
• Large multiple neighborhood search for the clustered vehicle-routing problem (Q1754733) (← links)
• The line-haul feeder vehicle routing problem: mathematical model formulation and heuristic approaches (Q1754738) (← links)
• A time-based pheromone approach for the ant system (Q1758053) (← links)
• A study on the effect of the asymmetry on real capacitated vehicle routing problems (Q1761138) (← links)
• A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints (Q1761159) (← links)
• The inventory-routing problem with transshipment (Q1761192) (← links)
• Local search neighbourhoods for dealing with a novel nurse rostering model (Q1761887) (← links)
• An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem (Q1762031) (← links)
• Restricted dynamic programming: a flexible framework for solving realistic VRPs (Q1762058) (← links)
• An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling (Q1782149) (← links)
• A matheuristic method for the electric vehicle routing problem with time windows and fast chargers (Q1782172) (← links)
• Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves (Q1785252) (← links)
• A GVNS algorithm for solving the multi-depot vehicle routing problem (Q1791946) (← links)
• Heuristics for large constrained vehicle routing problems (Q1854901) (← links)
• Mid-term and short-term planning support for home health care services (Q1926677) (← links)
• A comparison of three metaheuristics for the workover rig routing problem (Q1926698) (← links)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
• MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems (Q1948529) (← links)
• Solving the tractor and semi-trailer routing problem based on a heuristic approach (Q1954504) (← links)
• An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
• Adaptive large neighborhood search algorithm for route planning of freight buses with pickup and delivery (Q1983730) (← links)
• The two-echelon capacitated electric vehicle routing problem with battery swapping stations: formulation and efficient methodology (Q1991213) (← links)
• Consistent vehicle routing problem with service level agreements: a case study in the pharmaceutical distribution sector (Q1991272) (← links)
• A multi-start local search heuristic for the green vehicle routing problem based on a multigraph reformulation (Q2003563) (← links)
• Analysing the effect of partner characteristics on the performance of horizontal carrier collaborations (Q2005850) (← links)
• An adaptive VNS algorithm for vehicle routing problems with intermediate stops (Q2018107) (← links)
• An adaptive large neighbourhood search heuristic for routing and scheduling feeder vessels in multi-terminal ports (Q2023947) (← links)
• Prioritized single nurse routing and scheduling for home healthcare services (Q2029260) (← links)
• Models and algorithms for the delivery and installation routing problem (Q2029957) (← links)
• Meta-analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search (Q2030591) (← links)
• Integrated planning for electric commercial vehicle fleets: a case study for retail mid-haul logistics networks (Q2030659) (← links)
• A metaheuristic algorithm and structured analysis for the Line-haul Feeder vehicle routing problem with time windows (Q2033323) (← links)
• An adaptive large neighborhood search algorithm for vehicle routing problem with multiple time windows constraints (Q2083393) (← links)
• A matheuristic for a 2-echelon vehicle routing problem with capacitated satellites and reverse flows (Q2083929) (← links)
• TLHSA and SACA: two heuristic algorithms for two variant VRP models (Q2084658) (← links)
• The synchronized multi-assignment orienteering problem (Q2097466) (← links)
• A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction (Q2108102) (← links)
• Iterated greedy algorithms for a complex parallel machine scheduling problem (Q2116861) (← links)
• Learning surrogate functions for the short-horizon planning in same-day delivery problems (Q2117229) (← links)
• Short-term scheduling of production fleets in underground mines using CP-based LNS (Q2117237) (← links)
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization (Q2125364) (← links)