Pages that link to "Item:Q6066301"

The following pages link to An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls (Q6066301):

Displaying 12 items.

• 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)
• A biased-randomized discrete-event heuristic for coordinated multi-vehicle container transport across interconnected networks (Q2140358) (← links)
• A biased-randomized algorithm for optimizing efficiency in parametric earthquake (re) insurance solutions (Q2664361) (← links)
• A review of the role of heuristics in stochastic optimisation: from metaheuristics to learnheuristics (Q2678624) (← links)
• On the role of metaheuristic optimization in bioinformatics (Q6056877) (← links)
• Agile optimization for a real‐time facility location problem in Internet of Vehicles networks (Q6065907) (← links)
• Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility (Q6066586) (← links)
• A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains (Q6066639) (← links)
• A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles (Q6067894) (← links)
• A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
• The capacitated family traveling salesperson problem (Q6195021) (← links)
• A multistart biased‐randomized algorithm for solving a three‐dimensional case picking problem with real‐life constraints (Q6195023) (← links)