Pages that link to "Item:Q339539"

The following pages link to Variable neighborhood search for location routing (Q339539):

Displaying 33 items.

• A survey of recent research on location-routing problems (Q296678) (← links)
• Solving the dynamic capacitated location-routing problem with fuzzy demands by hybrid heuristic algorithm (Q296782) (← links)
• The latency location-routing problem (Q323569) (← links)
• Variable neighborhood search for the pharmacy duty scheduling problem (Q337137) (← links)
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion (Q337223) (← links)
• A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows (Q337225) (← links)
• Skewed general variable neighborhood search for the location routing scheduling problem (Q337608) (← links)
• A hybrid variable neighborhood search for the orienteering problem with mandatory visits and exclusionary constraints (Q1652104) (← links)
• A general variable neighborhood search for the swap-body vehicle routing problem (Q1652113) (← links)
• A survey of the standard location-routing problem (Q1698292) (← links)
• Mathematical modelling and heuristic approaches to the location-routing problem of a cost-effective integrated solid waste management (Q1730644) (← links)
• Designing a sustainable supply chain network integrated with vehicle routing: a comparison of hybrid swarm intelligence metaheuristics (Q2002867) (← links)
• Parallel-machine group scheduling with inclusive processing set restrictions, outsourcing option and serial-batching under the effect of step-deterioration (Q2022187) (← links)
• A matheuristic for the 0--1 generalized quadratic multiple knapsack problem (Q2070116) (← links)
• A parallel variable neighborhood search for solving covering salesman problem (Q2070124) (← links)
• Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem (Q2070127) (← links)
• A covering traveling salesman problem with profit in the last mile delivery (Q2070135) (← links)
• The vacation planning problem: a multi-level clustering-based metaheuristic approach (Q2108189) (← links)
• A variable neighborhood search based matheuristic for a waste cooking oil collection network design problem (Q2140329) (← links)
• The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches (Q2156989) (← links)
• Hybrid evolutionary search for the traveling repairman problem with profits (Q2224863) (← links)
• Introduction of an underground waste container system-model and solution approaches (Q2239914) (← links)
• Solving a bi-objective transportation location routing problem by metaheuristic algorithms (Q2256166) (← links)
• Combinatorial GVNS (general variable neighborhood search) optimization for dynamic garbage collection (Q2331437) (← links)
• Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery (Q2514738) (← links)
• 0-1 quadratic knapsack problem solved with VNS algorithm (Q2631284) (← links)
• A variable neighborhood search algorithm for the vehicle routing problem with multiple trips (Q2631286) (← links)
• A fuzzy correlation based heuristic for dual-mode integrated location routing problem (Q2676327) (← links)
• A taxonomical analysis, current methods and objectives on location-routing problems (Q2865162) (← links)
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem (Q5278232) (← links)
• Efficient metaheuristics for the home (health)-care routing and scheduling problem with time windows and synchronized visits (Q6063509) (← links)
• Multiple traveling salesperson problem with drones: general variable neighborhood search approach (Q6068716) (← links)
• Metaheuristics for solving the biobjective single‐path multicommodity communication flow problem (Q6070981) (← links)